In the paper we consider complexity of intuitionistic propositional logic and its natural fragments such as implicative fragment, finite-variable fragments, and some others. Most facts we mention here are known and obtained by logicians from different countries and in different time since 1920s; we present these results together to see the whole picture.

This paper introduces and explores a conservative extension of inquisitive logic. In particular, weak negation is added to the standard propositional language of inquisitive semantics, and it is shown that, although we lose some general semantic properties of the original framework, such an enrichment enables us to model some previously inexpressible speech acts such as weak denial and ‘might’-assertions. As a result, a new modal logic emerges. For this logic, a Fitch-style system of natural deduction is formulated. The main result (...) of this paper is a theorem establishing the completeness of the system with respect to inquisitive semantics with weak negation. At the conclusion of the paper, the possibility of extending the framework to the level of first order logic is briefly discussed. (shrink)

We prove the following surprising property of Heyting's intuitionistic propositional calculus, IpC. Consider the collection of formulas, φ, built up from propositional variables (p,q,r,...) and falsity $(\perp)$ using conjunction $(\wedge)$ , disjunction (∨) and implication (→). Write $\vdash\phi$ to indicate that such a formula is intuitionistically valid. We show that for each variable p and formula φ there exists a formula Apφ (effectively computable from φ), containing only variables not equal to p which occur in φ, and such that for (...) all formulas ψ not involving $p, \vdash \psi \rightarrow A_p\phi$ if and only if $\vdash \psi \rightarrow \phi$ . Consequently quantification over propositional variables can be modelled in IpC, and there is an interpretation of the second order propositional calculus, IpC2, in IpC which restricts to the identity on first order propositions. An immediate corollary is the strengthening of the usual interpolation theorem for IpC to the statement that there are least and greatest interpolant formulas for any given pair of formulas. The result also has a number of interesting consequences for the algebraic counterpart of IpC, the theory of Heyting algebras. In particular we show that a model of IpC2 can be constructed whose algebra of truth-values is equal to any given Heyting algebra. (shrink)

In [4], Caicedo and Cignoli study compatible functions on Heyting algebras and the corresponding logical properties of connectives defined on intuitionistic propositional calculus. In this paper we study some aspects of compatible functions on the algebras associated to positive propositional calculus and successive extensions of it: intuitionistic calculus itself, the modal symmetric propositional calculus of Moisil and n-valued Łukasiewicz propositional calculus.

It is shown that axiomatic extensions of intuitionistic propositional calculus defining univocally new connectives, including those proposed by Gabbay, are strongly complete with respect to valuations in Heyting algebras with additional operations. In all cases, the double negation of such a connective is equivalent to a formula of intuitionistic calculus. Thus, under the excluded third law it collapses to a classical formula, showing that this condition in Gabbay's definition is redundant. Moreover, such connectives can not be interpreted in all Heyting (...) algebras, unless they are already equivalent to a formula of intuitionistic calculus. These facts relativize to connectives over intermediate logics. In particular, the intermediate logic with values in the chain of length n may be "completed" conservatively by adding a single unary connective, so that the expanded system does not allow further axiomatic extensions by new connectives. (shrink)

It will be an essential resource for philosophers, mathematicians, computer scientists, linguists, or any scholar who finds connectives, and the conceptual issues surrounding them, to be a source of interest.This landmark work offers both ...

n this paper we investigate the implication-less fragment of Johansson's minimal logic. We call it subminimal logic and we study its associated algebras, which we call weak algebras. We prove the algebraic Glivenko theorem, soundness and completeness for this logic.

It is shown that axiomatic extensions of intuitionistic propositional calculus defining univocally new connectives, including those proposed by Gabbay, are strongly complete with respect to valuations in Heyting algebras with additional operations. In all cases, the double negation of such a connective is equivalent to a formula of intuitionistic calculus. Thus, under the excluded third law it collapses to a classical formula, showing that this condition in Gabbay's definition is redundant. Moreover, such connectives can not be interpreted in all Heyting (...) algebras, unless they are already equivalent to a formula of intuitionistic calculus. These facts relativize to connectives over intermediate logics. In particular, the intermediate logic with values in the chain of length n may be "completed" conservatively by adding a single unary connective, so that the expanded system does not allow further axiomatic extensions by new connectives. (shrink)