On formulas of one variable in intuitionistic propositional calculus
From MaRDI portal
Publication:3843602
DOI10.2307/2963526zbMath0108.00302OpenAlexW1978576229MaRDI QIDQ3843602
Publication date: 1960
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2963526
Related Items (48)
Certain Method for Generating a Series of Logics ⋮ V. Yankov’s Contributions to Propositional Logic ⋮ Representable idempotent commutative residuated lattices ⋮ Undecidability of QLTL and QCTL with two variables and one monadic predicate letter ⋮ The undecidability of the disjunction property of propositional logics and other related problems ⋮ On the period of sequences (An(p)) in intuitionistic propositional calculus ⋮ Complexity of finite-variable fragments of propositional temporal and modal logics of computation ⋮ Two classes of intermediate propositional logics without disjunction property ⋮ Bisimulation and propositional intuitionistic logic ⋮ Decidable variables for constructive logics ⋮ Computational complexity of the word problem in modal and Heyting algebras with a small number of generators ⋮ An intuitionistic formula hierarchy based on high‐school identities ⋮ Epimorphism surjectivity in varieties of Heyting algebras ⋮ Tarski's theorem on intuitionistic logic, for polyhedra ⋮ Hereditarily structurally complete intermediate logics: Citkin's theorem via duality ⋮ On a second order propositional operator in intuitionistic logic ⋮ Injective and Projective Heyting Algebras ⋮ All intermediate logics with extra axioms in one variable, except eight, are not strongly ω-complete ⋮ Lattices of Intermediate Theories via Ruitenburg's Theorem ⋮ Irreflexive modality as a new logical connective in the Dummett logic ⋮ An \(\mathsf{AC}^{1}\)-complete model checking problem for intuitionistic logic ⋮ On an extension of Gabbay's logic ⋮ The disjunction property of intermediate propositional logics ⋮ Computations in fragments of intuitionistic propositional logic ⋮ Finitely generated free Heyting algebras: the well-founded initial segment ⋮ The Complexity of Model Checking for Intuitionistic Logics and Their Modal Companions ⋮ The free process algebra generated by \(\delta \), \(\epsilon\) and \(\tau \) ⋮ On the rules of intermediate logics ⋮ \(\aleph_0\)-categoricity for rings without nilpotent elements and for Boolean structures ⋮ Irreflexive modality, the Dummett logic, and continual chains ⋮ Innocuous substitutions ⋮ FORMULAS IN MODAL LOGIC S4 ⋮ A Survey of Propositional Realizability Logic ⋮ Logics without Craig's interpolation property ⋮ The simple substitution property of Gödel's intermediate propositional logics \(S_ n\)'s ⋮ Interpretations into Heyting algebras ⋮ Complexity of intuitionistic propositional logic and its fragments ⋮ Logics of some Kripke frames connected with Medvedev notion of informational types ⋮ AN ALGEBRAIC APPROACH TO CANONICAL FORMULAS: INTUITIONISTIC CASE ⋮ Finitely generated free Heyting algebras ⋮ A note on entropy of logic ⋮ Undecidability of first-order modal and intuitionistic logics with two variables and one monadic predicate letter ⋮ DECIDABILITY OF ADMISSIBILITY: ON A PROBLEM BY FRIEDMAN AND ITS SOLUTION BY RYBAKOV ⋮ Sentential constants in systems near R ⋮ Implicational complexity in intuitionistic arithmetic ⋮ Projectivity in (bounded) commutative integral residuated lattices ⋮ On some semi-intuitionistic logics ⋮ An application of Rieger-Nishimura formulas to the intuitionistic modal logics
Cites Work
This page was built for publication: On formulas of one variable in intuitionistic propositional calculus
