Skvortsova showed that there is a factor of the Medvedev lattice which captures intuitionistic propositional logic (IPC). However, her factor is unnatural in the sense that it is constructed in an ad hoc manner. We present a more natural example of such a factor. We also show that the theory of every non-trivial factor of the Medvedev lattice is contained in Jankov’s logic, the deductive closure of IPC plus the weak law of the excluded middle $${\neg p \vee \neg \neg (...) p}$$. This answers a question by Sorbi and Terwijn. (shrink)

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)

Structuralism has recently moved center stage in philosophy of mathematics. One of the issues discussed is the underlying logic of mathematical structuralism. In this paper, I want to look at the dual question, namely the underlying structures of logic. Indeed, from a mathematical structuralist standpoint, it makes perfect sense to try to identify the abstract structures underlying logic. We claim that one answer to this question is provided by categorical logic. In fact, we claim that the latter can be seen—and (...) probably should be seen—as being a structuralist approach to logic and it is from this angle that categorical logic is best understood. (shrink)

This book presents an English translation of a classic Russian text on duality theory for Heyting algebras. Written by Georgian mathematician Leo Esakia, the text proved popular among Russian-speaking logicians. This translation helps make the ideas accessible to a wider audience and pays tribute to an influential mind in mathematical logic. The book discusses the theory of Heyting algebras and closure algebras, as well as the corresponding intuitionistic and modal logics. The author introduces the key notion of a hybrid that (...) “crossbreeds” topology and order, resulting in the structures now known as Esakia spaces. The main theorems include a duality between the categories of closure algebras and of hybrids, and a duality between the categories of Heyting algebras and of so-called strict hybrids. Esakia’s book was originally published in 1985. It was the first of a planned two-volume monograph on Heyting algebras. But after the collapse of the Soviet Union, the publishing house closed and the project died with it. Fortunately, this important work now lives on in this accessible translation. The Appendix of the book discusses the planned contents of the lost second volume. (shrink)

Inquisitive logic is a research program seeking to expand the purview of logic beyond declarative sentences to include the logic of questions. To this end, inquisitive propositional logic extends classical propositional logic for declarative sentences with principles governing a new binary connective of inquisitive disjunction, which allows the formation of questions. Recently inquisitive logicians have considered what happens if the logic of declarative sentences is assumed to be intuitionistic rather than classical. In short, what should inquisitive logic be on an (...) intuitionistic base? In this paper, we provide an answer to this question from the perspective of nuclear semantics, an approach to classical and intuitionistic semantics pursued in our previous work. In particular, we show how Beth semantics for intuitionistic logic naturally extends to a semantics for inquisitive intuitionistic logic. In addition, we show how an explicit view of inquisitive intuitionistic logic comes via a translation into propositional lax logic, whose completeness we prove with respect to Beth semantics. (shrink)

ABSTRACTCorrespondence and Shalqvist theories for Modal Logics rely on the simple observation that a relational structure is at the same time the basis for a model of modal logic and for a model of first-order logic with a binary predicate for the accessibility relation. If the underlying set of the frame is split into two components,, and, then frames are at the same time the basis for models of non-distributive lattice logic and of two-sorted, residuated modal logic. This suggests that (...) a reduction of the first to the latter may be possible, encoding Positive Lattice Logic as a fragment of Two-Sorted, Residuated Modal Logic. The reduction is analogous to the well-known Gödel-McKinsey-Tarski translation of Intuitionistic Logic into the S4 system of normal modal logic. In this article, we carry out this reduction in detail and we derive some properties of PLL from corresponding properties of First-Order Logic. The reduction we present is extendible to the case of lattices with operators, making use of recent results by this author on the relational representation of normal lattice expansions. (shrink)

This paper charts some early history of the possible worlds semantics for modal logic, starting with the pioneering work of Prior and Meredith. The contributions of Geach, Hintikka, Kanger, Kripke, Montague, and Smiley are also discussed.

We give topological proofs of Görnemann’s adaptation to Heyting algebras of the Rasiowa-Sikorski Lemma for Boolean algebras; and of the Rauszer-Sabalski generalisation of it to distributive lattices. The arguments use the Priestley topology on the set of prime filters, and the Baire category theorem. This is preceded by a discussion of criteria for compactness of various spaces of subsets of a lattice, including spaces of filters, prime filters etc.

This paper is a contribution toward developing a theory of expansions of semi-Heyting algebras. It grew out of an attempt to settle a conjecture we had made in 1987. Firstly, we unify and extend strikingly similar results of [ 48 ] and [ 50 ] to the (new) equational class DHMSH of dually hemimorphic semi-Heyting algebras, or to its subvariety BDQDSH of blended dual quasi-De Morgan semi-Heyting algebras, thus settling the conjecture. Secondly, we give a criterion for a unary expansion (...) of semi-Heyting algebras to be a discriminator variety and give an algorithm to produce discriminator varieties. We then apply the criterion to exhibit an increasing sequence of discriminator subvarieties of BDQDSH . We also use it to prove that the variety DQSSH of dually quasi-Stone semi- Heyting algebras is a discriminator variety. Thirdly, we investigate a binary expansion of semi-Heyting algebras, namely the variety DblSH of double semi-Heyting algebras by characterizing its simples, and use the characterization to present an increasing sequence of discriminator subvarieties of DblSH . Finally, we apply these results to give bases for “small” subvarieties of BDQDSH , DQSSH , and DblSH. (shrink)

This article traces the development of possible worlds semantics through the work of: Wittgenstein, 1913-1921; Feys, 1924; McKinsey, 1945; Carnap, 1945-1947; McKinsey, Tarski and Jónsson, 1947-1952; von Wright, 1951; Becker, 1952; Prior, 1953-1954; Montague, 1955; Meredith and Prior, 1956; Geach, 1960; Smiley, 1955-1957; Kanger, 1957; Hintikka, 1957; Guillaume, 1958; Binkley, 1958; Bayart, 1958-1959; Drake, 1959-1961; Kripke, 1958-1965.

One of Da Costa’s motives when he constructed the paraconsistent logic C! was to dualise the negation of intuitionistic logic. In this paper I explore a different way of going about this task. A logic is defined by taking the Kripke semantics for intuitionistic logic, and dualising the truth conditions for negation. Various properties of the logic are established, including its relation to C!. Tableau and natural deduction systems for the logic are produced, as are appropriate algebraic structures. The paper (...) then investigates dualising the intuitionistic conditional in the same way. This establishes various connections between the logic, and a logic called in the literature ‘Brouwerian logic’ or ‘closed-set logic’. (shrink)

Fine and Kripke extended S5, S4, S4.2 and such to produce propositionally quantified systems , , : given a Kripke frame, the quantifiers range over all the sets of possible worlds. is decidable and, as Fine and Kripke showed, many of the other systems are recursively isomorphic to second-order logic. In the present paper I consider the propositionally quantified system that arises from the topological semantics for S4, rather than from the Kripke semantics. The topological system, which I dub , (...) is strictly weaker than its Kripkean counterpart. I prove here that second-order arithmetic can be recursively embedded in . In the course of the investigation, I also sketch a proof of Fine's and Kripke's results that the Kripkean system is recursively isomorphic to second-order logic. (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)

In this paper we define an augmentation mHC of the Heyting propositional calculus HC by a modal operator ?. This modalized Heyting calculus mHC is a weakening of the Proof-Intuitionistic Logic KM of Kuznetsov and Muravitsky. In Section 2 we present a short selection of attractive (algebraic, relational, topological and categorical) features of mHC. In Section 3 we establish some close connections between mHC and certain normal extension K4.Grz of the modal system K4. We define a translation of mHC into (...) K4.Grz and prove that this translation is exact, i. e. theorem-preserving and deducibility-invariant. We have established (however, in this note we do not present a proof of this) that the lattice of all extensions of mHC is isomorphic to the lattice of normal extensions of K4.Grz (a generalization of the Kuznetsov and Muravitsky theorem). (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)

It is well-established that topos theory is inherently connected with intuitionistic logic. In recent times several works appeared concerning so-called complement-toposes, which are allegedly connected to the dual to intuitionistic logic. In this paper I present this new notion, some of the motivations for it, and some of its consequences. Then, I argue that, assuming equivalence of certain two definitions of a topos, the concept of a complement-classifier is, at least in general and within the conceptual framework of category theory, (...) not appropriately defined. For this purpose, I first analyze the standard notion of a subobject classifier, show its connection with the representability of the functor Sub via the Yoneda lemma, recall some other properties of the internal structure of a topos and, based on these, I critically comment on the notion of a complement-classifier. (shrink)

We study finitely generated free Heyting algebras from a topological and from a model theoretic point of view. We review Bellissima’s representation of the finitely generated free Heyting algebra; we prove that it yields an embedding in the profinite completion, which is also the completion with respect to a naturally defined metric. We give an algebraic interpretation of the Kripke model used by Bellissima as the principal ideal spectrum and show it to be first order interpretable in the Heyting algebra, (...) from which several model theoretic and algebraic properties are derived. In particular, we prove that a free finitely generated Heyting algebra has only one set of free generators, which is definable in it. As a consequence its automorphism group is the permutation group over its generators. (shrink)

This book offers a concise introduction to both proof-theory and algebraic methods, the core of the syntactic and semantic study of logic respectively. The importance of combining these two has been increasingly recognized in recent years. It highlights the contrasts between the deep, concrete results using the former and the general, abstract ones using the latter. Covering modal logics, many-valued logics, superintuitionistic and substructural logics, together with their algebraic semantics, the book also provides an introduction to nonclassical logic for undergraduate (...) or graduate level courses.The book is divided into two parts: Proof Theory in Part I and Algebra in Logic in Part II. Part I presents sequent systems and discusses cut elimination and its applications in detail. It also provides simplified proof of cut elimination, making the topic more accessible. The last chapter of Part I is devoted to clarification of the classes of logics that are discussed in the second part. Part II focuses on algebraic semantics for these logics. At the same time, it is a gentle introduction to the basics of algebraic logic and universal algebra with many examples of their applications in logic. Part II can be read independently of Part I, with only minimum knowledge required, and as such is suitable as a textbook for short introductory courses on algebra in logic. (shrink)

In the pioneering article and two papers, written jointly with McKinsey, Tarski developed the so-called algebraic and topological frameworks for the Intuitionistic Logic and the Lewis modal system. In this paper, we present an outline of modern systems with a topological tinge. We consider topological interpretation of basic systems GL and G of the provability logic in terms of the Cantor derivative and the Hausdorff residue.

We apply the theory of partial algebras, following the approach developed by Van Alten, to the study of the computational complexity of universal theories of monotonic and normal modal algebras. We show how the theory of partial algebras can be deployed to obtain co-NP and EXPTIME upper bounds for the universal theories of, respectively, monotonic and normal modal algebras. We also obtain the corresponding lower bounds, which means that the universal theory of monotonic modal algebras is co-NP-complete and the universal (...) theory of normal modal algebras is EXPTIME-complete. It also follows that the quasi-equational theory of monotonic modal algebras is co-NP-complete. While the EXPTIME upper bound for the universal theory of normal modal algebras can be obtained in a more straightforward way, as discussed in the paper, due to its close connection to the equational theory of normal modal algebras with the universal modality operator, the technique based on the theory of partial algebras is applicable to the study of universal theories of algebras corresponding to a wide range of logics with intensional operators, where no such connection is available. (shrink)

In this paper, we study the relationship among classical logic, intuitionistic logic, and quantum logic . These logics are related in an interesting way and are not far apart from each other, as is widely believed. The results in this paper show how they are related with each other through a dual intuitionistic logic . Our study is completely syntactical.

We give an equivalent formulation of topological algebras, interpreting S4, as boolean algebras equipped with intuitionistic negation. The intuitionistic substructure—Heyting algebra—of such an algebra can be then seen as an “epistemic subuniverse”, and modalities arise from the interaction between the intuitionistic and classical negations or, we might perhaps say, between the epistemic and the ontological aspects: they are not relations between arbitrary alternatives but between intuitionistic substructures and one common world governed by the classical (propositional) logic. As an example of (...) the generality of the obtained view, we apply it also to S5. We give a sound, complete and decidable sequent calculus, extending a classical system with the rules for handling the intuitionistic negation, in which one can prove all classical, intuitionistic and S4 valid sequents. (shrink)

In an article dating back in 1992, Kosta Došen initiated a project of modal translations in substructural logics, aiming at generalising the well-known Gödel–McKinsey–Tarski translation of intuitionistic logic into S4. Došen's translation worked well for (variants of) BCI and stronger systems (BCW, BCK), but not for systems below BCI. Dropping structural rules results in logic systems without distribution. In this article, we show, via translation, that every substructural (indeed, every non-distributive) logic is a fragment of a corresponding sorted, residuated (multi) (...) modal logic. At the conceptual and philosophical level, the translation provides a classical interpretation of the meaning of the logical operators of various non-distributive propositional calculi. Technically, it allows for an effortless transfer of results, such as compactness and the Löwenheim-Skolem property and it opens up new directions for deducing properties of substructural logic systems by establishing appropriate transfer theorems. (shrink)

In this work, we investigate the relationship between paraconsistent semantics and some well-known topological spaces such as connected and continuous spaces. We also discuss homotopies as truth preserving operations in paraconsistent topological models.

We give natural examples of factors of the Muchnik lattice which capture intuitionistic propositional logic , arising from the concepts of lowness, 1-genericity, hyperimmune-freeness and computable traceability. This provides a purely computational semantics for IPC.

In this paper we continue the investigation of monadic Heyting algebras which we started in [2]. Here we present the representation theorem for monadic Heyting algebras and develop the duality theory for them. As a result we obtain an adequate topological semantics for intuitionistic modal logics over MIPC along with a Kripke-type semantics for them. It is also shown the importance and the effectiveness of the duality theory for further investigation of monadic Heyting algebras and logics over MIPC.

Let $\mathcal{P}_w$ be the lattice of Muchnik degrees of nonempty $\Pi^0_1$ subsets of $2^\omega$. The lattice $\mathcal{P}$ has been studied extensively in previous publications. In this note we prove that the lattice $\mathcal{P}$ is not Brouwerian.

The aim of this paper is to investigate the variety of symmetric closure algebras, that is, closure algebras endowed with a De Morgan operator. Some general properties are derived. Particularly, the lattice of subvarieties of the subvariety of monadic symmetric algebras is described and an equational basis for each subvariety is given.

We provide simple algebraic proofs of two important facts, due to Zakharyaschev and Esakia, about Grzegorczyk algebras.

The study of existentially closed closure algebras begins with Lipparini’s 1982 paper. After presenting new nonelementary axioms for algebraically closed and existentially closed closure algebras and showing that these nonelementary classes are different, this paper shows that the classes of finitely generic and infinitely generic closure algebras are closed under finite products and bounded Boolean powers, extends part of Hausdorff’s theory of reducible sets to existentially closed closure algebras, and shows that finitely generic and infinitely generic closure algebras are elementarily (...) inequivalent. Special properties of algebraically closed, existentially closed, finitely generic, and infinitely generic closure algebras are established along the way. (shrink)

We present our personal view on W.J. Blok's contribution to modal logic.

We assemble material from the literature on matrix methodology for sentential logic—without claiming to present any new logical results—in order to show that Gödel once made (or at least, is quoted as having made) an uncharacteristically ill-considered remark in this area.

We extend the earlier results on the equivalence between the Boolean and the multivalued dependencies in relational databases and fragments of the Boolean propositional logic. It is shown that these equivalences are still valid for the databases that store complex data elements obtained from the recursive nesting of record, list, set and multiset constructors. The major proof argument utilises properties of Brouwerian algebras.The equivalences have several consequences. Firstly, they provide new insights into databases that are not in first normal form. (...) Secondly, they characterise the implication of data dependencies in nested databases in purely logical terms. The database designer can take advantage of these equivalences to reduce database design problems to well-studied problems in Boolean propositional logic. Furthermore, relational database design solutions can be reused to solve problems for nested databases. (shrink)

In this paper we expand previous results obtained in [2] about the study of categorical equivalence between the category IRL 0 of integral residuated lattices with bottom, which generalize MV-algebras and a category whose objects are called c-differential residuated lattices. The equivalence is given by a functor ${{\mathsf{K}^\bullet}}$ , motivated by an old construction due to J. Kalman, which was studied by Cignoli in [3] in the context of Heyting and Nelson algebras. These results are then specialized to the case (...) of MV-algebras and the corresponding category ${MV^{\bullet}}$ of monadic MV-algebras induced by “Kalman’s functor” ${\mathsf{K}^\bullet}$ . Moreover, we extend the construction to ℓ-groups introducing the new category of monadic ℓ-groups together with a functor ${\Gamma ^\sharp}$ , that is “parallel” to the well known functor ${\Gamma}$ between ℓ and MV-algebras. (shrink)