The logic of a physical system consists of the elementary observables of the system. We show that for chaotic systems the logic is not any more the classical Boolean lattice but a kind of fuzzy logic which we characterize for a class of chaotic maps. Among other interesting properties the fuzzy logic of chaos does not allow for infinite combinations of propositions. This fact reflects the instability of dynamics and it is shared also by quantum systems with diagonal singularity. We (...) also generalize the fuzzy implication to a probabilistic implication following the hint of von Neumann. In this way we can evaluate the probability of the validity of the logical inference. (shrink)

Using the mathematical notion of an entity to represent states in quantum and classical mechanics, we show that, in a strict sense, proper superpositions are possible in classical mechanics.

In this article we establish the undecidability of representability and of finite representability as algebras of binary relations in a wide range of signatures. In particular, representability and finite representability are undecidable for Boolean monoids and lattice ordered monoids, while representability is undecidable for Jónsson's relation algebra. We also establish a number of undecidability results for representability as algebras of injective functions.

We offer a proof of the duality theorem for finitely presented MV-algebras and rational polyhedra, a folklore and yet fundamental result. Our approach develops first a general dual adjunction between MV-algebras and subspaces of Tychonoff cubes, endowed with the transformations that are definable in the language of MV-algebras. We then show that this dual adjunction restricts to a duality between semisimple MV-algebras and closed subspaces of Tychonoff cubes. The duality theorem for finitely presented objects is obtained by a further specialisation. (...) Our treatment is aimed at showing exactly which parts of the basic theory of MV-algebras are needed in order to establish these results, with an eye towards future generalisations. (shrink)

In this paper it is shown that Heyting and Co-Heyting mereological systems provide a convenient conceptual framework for spatial reasoning, in which spatial concepts such as connectedness, interior parts, (exterior) contact, and boundary can be defined in a natural and intuitively appealing way. This fact refutes the wide-spread contention that mereology cannot deal with the more advanced aspects of spatial reasoning and therefore has to be enhanced by further non-mereological concepts to overcome its congenital limitations. The allegedly unmereological concept of (...) boundary is treated in detail and shown to be essentially affected by mereological considerations. More precisely, the concept of boundary turns out to be realizable in a variety of different mereologically grounded versions. In particular, every part K of a Heyting algebra H gives rise to a well-behaved K-relative boundary operator. (shrink)

In this paper a solution of Whitehead’s problem is presented: Starting with a purely mereological system of regions a topological space is constructed such that the class of regions is isomorphic to the Boolean lattice of regular open sets of that space. This construction may be considered as a generalized completion in analogy to the well-known Dedekind completion of the rational numbers yielding the real numbers . The argument of the paper relies on the theories of continuous lattices and “pointless” (...) topology.

. (shrink)

The first aim of this paper is to elucidate Russell’s construction of spatial points, which is to be <br>considered as a paradigmatic case of the "logical constructions" that played a central role in his epistemology and theory of science. Comparing it with parallel endeavours carried out by Carnap and Stone it is argued that Russell’s construction is best understood as a structural representation. It is shown that Russell’s and Carnap’s representational constructions may be considered as incomplete and sketchy harbingers of (...) Stone’s representation theorems. The representational program inaugurated by Stone’s theorems was one of the success stories of 20th century’s mathematics. This suggests that representational constructions à la Stone could also be important for epistemology and philosophy of science. More specifically it is argued that the issues proposed by Russellian definite descriptions, logical constructions, and structural representations still have a place on the agenda of contemporary epistemology and philosophy of science. Finally, the representational interpretation of Russell’s logical constructivism is used to shed some new light on the recently vigorously discussed topic of his structural realism. (shrink)

The principle of set theory known as the Axiom of Choice has been hailed as “probably the most interesting and, in spite of its late appearance, the most discussed axiom of mathematics, second only to Euclid's axiom of parallels which was introduced more than two thousand years ago” (Fraenkel, Bar-Hillel & Levy 1973, §II.4). The fulsomeness of this description might lead those unfamiliar with the axiom to expect it to be as startling as, say, the Principle of the Constancy of (...) the Velocity of Light or the Heisenberg Uncertainty Principle. But in fact the Axiom of Choice as it is usually stated appears humdrum, even self-evident. For it amounts to nothing more than the claim that, given any collection of mutually disjoint nonempty sets, it is possible to assemble a new set — a transversal or choice set — containing exactly one element from each member of the given collection. Nevertheless, this seemingly innocuous principle has far-reaching mathematical consequences — many indispensable, some startling — and has come to figure prominently in discussions on the foundations of mathematics. It (or its equivalents) have been employed in countless mathematical papers, and a number of monographs have been exclusively devoted to it. (shrink)

After a brief review of ontic and epistemic descriptions, and of subjective, logical and statistical interpretations of probability, we summarize the traditional axiomatization of calculus of probability in terms of Boolean algebras and its set-theoretical realization in terms of Kolmogorov probability spaces. Since the axioms of mathematical probability theory say nothing about the conceptual meaning of “randomness” one considers probability as property of the generating conditions of a process so that one can relate randomness with predictability (or retrodictability). In the (...) measure-theoretical codification of stochastic processes genuine chance processes can be defined rigorously as so-called regular processes which do not allow a long-term prediction. We stress that stochastic processes are equivalence classes of individual point functions so that they do not refer to individual processes but only to an ensemble of statistically equivalent individual processes. Less popular but conceptually more important than statistical descriptions are individual descriptions which refer to individual chaotic processes. First, we review the individual description based on the generalized harmonic analysis by Norbert Wiener. It allows the definition of individual purely chaotic processes which can be interpreted as trajectories of regular statistical stochastic processes. Another individual description refers to algorithmic procedures which connect the intrinsic randomness of a finite sequence with the complexity of the shortest program necessary to produce the sequence. Finally, we ask why there can be laws of chance. We argue that random events fulfill the laws of chance if and only if they can be reduced to (possibly hidden) deterministic events. This mathematical result may elucidate the fact that not all nonpredictable events can be grasped by the methods of mathematical probability theory. (shrink)

This paper illustrates how Priestley duality can be used in the transfer of an optimal natural duality from a minimal generating algebra for a quasi-variety to other generating algebras. Detailed calculations are given for the quasi-variety of Kleene algebras and the quasi-varieties n of pseudocomplemented distributive lattices (n 1).

In this paper we give an example of intertranslatability between an ontology of individuals (nominalism), an ontology of properties (realism), and an ontology of facts (factualism). We demonstrate that these three ontologies are dual to each other, meaning that each ontology can be translated into, and recaptured from, each of the others. The aiin of the enterprise is to raise the possibility that, at least in some settings, there may be no need for considerations of ontological primacy. Whether the world (...) is made up of things, or properties, or facts, may be no more than a matter of how we look at it. (shrink)

Both early analytic philosophy and the branch of mathematics now known as topology were gestated and born in the early part of the 20th century. It is not well recognized that there was early interaction between the communities practicing and developing these fields. We trace the history of how topological ideas entered into analytic philosophy through two migrations, an earlier one conceiving of topology geometrically and a later one conceiving of topology algebraically. This allows us to reassess the influence and (...) significance of topological methods for philosophy, including the possible fruitfulness of a third conception of topology as a structure determining similarity. (shrink)

One of the most expected properties of a logical system is that it can be algebraizable, in the sense that an algebraic counterpart of the deductive machinery could be found. Since the inception of da Costa's paraconsistent calculi, an algebraic equivalent for such systems have been searched. It is known that these systems are non self-extensional (i.e., they do not satisfy the replacement property). More than this, they are not algebraizable in the sense of Blok-Pigozzi. The same negative results hold (...) for several systems of the hierarchy of paraconsistent logics known as Logics of Formal Inconsistency (LFIs). Because of this, these logics are uniquely characterized by semantics of non-deterministic kind. This paper offers a solution for two open problems in the domain of paraconsistency, in particular connected to algebraization of LFIs, by obtaining several LFIs weaker than C1, each of one is algebraizable in the standard Lindenbaum-Tarski's sense by a suitable variety of Boolean algebras extended with operators. This means that such LFIs satisfy the replacement property. The weakest LFI satisfying replacement presented here is called RmbC, which is obtained from the basic LFI called mbC. Some axiomatic extensions of RmbC are also studied, and in addition a neighborhood semantics is defined for such systems. It is shown that RmbC can be defined within the minimal bimodal non-normal logic E+E defined by the fusion of the non-normal modal logic E with itself. Finally, the framework is extended to first-order languages. RQmbC, the quantified extension of RmbC, is shown to be sound and complete w.r.t. BALFI semantics. (shrink)

Quantum set theory and topos quantum theory are two long running projects in the mathematical foundations of quantum mechanics that share a great deal of conceptual and technical affinity. Most pertinently, both approaches attempt to resolve some of the conceptual difficulties surrounding QM by reformulating parts of the theory inside of nonclassical mathematical universes, albeit with very different internal logics. We call such mathematical universes, together with those mathematical and logical structures within them that are pertinent to the physical interpretation, (...) ‘Q-worlds’. Here, we provide a unifying framework that allows us to better understand the relationship between different Q-worlds, and define a general method for transferring concepts and results between TQT and QST, thereby significantly increasing the expressive power of both approaches. Along the way, we develop a novel connection to paraconsistent logic and introduce a new class of structures that have significant implications for recent work on paraconsistent set theory. (shrink)

I argue that the construction of representation theorems is a powerful tool for creating novel objects and theories in mathematics, as the construction of a new representation introduces new pieces of information in a very specific way that enables a solution for a problem and a proof of a new theorem. In more detail I show how the work behind the proof of a representation theorem transforms a mathematical problem in a way that makes it tractable and introduces information into (...) it that it did not contain at the beginning of the process. (shrink)

There are many ontologies of the world or of specific phenomena such as time, matter, space, and quantum mechanics1. However, ontologies of information are rather rare. One of the reasons behind this is that information is most frequently associated with communication and computing, and not with ‘the furniture of the world’. But what would be the nature of an ontology of information? For it to be of significant import it should be amenable to formalization in a logico-grammatical formalism. A candidate (...) ontology satisfying such a requirement can be found in some of the ideas of K. Turek, presented in this paper. Turek outlines the ontology of information conceived of as a part of nature, and provides the ‘missing link’ to the Z axiomatic set theory, offering a proposal for developing a formal ontology of information both in its philosophical and logicogrammatical representations. (shrink)

We propose a model of an agent’s probability and utility that is a compromise between Savage (The foundations of statistics, Wiley, 1954) and Jeffrey (The Logic of Decision, McGraw Hill, 1965). In Savage’s model the probability–utility pair is associated with preferences over acts which are assignments of consequences to states. The probability is defined on the state space, and the utility function on consequences. Jeffrey’s model has no consequences, and both probability and utility are defined on the same set of (...) propositions. The probability–utility pair is associated with a desirability relation on propositions. Like Savage we assume a set of consequences and a state space. However, we assume that states are comprehensive, that is, each state describes a consequence, as in Aumann (Econometrica 55:1–18, 1987). Like Jeffrey, we assume that the agent has a preference relation, which we call desirability, over events, which by definition involves uncertainty about consequences. For a given probability and utility of consequences, the desirability relation is presented by conditional expected utility, given an event. We axiomatically characterize desirability relations that are represented by a probability–utility pair. We characterize the family of all the probability–utility pairs that represent a given desirability relation. (shrink)

This paper illustrates how Priestley duality can be used in the transfer of an optimal natural duality from a minimal generating algebra for a quasi-variety to other generating algebras. Detailed calculations are given for the quasi-variety \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $$\mathbb{I}\mathbb{S}\mathbb{P}(\underset{\raise0.3em\hbox{$\smash{\scriptscriptstyle-}$}}{4} )$$ \end{document} of Kleene algebras and the quasi-varieties \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $$B$$ \end{document}n of pseudocomplemented distributive lattices (n ≥ 1).

This paper uses a non-distributive system of Boolean fractions (a|b), where a and b are 2-valued propositions or events, to express uncertain conditional propositions and conditional events. These Boolean fractions, 'a if b' or 'a given b', ordered pairs of events, which did not exist for the founders of quantum logic, can better represent uncertain conditional information just as integer fractions can better represent partial distances on a number line. Since the indeterminacy of some pairs of quantum events is due (...) to the mutual inconsistency of their experimental conditions, this algebra of conditionals can express indeterminacy. In fact, this system is able to express the crucial quantum concepts of orthogonality, simultaneous verifiability, compatibility, and the superposition of quantum events, all without resorting to Hilbert space. A conditional (a|b) is said to be "inapplicable" (or "undefined") in those instances or models for which b is false. Otherwise the conditional takes the truth-value of proposition a. Thus the system is technically 3-valued, but the 3rd value has nothing to do with a state of ignorance, nor to some half-truth. People already routinely put statements into three categories: true, false, or inapplicable. As such, this system applies to macroscopic as well as microscopic events. Two conditional propositions turn out to be simultaneously verifiable just in case the truth of one implies the applicability of the other. Furthermore, two conditional propositions (a|b) and (c|d) reside in a common Boolean sub-algebra of the non-distributive system of conditional propositions just in case b = d, their conditions are equivalent. Since all aspects of quantum mechanics can be represented with this near classical logic, there is no need to adopt Hilbert space logic as ordinary logic, just a need perhaps to adopt propositional fractions to do logic, just as we long ago adopted integer fractions to do arithmetic. The algebra of Boolean fractions is a natural, near-Boolean extension of Boolean algebra adequate to express quantum logic. While this paper explains one group of quantum anomalies, it nevertheless leaves no less mysterious the 'influence-at-a-distance', quantum entanglement phenomena. A quantum realist must still embrace non-local influences to hold that "hidden variables" are the measured properties of particles. But that seems easier than imaging wave-particle duality and instant collapse, as offered by proponents of the standard interpretation of quantum mechanics. (shrink)

In his essay ‘“Wang’s Paradox”’, Crispin Wright proposes a solution to the Sorites Paradox (in particular, the form of it he calls the ‘Paradox of Sharp Boundaries’) that involves adopting intuitionistic logic when reasoning with vague predicates. He does not give a semantic theory which accounts for the validity of intuitionistic logic (and the invalidity of stronger logics) in that area. The present essay tentatively makes good the deficiency. By applying a theorem of Tarski, it shows that intuitionistic logic is (...) the strongest logic that may be applied, given certain semantic assumptions about vague predicates. The essay ends with an inconclusive discussion of whether those semantic assumptions should be accepted. (shrink)

Abramsky, S., Domain theory in logical form, Annals of Pure and Applied Logic 51 1–77. The mathematical framework of Stone duality is used to synthesise a number of hitherto separate developments in theoretical computer science.• Domain theory, the mathematical theory of computation introduced by Scott as a foundation for detonational semantics• The theory of concurrency and systems behaviour developed by Milner, Hennesy based on operational semantics.• Logics of programsStone duality provides a junction between semantics and logics . Moreover, the underlying (...) logic is geometric, which can be computationally interpreted as the logic of observable properties—i.e., properties which can be determined to hold of a process on the basis of a finite amount of information about its execution.These ideas lead to the following programme. A metalanguage is introduced, comprising• types = universes of discourse for various computational situations;• terms = PROGRAMS = syntactic intensions for models or points. A standard denotational interpretation of the metalanguage is given, assigning domains to types and domain elements to terms. The metalanguage is also given a logical interpretation, in which types are interpreted as propositional theories and terms are interpreted via a program logic, which axiomatises the properties they satisfy. The two interpretations are related by showing that they are Stone duals of each other. Hence, semantics and logic are guaranteed to be in harmony with each other, and in fact each determines the other up to isomorphism. This opens the way to a whole range of applications. Given a denotational description of a computational situation in our metalanguage, we can turn the handle to obtain a logic for that situation. (shrink)

We show that for finite n⩾3n⩾3, every first-order axiomatisation of the varieties of representable n-dimensional cylindric algebras, diagonal-free cylindric algebras, polyadic algebras, and polyadic equality algebras contains an infinite number of non-canonical formulas. We also show that the class of structures for each of these varieties is non-elementary. The proofs employ algebras derived from random graphs.

We review the fact that an MV-algebra is the same thing as a lattice-ordered effect algebra in which disjoint elements are orthogonal. An HMV-algebra is an MV-effect algebra that is also a Heyting algebra and in which the Heyting center and the effect-algebra center coincide. We show that every effect algebra with the generalized comparability property is an HMV-algebra. We prove that, for an MV-effect algebra E, the following conditions are mutually equivalent: (i) E is HMV, (ii) E has a (...) center valued pseudocomplementation, (iii) E admits a central cover mapping γ such that, for all p, q∈E, p∧q=0⇒γ(p)∧q=0. (shrink)

The two concepts of probability used in physics are analyzed from the formal and the material points of view. The standard theory corresponds toprob 1 (probability of the coexistence of two properties). A general logicomathematical theory ofprob 2 (probability of transition between states) is presented in axiomatic form. The underlying state algebra is neither Boolean nor Birkhoff-von Neumann but partial Boolean. In the Boolean subalgebras,prob 1 theory holds. The theory presented contains the logicomathematical foundations of quantum mechanics and, as degenerate (...) cases, the theories of stochastic games and of Markov chains. (shrink)

The variety of N4? -lattices provides an algebraic semantics for the logic N4?, a version of Nelson 's logic combining paraconsistent strong negation and explosive intuitionistic negation. In this paper we construct the Priestley duality for the category of N4?-lattices and their homomorphisms. The obtained duality naturally extends the Priestley duality for Nelson algebras constructed by R. Cignoli and A. Sendlewski.

Since antiquity well into the beginnings of the 20th century geometry was a central topic for philosophy. Since then, however, most philosophers of science, if they took notice of topology at all, considered it as an abstruse subdiscipline of mathematics lacking philosophical interest. Here it is argued that this neglect of topology by philosophy may be conceived of as the sign of a conceptual sea-change in philosophy of science that expelled geometry, and, more generally, mathematics, from the central position it (...) used to have in philosophy of science and placed logic at center stage in the 20th century philosophy of science. Only in recent decades logic has begun to loose its monopoly and geometry and topology received a new chance to find a place in philosophy of science. (shrink)

. Relational semantics for nonclassical logics lead straightforwardly to topological representation theorems of their algebras. Ortholattices and De Morgan lattices are reducts of the algebras of various nonclassical logics. We define three new classes of topological spaces so that the lattice categories and the corresponding categories of topological spaces turn out to be dually isomorphic. A key feature of all these topological spaces is that they are ordered relational or ordered product topologies.

This paper introduces the category of b-frames as a new tool in the study of complete lattices. B-frames can be seen as a generalization of posets, which play an important role in the representation theory of Heyting algebras, but also in the study of complete Boolean algebras in forcing. This paper combines ideas from the two traditions in order to generalize some techniques and results to the wider context of complete lattices. In particular, we lift a representation theorem of Allwein (...) and MacCaull to a duality between complete lattices and b-frames, and we derive alternative characterizations of several classes of complete lattices from this duality. This framework is then used to obtain new results in the theory of complete Heyting algebras and the semantics of intuitionistic propositional logic. (shrink)

This volume is dedicated to Leo Esakia's contributions to the theory of modal and intuitionistic systems. Consisting of 10 chapters, written by leading experts, this volume discusses Esakia’s original contributions and consequent developments that have helped to shape duality theory for modal and intuitionistic logics and to utilize it to obtain some major results in the area. Beginning with a chapter which explores Esakia duality for S4-algebras, the volume goes on to explore Esakia duality for Heyting algebras and its generalizations (...) to weak Heyting algebras and implicative semilattices. The book also dives into the Blok-Esakia theorem and provides an outline of the intuitionistic modal logic KM which is closely related to the Gödel-Löb provability logic GL. One chapter scrutinizes Esakia’s work interpreting modal diamond as the derivative of a topological space within the setting of point-free topology. The final chapter in the volume is dedicated to the derivational semantics of modal logic and other related issues. (shrink)

The use of probability theory is widespread in our daily life as well as in scientific theories. In virtually all cases, calculations can be carried out within the framework of classical probability theory. A special exception is given by quantum mechanics, which gives rise to a new probability theory: quantum probability theory. This dissertation deals with the question of how this formalism can be understood from a philosophical and physical perspective. The dissertation is divided into three parts. In the first (...) part, the formalism of quantum probability theory and its relation to quantum mechanics is presented. The second part considers the possibility of reformulating quantum probability theory to embed it within classical probability. Mathematically, this possibility overlaps with the possibility of the existence of hidden variables theories of quantum mechanics: theories that attempt to solve fundamental problems in quantum mechanics by introducing additional physical properties of systems. The conclusion of this part is that, although classical reformulations of quantum probability theory are formally possible, they offer little insight into the formalism of quantum probability theory itself. The third part regards a more direct investigation of quantum probability theory. A reformulation of quantum probability theory is obtained by constructing a quantum logic on the basis of empirical non-probabilistic predictions of quantum mechanics. In this reformulation quantum probability functions are conditional probability functions on an algebra of propositions about measurements and measurement outcomes. (shrink)

This paper looks at how the idea of pointless topology itself evolved during its pre-localic phase by analyzing the definitions of the concept of topological space of Menger and Nöbeling. Menger put forward a topology of lumps in order to generalize the definition of the real line. As to Nöbeling, he developed an abstract theory of posets so that a topological space becomes a particular case of topological poset. The analysis emphasizes two points. First, Menger's geometrical perspective was superseded by (...) an algebraic one, a lattice-theoretical one to be precise. Second, Menger's bottom–up approach was replaced by a top–down one. (shrink)

Coherence is a key concept in many accounts of epistemic justification within ‘traditional’ analytic epistemology. Within formal epistemology, too, there is a substantial body of research on coherence measures. However, there has been surprisingly little interaction between the two bodies of literature. The reason is that the existing formal literature on coherence measure operates with a notion of belief system that is very different from—what we argue is—a natural Bayesian formalisation of the concept of belief system from traditional epistemology. Therefore, (...) formal epistemology has so far only been concerned with one particular—arguably not even very natural—way of formalising coherence of belief systems; it has by no means refuted the viability of coherentism. In contrast to the existing literature, we formalise belief systems as families of assignments of (conditional) degrees of belief (which may be compatible with several subjective probability measures). Within this framework, we propose a Bayesian formalisation of the thrust of BonJour’s coherence concept in The structure of empirical knowledge (Harvard University Press, Cambridge, 1985), using a combination of Bayesian confirmation theory and basic graph theory. In excursions, we introduce graded notions for both logical and probabilistic consistency of belief systems—the latter being based on certain geometrical structures induced by probabilistic belief systems. For illustration, we reconsider BonJour’s “ravens” challenge (op. cit., p. 95f.). Finally, potential objections to our proposed formal coherence notion are explored. (shrink)

The deductive system in Boole's Laws of Thought (LT) involves both an algebra, which we call proto-Boolean, and a "general method in Logic" making use of that algebra. Our object is to elucidate these two components of Boole's system, to prove his principal results, and to draw some conclusions not explicit in LT. We also discuss some examples of incoherence in LT; these mask the genius of Boole's design and account for much of the puzzled and disparaging commentary LT has (...) received. Our evaluation of Boole's logical system does not differ substantially from that advanced in Hailperin's exhaustive study, Boole's Logic and Probability. Unlike the latter work, however, we make direct use of the polynomials native to LT rather than appealing to formalisms such as multisets and rings. (shrink)

Standard first-order logic plus quantifiers of all finite orders ("SFOLω") faces four well-known difficulties when used to characterize the behavior of certain English quantifier phrases. All four difficulties seem to stem from the typed structure of SFOLω models. The typed structure of SFOLω models is in turn a product of an asymmetry between the meaning of names and the meaning of predicates, the element-set asymmetry. In this paper we examine a class of models in which this asymmetry of meaning is (...) removed. The models of this class permit definitions of the quantifiers which allow a desirable flexibility in fixing the domain of quantification. Certain SFOLω type restrictions are thereby avoided. The resulting models of English validate all of the standard first-order logical truths and are free of the four deficiencies of SFOLω models. (shrink)

The aim of this text is to reply to criticisms of the logics of evidence and truth and the epistemic approach to paraconsistency advanced by Barrio [2018], and Lo Guercio and Szmuc [2018]. We also clarify the notion of evidence that underlies the intended interpretation of these logics and is a central point of Barrio’s and Lo Guercio & Szmuc’s criticisms.

It is introduced a new algebra$$(A, \otimes, \oplus, *, \rightharpoonup, 0, 1)$$(A,⊗,⊕,∗,⇀,0,1)called$$L_PG$$LPG-algebra if$$(A, \otimes, \oplus, *, 0, 1)$$(A,⊗,⊕,∗,0,1)is$$L_P$$LP-algebra (i.e. an algebra from the variety generated by perfectMV-algebras) and$$(A,\rightharpoonup, 0, 1)$$(A,⇀,0,1)is a Gödel algebra (i.e. Heyting algebra satisfying the identity$$(x \rightharpoonup y ) \vee (y \rightharpoonup x ) =1)$$(x⇀y)∨(y⇀x)=1). The lattice of congruences of an$$L_PG$$LPG-algebra$$(A, \otimes, \oplus, *, \rightharpoonup, 0, 1)$$(A,⊗,⊕,∗,⇀,0,1)is isomorphic to the lattice of Skolem filters (i.e. special type ofMV-filters) of theMV-algebra$$(A, \otimes, \oplus, *, 0, 1)$$(A,⊗,⊕,∗,0,1). The variety$$\mathbf {L_PG}$$LPGof$$L_PG$$LPG-algebras (...) is generated by the algebras$$(C, \otimes, \oplus, *, \rightharpoonup, 0, 1)$$(C,⊗,⊕,∗,⇀,0,1)where$$(C, \otimes, \oplus, *, 0, 1)$$(C,⊗,⊕,∗,0,1)is ChangMV-algebra. Any$$L_PG$$LPG-algebra is bi-Heyting algebra. The set of theorems of the logic$$L_PG$$LPGis recursively enumerable. Moreover, we describe finitely generated free$$L_PG$$LPG-algebras. (shrink)

We extend the relational algebra of Chin and Tarski so that it is multisorted or, as we prefer, typed. Each type supports a local Boolean algebra outfitted with a converse operator. From Lyndon, we know that relation algebras cannot be represented as proper relation algebras where a proper relation algebra has binary relations as elements and the algebra is singly-typed. Here, the intensional conjunction, which was to represent relational composition in Chin and Tarski, spans three different local algebras, thus the (...) term distributed in the title. Since we do not rely on proper relation algebras, we are free to re-express the algebras as typed. In doing so, we allow many different intensional conjunction operators. We construct a typed logic over these algebras, also known as heterogeneous algebras of Birkhoff and Lipson. The logic can be seen as a form of relevance logic with a classical negation connective where the Routley-Meyer star operator is reified as a converse connective in the logic. Relevance logic itself is not typed but our work shows how it can be made so. Some of the properties of classical relevance logic are weakened from Routley-Meyer’s version which is too strong for a logic over relation algebras. (shrink)

In this article we will focus our attention on the variety of distributive bisemilattices and some linguistic expansions thereof: bounded, De Morgan, and involutive bisemilattices. After extending Balbes’ representation theorem to bounded, De Morgan, and involutive bisemilattices, we make use of Hartonas–Dunn duality and introduce the categories of 2spaces and 2spaces\. The categories of 2spaces and 2spaces\ will play with respect to the categories of distributive bisemilattices and De Morgan bisemilattices, respectively, a role analogous to the category of Stone spaces (...) with respect to the category of Boolean algebras. Actually, the aim of this work is to show that these categories are, in fact, dually equivalent. (shrink)

Through contact algebras we study theories of mereotopology in a uniform way that clearly separates mereological from topological concepts. We identify and axiomatize an important subclass of closure mereotopologies called unique closure mereotopologies whose models always have orthocomplemented contact algebras , an algebraic counterpart. The notion of MT-representability, a weak form of spatial representability but stronger than topological representability, suffices to prove that spatially representable complete OCAs are pseudocomplemented and satisfy the Stone identity. Within the resulting class of contact algebras (...) the strength of the algebraic complementation delineates two classes of mereotopology according to the key ontological choice between mereological and topological closure operations. All closure operations are defined mereologically if and only if the corresponding contact algebras are uniquely complemented while topological closure operations highly restrict the contact relation but allow not uniquely complemented and nondistributive contact algebras. Each class contains a single ontologically coherent theory that admits discrete models. (shrink)

This paper presents the algebraic and Kripke modelsoundness and completeness ofa logic over Boolean monoids. An additional axiom added to thelogic will cause the resulting monoid models to be representable as monoidsof relations. A star operator, interpreted as reflexive, transitiveclosure, is conservatively added to the logic. The star operator isa relative modal operator, i.e., one that is defined in terms ofanother modal operator. A further example, relative possibility,of this type of operator is given. A separate axiom,antilogism, added to the logic (...) causes the Kripke models to support acollection of abstract topological uniformities which become concretewhen the Kripke models are dual to monoids of relations. The machineryfor the star operator is shownto be a recasting of Scott-Montague neighborhood models. An interpretationof the Kripke frames and properties thereof is presented in terms ofcertain CMOS transister networks and some circuit transformation equivalences.The worlds of the Kripke frame are wires and the Kripke relation is a specializedCMOS pass transistor network. (shrink)