Intuitionistic Logic

In recent work, we introduced a new semantics for conditionals, covering a large class of what we call preconditionals. In this paper, we undertake an axiomatic study of preconditionals and subclasses of preconditionals. We then prove that any bounded lattice equipped with a preconditional can be represented by a relational structure, suitably topologized, yielding a single relational semantics for conditional logics normally treated by different semantics, as well as generalizing beyond those semantics.

Challenges to classical logic have emerged from several sources. According to recent work, the behavior of epistemic modals in natural language motivates weakening classical logic to orthologic, a logic originally discovered by Birkhoff and von Neumann in the study of quantum mechanics. In this paper, we consider a different tradition of thinking that the behavior of vague predicates in natural language motivates weakening classical logic to intuitionistic logic or even giving up some intuitionistic principles. We focus in particular on Fine's (...) recent approach to vagueness. Our main question is: what is a natural non-classical base logic to which to retreat in light of both the non-classicality emerging from epistemic modals and the non-classicality emerging from vagueness? We first consider whether orthologic itself might be the answer. We then discuss whether accommodating the non-classicality emerging from epistemic modals and vagueness might point in the direction of a weaker system of fundamental logic. (shrink)

Benchmarking automated theorem proving (ATP) systems using standardized problem sets is a well-established method for measuring their performance. However, the availability of such libraries for non-classical logics is very limited. In this work we propose a library for benchmarking Girard's (propositional) intuitionistic linear logic. For a quick bootstrapping of the collection of problems, and for discussing the selection of relevant problems and understanding their meaning as linear logic theorems, we use translations of the collection of Kleene's intuitionistic theorems in the (...) traditional monograph "Introduction to Metamathematics". We analyze four different translations of intuitionistic logic into linear logic and compare their proofs using a linear logic based prover with focusing. In order to enhance the set of problems in our library, we apply the three provability-preserving translations to the propositional benchmarks in the ILTP Library. Finally, we generate a comprehensive set of reachability problems for Petri nets and encode such problems as linear logic sequents, thus enlarging our collection of problems. (shrink)

Michael Dummett argues that acceptance of potentially infinite collections requires that we abandon classical logic and restrict ourselves to intuitionistic logic. In this paper we examine whether Dummett is correct. After developing two detailed accounts of what, exactly, it means for a concept to be potentially infinite (based on ideas due to Charles McCarty and Øystein Linnebo, respectively), we construct a Kripke structure that contains a natural number structure that satisfies both accounts. This model supports a logic much stronger than (...) intuitionistic logic, demonstrating that Dummett was wrong. We conclude by briefly examining ways to extend the account(s) in question to indefinitely extensible concepts such as Cardinal, Ordinal, and Set. (shrink)

Errett Bishop's work in constructive mathematics is overwhelmingly regarded as a turning point for mathematics based on intuitionistic logic. It brought new life to this form of mathematics and prompted the development of new areas of research that witness today's depth and breadth of constructive mathematics. Surprisingly, notwithstanding the extensive mathematical progress since the publication in 1967 of Errett Bishop's Foundations of Constructive Analysis, there has been no corresponding advances in the philosophy of constructive mathematics Bishop style. The aim of (...) this paper is to foster the philosophical debate about this form of mathematics. I begin by considering key elements of philosophical remarks by Bishop, especially focusing on Bishop's assessment of Brouwer. I then compare these remarks with ``traditional'' philosophical arguments for intuitionistic logic and argue that the latter are in tension with Bishop's views. ``Traditional'' arguments for intuitionistic logic turn out to be also in conflict with significant recent developments in constructive mathematics. This rises pressing questions for the philosopher of mathematics, especially with regard to the possibility of offering alternative philosophical arguments for constructive mathematics. I conclude with the suggestion to look anew at Bishop's own remarks for inspiration. (shrink)

In this paper, we investigate the proof theory of a modal expansion of intuitionistic propositional logic obtained by adding an 'actuality' operator among the connectives. This logic was initially considered by L. Humberstone, and, more recently, also by S. Niki and H. Omori to present a possible application of intuitionism to empirical discourse. Niki and Omori's idea to consider the notion of actuality based on intuitionistic logic was presented, among other things, using Gentzen sequents. Unfortunately, their proof system is not (...) cut-free. In this paper, we define another proof system for Niki and Omori’s logic, namely a hypersequent calculus, and present a proof of cut-elimination for it. (shrink)

I explore the relationships between Prawitz's approach to non-monotonic proof-theoretic validity, which I call reducibility semantics, and a later proof-theoretic approach, that I call standard base semantics. I prove that, if suitable conditions are met, reducibility semantics and standard base semantics are equivalent. As a side-result, I show that a similar relation holds, albeit in a weaker way, also between reducibility semantics and a variant of standard base semantics due to Sandqvist. Finally, notions of "point-wise" soundness and completeness (called base-soundness (...) and base-completeness) are discussed against certain known principles from the proof-theoretic literature, as well as against monotonic proof-theoretic semantics. Intuitionistic logic is proved not to be "point-wise" complete on any kind of non-monotonic proof-theoretic semantics. The way in which this result is proved, as well as the overall behaviour of "point-wise" soundness and completeness, is significantly different in the non-monotonic framework as compared to what happens in the monotonic one—where the notions at issue can be used too to prove the "point-wise" incompleteness of intuitionistic logic. (shrink)

In this paper, we show (among other things) that the conditional in Frege's Begriffsschrift is ambiguous.

Proof-theoretic semantics (P-tS) is an innovative approach to grounding logical meaning in terms of proofs rather than traditional truth-conditional semantics. The point is not that one provides a proof system, but rather that one articulates meaning in terms of proofs and provability. To elucidate this paradigm shift, we commence with an introduction that contrasts the fundamental tenets of P-tS with the more prevalent model-theoretic approach to semantics. The contribution of this paper is a P-tS for a substructural logic, intuitionistic multiplicative (...) linear logic (IMLL). Specifically, we meticulously examine and refine the established P-tS for intuitionistic propositional logic. Subsequently, we present two novel and comprehensive forms of P-tS for IMLL. Notably, the semantics for IMLL in this paper embodies its resource interpretation through its number-of-uses reading (restricted to atoms). This stands in contrast to the conventional model-theoretic semantics of the logic, underscoring the value that P-tS brings to substructural logics. (shrink)

In an anonymous referee report written in 1945, Church suggested a sweeping argument against verificiationism, the thesis that every truth is knowable. The argument, which was published with due acknowledgement by Fitch almost two decades later, has generated significant attention as well as some interesting successor arguments. In this paper, we present the most important episodes in this intellectual history using the logic that Church himself favoured, and we give reasons for thinking that the arguments are less than decisive. However, (...) we present some new arguments against verificationism that we believe to be dialectically effective. (shrink)

We analyze the relationship between logics around intuitionistic logic and minimal logic. We characterize the intersection of minimal logic and co-minimal logic introduced by Vakarelov, and reformulate logics given in the previous studies by Vakarelov, Bezhanishvili, Colacito, de Jongh, Vargas, and Niki in a uniform language. We also compare the new logic with other known logics in terms of the cardinalities of logics between them. Specifically, we apply Wronski’s algebraic semantics, instead of neighborhood semantics used in the previous studies, to (...) show the existence of continua of logics between known logics and the new logic. This result is an extension of the conventional results, and the proof is given in a simpler way. (shrink)

G3-style sequent calculi are introduced for a family of logics with strong negation: Gurevich logic, Nelson logic, intuitionistic propositional logic, Avron logic, De-Omori logic, and classical propositional logic. Structural properties including cut elimination are established for these calculi. In addition, a Glivenko theorem for embedding classical propositional logic into Gurevich logic is shown.

While sets are combinatorial collections, defined by their elements, classes are logical collections, defined by their membership conditions. We develop, in a potentialist setting, a predicative approach to (logical) classes of (combinatorial) sets. Some reasons emerge to adopt a stricter form of potentialism, which insists, not only that each object is generated at some stage of an incompletable process, but also that each truth is “made true” at some such stage. The natural logic of this strict form of potentialism is (...) semi-intuitionistic: where each set-sized domain is classical, the domain of all sets or all classes is intuitionistic. (shrink)

This paper introduces a metainferential version of intuitionistic logic. I work on the framework proposed by some logicians of Buenos Aires, who defend that a logic should be defined in terms of inferences and metainferences of growing complexity. Three logical systems are presented and proved to be adequate from an intuitionistic point of view.

The paper provides a cut-free sequent calculus for the theory of tight apartness in a language where both apartness and equality are primitive notions. The result is obtained by aptly modifying the underlying logical calculus for intuitionistic logic and adding rules of inference corresponding to the axioms of apartness and the principles governing the mutual deductive relationships between apartness and equality. While the rules for apartness are found directly from the axioms by applying standard proof-theoretic methods, the others, especially the (...) rule corresponding to the principle of tight apartness, are found by exploiting the logical law of _consequentia mirabilis_. Along the way, we also provide a cut-free sequent calculus for the theory of weak tight apartness, also known as the theory of negated equality, thus answering in the positive to an open problem in the existing literature on the subject. (shrink)

In this paper we first introduce a new neighbourhood semantics for propositional intuitionistic logic. We then naturally extend this semantics to first-order intuitionistic logic. We also study bisimulation between neighbourhood models and prove some of their basic properties for both propositional and first-order intuitionistic logic.

Kolmogorov's Calculus of Problems is an interpretation of Heyting's intuitionistic propositional calculus published by A.N. Kolmogorov in 1932. Unlike Heyting's intended interpretation of this calculus, Kolmogorov's interpretation does not comply with the philosophical principles of Mathematical Intuitionism. This philosophical difference between Kolmogorov and Heyting implies different treatments of problems and propositions: while in Heyting's view, the difference between problems and propositions is merely linguistic, Kolmogorov keeps the two concepts apart and does not apply his calculus to propositions. In this paper (...) the differences between Kolmogorov's and Heyting's interpretations are stressed, and it is shown how the two interpretations have diverged during their development. The impact of Kolmogorov's philosophical views on mathematics on his interpretation of the Intuitionistic logic is shown. Some later works motivated by Kolmogorov's Calculus of Problems are reviewed. Finally, Kolmogorov's controversial distinction between problems and propositions is given a modern justification in terms of Univalent Mathematics. (shrink)

In this paper, we propose a computational interpretation of the generalized Kreisel–Putnam rule, also known as the generalized Harrop rule or simply the Split rule, in the style of BHK semantics. We will achieve this by exploiting the Curry–Howard correspondence between formulas and types. First, we inspect the inferential behavior of the Split rule in the setting of a natural deduction system for intuitionistic propositional logic. This will guide our process of formulating an appropriate program that would capture the corresponding (...) computational content of the typed Split rule. Our investigation can also be reframed as an effort to answer the following question: is the Split rule constructively valid in the sense of BHK semantics? Our answer is positive for the Split rule as well as for its newly proposed general version called the S rule. (shrink)

In this paper, we consider the ex falso quodlibet rule (EFQ) as a derived rule and propose a new justification for it based on a rule we call the collapse rule. The collapse rule is a mix between EFQ and disjunctive syllogism (DS). Informally, it says that a choice between a proposition A and ⊥, which is understood as nullary disjunction, is no choice at all and it defaults to A. Thus, we can regard it as capturing the idea of (...) an implosion principle in contrast to EFQ’s explosion principle. Furthermore, we show that the collapse rule can also be used to justify DS and that all these three rules have the same deductive strength: they are all interderivable. Thus, the discussions about the justification of EFQ or DS be reduced to a discussion about the justification of the collapse rule. (shrink)

Kolmogorov's Calculus of Problems is an interpretation of Heyting's intuitionistic propositional calculus published by A.N. Kolmogorov in 1932. Unlike Heyting's intended interpretation of this calculus, Kolmogorov's interpretation does not comply with the philosophical principles of Mathematical Intuitionism. This philosophical difference between Kolmogorov and Heyting implies different treatments of problems and propositions: while in Heyting's view, the difference between problems and propositions is merely linguistic, Kolmogorov keeps the two concepts apart and does not apply his calculus to propositions. In this paper (...) the differences between Kolmogorov's and Heyting's interpretations are stressed, and it is shown how the two interpretations have diverged during their development. The impact of Kolmogorov's philosophical views on mathematics on his interpretation of the Intuitionistic logic is shown. Some later works motivated by Kolmogorov's Calculus of Problems are reviewed. Finally, Kolmogorov's controversial distinction between problems and propositions is given a modern justification in terms of Univalent Mathematics. (shrink)

Several recent results bring into focus the superintuitionistic nature of most notions of proof-theoretic validity, but little work has been done evaluating the consequences of these results. Proof-theoretic validity claims to offer a formal explication of how inferences follow from the definitions of logic connectives (which are defined by their introduction rules). This paper explores whether the new results undermine this claim. It is argued that, while the formal results are worrying, superintuitionistic inferences are valid because the treatments of atomic (...) formulas are insufficiently general, and a resolution to this issue is proposed. (shrink)

It is widely accepted that there is a clear sense in which the first-order paraconsistent constructive logic with strong negation of Almukdad and Nelson, QN4, is more constructive than intuitionistic first-order logic, QInt. While QInt and QN4 both possess the disjunction property and the existence property as characteristics of constructiveness (or constructivity), QInt lacks certain features of constructiveness enjoyed by QN4, namely the constructible falsity property and the dual of the existence property. This paper deals with the constructiveness of the (...) contra-classical, connexive, paraconsistent, and contradictory non-trivial first-order logic QC, which is a connexive variant of QN4. It is shown that there is a sense in which QC is even more constructive than QN4. The argument focuses on a problem that is mirror-inverted to Raymond Smullyan’s drinker paradox, namely the invalidity of what will be called the drinker truism and its dual in QN4 (and QInt), and on a version of the Brouwer-Heyting-Kolmogorov interpretation of the logical operations that treats proofs and disproofs on a par. The validity of the drinker truism and its dual together with the greater constructiveness of QC in comparison to QN4 may serve as further motivation for the study of connexive logics and suggests that constructive logic is connexive and contradictory (the latter understood as being negation inconsistent). (shrink)

Logic has pride of place in mathematics and its 20th century offshoot, computer science. Modern symbolic logic was developed, in part, as a way to provide a formal framework for mathematics: Frege, Peano, Whitehead and Russell, as well as Hilbert developed systems of logic to formalize mathematics. These systems were meant to serve either as themselves foundational, or at least as formal analogs of mathematical reasoning amenable to mathematical study, e.g., in Hilbert’s consistency program. Similar efforts continue, but have been (...) expanded by the development of sophisticated methods to study the properties of such systems using proof and model theory. In parallel with this evolution of logical formalisms as tools for articulating mathematical theories (broadly speaking), much progress has been made in the quest for a mechanization of logical inference and the investigation of its theoretical limits, culminating recently in the development of new foundational frameworks for mathematics with sophisticated computer-assisted proof systems. In addition, logical formalisms developed by logicians in mathematical and philosophical contexts have proved immensely useful in describing theories and systems of interest to computer scientists, and to some degree, vice versa. Three examples of the influence of logic in computer science are automated reasoning, computer verification, and type systems for programming languages. (shrink)

In this article, we survey intuitionism as a philosophy of mathematics, with emphasis on the philosophical views endorsed by Brouwer, Heyting, and Dummett. Before we proceed, however, a few general remark are in order. We must stress that intuitionism is not to be regarded as synonymous with constructivism, an umbrella term that roughly refers to any particular form of mathematics that adopts "we can construct" as the appropriate interpretation of the phrase "there exists". However, intuitionism remains one of the most (...) prominent varieties of constructive mathematics in existence. The curious reader can see our related entry constructive mathematics for complementary background. For more on the intuitionistic rejection of actual infinities, see also the entry on the infinite. Finally, because intuitionism advocates a revision of classical mathematics, a certain amount of mathematical knowledge is required to fully appreciate some parts of this article, most importantly Section 1.2 on intuitionistic analysis. Readers can check any introductory textbook on classical real analysis or topology if they are not familiar with our terminology. Some familiarity with basic set theory will also be presupposed in Section 1.1, in particular regarding transfinite ordinals and uncountable cardinalities. Since our focus is intuitionistic mathematics, intuitionistic logic is not presented in this article. But we include a list of notable theorems and non-theorems of intuitionistic logic in the appendix for reference. (shrink)

We investigate degree of satisfiability questions in the context of Heyting algebras and intuitionistic logic. We classify all equations in one free variable with respect to finite satisfiability gap, and determine which common principles of classical logic in multiple free variables have finite satisfiability gap. In particular we prove that, in a finite non-Boolean Heyting algebra, the probability that a randomly chosen element satisfies $x \vee \neg x = \top $ is no larger than $\frac {2}{3}$. Finally, we generalize our (...) results to infinite Heyting algebras, and present their applications to point-set topology, black-box algebras, and the philosophy of logic. (shrink)

Let $n$-Medvedev’s logic $\textbf{ML}_{n}$ be the intuitionistic logic of Medvedev frames based on the non-empty subsets of a set of size $n$, which we call $n$-Medvedev frames. While these are tabular logics, after characterizing $n$-Medvedev frames using the property of having at least $n$ maximal points, we offer a uniform axiomatization of them through a Gabbay-style rule corresponding to this property. Further properties including compactness, disjunction property, and structural completeness of $\textbf{ML}_{n}$ are explored and compared to those of Medvedev’s logic (...) $\textbf{ML}$. (shrink)

A terminating sequent calculus for intuitionistic propositional logic is obtained by modifying the R $\supset $ rule of the labelled sequent calculus $\mathbf {G3I}$. This is done by adding a variant of the principle of a fortiori in the left-hand side of the premiss of the rule. In the resulting calculus, called ${\mathbf {G3I}}_{\mathbf {t}}$, derivability of any given sequent is directly decidable by root-first proof search, without any extra device such as loop-checking. In the negative case, the failed proof (...) search gives a finite countermodel to the sequent on a reflexive, transitive, and Noetherian Kripke frame. As a byproduct, a direct proof of faithfulness of the embedding of intuitionistic logic into Grzegorcyk logic is obtained. (shrink)

Two new propositional non-classical logics, referred to as symmetric intuitionistic logic (SIL) and conflated intuitionistic logic (CIL), are introduced as indexed and non-indexed Gentzen-style sequent calculi. SIL is regarded as a natural hybrid logic combining intuitionistic and dual-intuitionistic logics, whereas CIL is regarded as a variant of intuitionistic paraconsistent logic with conflation and without paraconsistent negation. The cut-elimination theorems for SIL and CIL are proved. CIL is shown to be conservative over SIL.

Negation often reinforces problematic habits of othering, but rethinking negation can make good on feminist hopes for logic as a transformative space for inclusion. As Plumwood argues in her 1993 paper, not all uses of negation in the context of social identity are inherently problematic, but the widespread implicit use of classical negation has limited our options with respect to representing difference, ultimately reinforcing dualisms that essentialize social differences in problematic ways. In response to these limitations, I take inspiration from (...) Dembroff’s recent work on the metaphysics of genderqueer identity to build models of social identity using the Heyting-Brouwer logic developed by Rauszer in 1974. Ultimately, I argue that these models demonstrate both how classical negation reinforces problematic habits of othering and how alternative forms of negation can transform our treatment of social identity altogether. (shrink)

This paper proves normalisation theorems for intuitionist and classical negative free logic, without and with the $\invertediota$ operator for definite descriptions. Rules specific to free logic give rise to new kinds of maximal formulas additional to those familiar from standard intuitionist and classical logic. When $\invertediota$ is added it must be ensured that reduction procedures involving replacements of parameters by terms do not introduce new maximal formulas of higher degree than the ones removed. The problem is solved by a rule (...) that permits restricting these terms in the rules for $\forall$, $\exists$ and $\invertediota$ to parameters or constants. A restricted subformula property for deductions in systems without $\invertediota$ is considered. It is improved upon by an alternative formalisation of free logic building on an idea of Ja\'skowski's. In the classical system the rules for $\invertediota$ require treatment known from normalisation for classical logic with $\lor$ or $\exists$. The philosophical significance of the results is also indicated. (shrink)

A truthmaker for a proposition P is exact if it contains nothing irrelevant to P. What are the exact truthmakers for necessitated propositions? This paper makes progress on this issue by showing how to extend Fine’s truthmaker semantics for intuitionistic logic to an exact truthmaker semantics for intuitionistic modal logic. The project is of interest also to the classical logician: while all distinctively classical theorems may be true, they differ from the intuitionistic ones in how they are made true. This (...) sheds new light on the status of the T and B axioms. (shrink)

It has long been known that (classical) Peano arithmetic is, in some strong sense, “equivalent” to the variant of (classical) Zermelo–Fraenkel set theory (including choice) in which the axiom of infinity is replaced by its negation. The intended model of the latter is the set of hereditarily finite sets. The connection between the theories is so tight that they may be taken as notational variants of each other. Our purpose here is to develop and establish a constructive version of this. (...) We present an intuitionistic theory of the hereditarily finite sets, and show that it is definitionally equivalent to Heyting Arithmetic, in a sense to be made precise. Our main target theory, the intuitionistic small set theory is remarkably simple, and intuitive. It has just one non-logical primitive, for membership, and three straightforward axioms plus one axiom scheme. We locate our theory within intuitionistic mathematics generally. (shrink)

We investigate a recently devised polyhedral semantics for intermediate logics, in which formulas are interpreted in n-dimensional polyhedra. An intermediate logic is polyhedrally complete if it is complete with respect to some class of polyhedra. The first main result of this paper is a necessary and sufficient condition for the polyhedral completeness of a logic. This condition, which we call the Nerve Criterion, is expressed in terms of Alexandrov’s notion of the nerve of a poset. It affords a purely combinatorial (...) characterisation of polyhedrally complete logics. Using the Nerve Criterion we show, easily, that there are continuum many intermediate logics that are not polyhedrally complete but which have the finite model property. We also provide, at considerable combinatorial labour, a countably infinite class of logics axiomatised by the Jankov–Fine formulas of ‘starlike trees’ all of which are polyhedrally complete. The polyhedral completeness theorem for these ‘starlike logics’ is the second main result of this paper. (shrink)

The well-known algebraic semantics and topological semantics for intuitionistic logic (Int) is here extended to Wansing's bi-intuitionistic logic (2Int). The logic 2Int is also characterised by a quasi-twist structure semantics, which leads to an alternative topological characterisation of 2Int. Later, notions of Fregean negation and of unilateralisation are proposed. The logic 2Int is extended with a ‘Fregean negation’ connective ∼, obtaining 2Int∼, and it is showed that the logic N4⋆ (an extension of Nelson's paraconsistent logic) results to be the unilateralisation (...) of 2Int∼ via ∼. The logic 2Int∼ is also characterised by a Kripke-style semantics, a twist structure semantics and a topological semantics. (shrink)

The principle motivation of this work is to display the sense in which the epistemic reading of a Kripke model tacitly requires common knowledge of the model, CKM. This requirement significantly restricts the amount of epistemic situations we are able to consider. We explore possible worlds epistemic models in a general setting without CKM assumptions and show that such models can be identified with observable substructures of Kripke models. We argue that such observable models offer a new level of generality (...) and conceptual clarity in epistemic modeling. Similar analysis applies to intuitionistic models. (shrink)

I discuss problems with Martin-Löf's distinction between analytic and synthetic judgments in constructive type theory and propose a revision of his views. I maintain that a judgment is analytic when its correctness follows exclusively from the evaluation of the expressions occurring in it. I argue that Martin-Löf's claim that all judgments of the forms a : A and a = b : A are analytic is unfounded. As I shall show, when A evaluates to a dependent function type (x : (...) B) → C, all judgments of these forms fail to be analytic and therefore end up as synthetic. Going beyond the scope of Martin-Löf's original distinction, I also argue that all hypothetical judgments are synthetic and show how the analytic-synthetic distinction reworked here is capable of accommodating judgments of the forms A type and A = B type as well. Finally, I consider and reject an alternative account of analyticity as decidability and assess Martin-Löf's position on the analytic grounding of synthetic judgments. (shrink)

The constructive mathematics developed by Bishop in Foundations of Constructive Analysis succeeded in gaining the attention of mathematicians, but discussions of its underlying philosophy are still rare in the literature. Commentators seem to conclude, from Bishop’s rejection of choice sequences and his severe criticism of Brouwerian intuitionism, that he is not an intuitionist–broadly understood as someone who maintains that mathematics is a mental creation, mathematics is meaningful and eludes formalization, mathematical objects are mind-dependent constructions given in intuition, and mathematical truths (...) are experienceable. This paper develops and defends an intuitionistic interpretation of Bishop’s philosophical views. (shrink)

In this paper, we give a new proof of the correspondence between the existence of a winning strategy for intuitionistic E-games and Intuistionistic validity for first-order logic. The proof is obtained by a direct mapping between formal E-strategies and derivations in a cut-free complete sequent calculus for first-order intuitionistic logic. Our approach builds on the one developed by Herbelin in his PhD dissertation and greatly simplifies the proof of correspondence given by Felscher in his classic paper.

Recent research on algebraic models of _quasi-Nelson logic_ has brought new attention to a number of classes of algebras which result from enriching (subreducts of) Heyting algebras with a special modal operator, known in the literature as a _nucleus_. Among these various algebraic structures, for which we employ the umbrella term _intuitionistic modal algebras_, some have been studied since at least the 1970s, usually within the framework of topology and sheaf theory. Others may seem more exotic, for their primitive operations (...) arise from algebraic terms of the intuitionistic modal language which have not been previously considered. We shall for instance investigate the variety of _weak implicative semilattices_, whose members are (non-necessarily distributive) meet semilattices endowed with a nucleus and an implication operation which is not a relative pseudo-complement but satisfies the postulates of Celani and Jansana’s strict implication. For each of these new classes of algebras we establish a representation and a topological duality which generalize the known ones for Heyting algebras enriched with a nucleus. (shrink)

Sahlqvist theory is extended to the fragments of the intuitionistic propositional calculus that include the conjunction connective. This allows us to introduce a Sahlqvist theory of intuitionistic character amenable to arbitrary protoalgebraic deductive systems. As an application, we obtain a Sahlqvist theorem for the fragments of the intuitionistic propositional calculus that include the implication connective and for the extensions of the intuitionistic linear logic.

The provability problem in intuitionistic propositional second-order logic with existential quantifier and implication (∃,→) is proved to be undecidable in presence of free type variables (constants). This contrasts with the result that inutitionistic propositional second-order logic with existential quantifier, conjunction and negation is decidable.

Non-classical generalizations of classical modal logic have been developed in the contexts of constructive mathematics and natural language semantics. In this paper, we discuss a general approach to the semantics of non-classical modal logics via algebraic representation theorems. We begin with complete lattices L equipped with an antitone operation ¬ sending 1 to 0, a completely multiplicative operation ◻, and a completely additive operation ◊. Such lattice expansions can be represented by means of a set X together with binary relations (...) ⊲, R, and Q, satisfying some first-order conditions, used to represent (L,¬), ◻, and ◊, respectively. Indeed, any lattice L equipped with such a ¬, a multiplicative ◻, and an additive ◊ embeds into the lattice of propositions of a frame (X,⊲,R,Q). Building on our recent study of "fundamental logic", we focus on the case where ¬ is dually self-adjoint (a≤¬b implies b≤¬a) and ◊¬a≤¬◻a. In this case, the representations can be constrained so that R=Q, i.e., we need only add a single relation to (X,⊲) to represent both ◻ and ◊. Using these results, we prove that a system of fundamental modal logic is sound and complete with respect to an elementary class of bi-relational structures (X,⊲,R). (shrink)

We offer an alternative approach to the existing methods for intuitionistic formalization of reasoning about probability. In terms of Kripke models, each possible world is equipped with a structure of the form \(\langle H, \mu \rangle \) that needs not be a probability space. More precisely, though _H_ needs not be a Boolean algebra, the corresponding monotone function (we call it measure) \(\mu : H \longrightarrow [0,1]_{\mathbb {Q}}\) satisfies the following condition: if \(\alpha \), \(\beta \), \(\alpha \wedge \beta \), (...) \(\alpha \vee \beta \in H\), then \(\mu (\alpha \vee \beta ) = \mu (\alpha ) + \mu (\beta ) - \mu (\alpha \wedge \beta )\). Since the range of \(\mu \) is the set \([0,1]_{\mathbb {Q}}\) of rational numbers from the real unit interval, our logic is not compact. In order to obtain a strong complete axiomatization, we introduce an infinitary inference rule with a countable set of premises. The main technical results are the proofs of strong completeness and decidability. (shrink)

In this note, we review paradoxes like Russell’s, the Liar, and Curry’s in the context of intuitionistic logic. One may observe that one cannot blame the underlying logic for the paradoxes, but has to take into account the particular concept formations. For proof-theoretic semantics, however, this comes with the challenge to block some forms of direct axiomatizations of the Liar. A proper answer to this challenge might be given by Schroeder-Heister’s definitional freedom.

We develop intuitionistic public announcement logic over intuitionistic \({\textbf{K}}\), \({{\textbf{K}}}{{\textbf{T}}}\), \({{\textbf{K}}}{{\textbf{4}}}\), and \({{\textbf{S}}}{{\textbf{4}}}\) with distributed knowledge. We reveal that a recursion axiom for the distributed knowledge is _not_ valid for a frame class discussed in [ 12 ] but valid for the restricted frame class introduced in [ 20, 26 ]. The semantic completeness of the static logics for this restricted frame class is established via the concept of pseudo-model.