On formulas of one variable in intuitionistic propositional calculus
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3871347
- Classical propositional logic and decidability of variables in intuitionistic propositional logic
- On density of truth of the intuitionistic logic in one variable
- Extendible formulas in two variables in intuitionistic logic
- A note on decidability of variables in intuitionistic propositional logic
Cites work
Cited in
(63)- The simple substitution property of Gödel's intermediate propositional logics \(S_ n\)'s
- Undecidability of QLTL and QCTL with two variables and one monadic predicate letter
- Computations in fragments of intuitionistic propositional logic
- Sentential constants in systems near R
- The undecidability of the disjunction property of propositional logics and other related problems
- Finitely generated free Heyting algebras: the well-founded initial segment
- Projectivity in (bounded) commutative integral residuated lattices
- Interpretations into Heyting algebras
- Classical propositional logic and decidability of variables in intuitionistic propositional logic
- DECIDABILITY OF ADMISSIBILITY: ON A PROBLEM BY FRIEDMAN AND ITS SOLUTION BY RYBAKOV
- Epimorphism surjectivity in varieties of Heyting algebras
- On some semi-intuitionistic logics
- An intuitionistic formula hierarchy based on high‐school identities
- The free process algebra generated by \(\delta \), \(\epsilon\) and \(\tau \)
- V. Yankov’s Contributions to Propositional Logic
- Logics of some Kripke frames connected with Medvedev notion of informational types
- Two classes of intermediate propositional logics without disjunction property
- On a second order propositional operator in intuitionistic logic
- One-variable logic meets Presburger arithmetic
- A note on entropy of logic
- A Survey of Propositional Realizability Logic
- Lattices of Intermediate Theories via Ruitenburg's Theorem
- On the period of sequences (An(p)) in intuitionistic propositional calculus
- The Complexity of Model Checking for Intuitionistic Logics and Their Modal Companions
- Finitely generated free Heyting algebras
- AN ALGEBRAIC APPROACH TO CANONICAL FORMULAS: INTUITIONISTIC CASE
- Irreflexive modality, the Dummett logic, and continual chains
- The disjunction property of intermediate propositional logics
- Decidable variables for constructive logics
- scientific article; zbMATH DE number 3871347 (Why is no real title available?)
- Innocuous substitutions
- Extendible formulas in two variables in intuitionistic logic
- On the rules of intermediate logics
- Injective and Projective Heyting Algebras
- Logics without Craig's interpolation property
- A note on decidability of variables in intuitionistic propositional logic
- Representable idempotent commutative residuated lattices
- Irreflexive modality as a new logical connective in the Dummett logic
- Strictly n-finite varieties of Heyting algebras
- An \(\mathsf{AC}^{1}\)-complete model checking problem for intuitionistic logic
- Individual concepts as propositional variables in \(ML^{\nu +1}\)
- Certain Method for Generating a Series of Logics
- Terms that define nuclei on residuated lattices: a case study of BL-algebras
- All intermediate logics with extra axioms in one variable except eight are not strongly -complete.
- Complexity of intuitionistic propositional logic and its fragments
- Undecidability of first-order modal and intuitionistic logics with two variables and one monadic predicate letter
- Complexity of finite-variable fragments of propositional temporal and modal logics of computation
- Implicational complexity in intuitionistic arithmetic
- Bisimulation and propositional intuitionistic logic
- Computational complexity of the word problem in modal and Heyting algebras with a small number of generators
- scientific article; zbMATH DE number 3240380 (Why is no real title available?)
- Polytime embedding of intuitionistic modal logics into their one-variable fragments
- Nishimura formulas as one-place logical connectives in the elementary theory of Kripke models
- An application of Rieger-Nishimura formulas to the intuitionistic modal logics
- Algorithmic properties of modal and superintuitionistic logics of monadic predicates over finite Kripke frames
- Formulas in modal logic S4
- Tarski's theorem on intuitionistic logic, for polyhedra
- On an extension of Gabbay's logic
- Hereditarily structurally complete intermediate logics: Citkin's theorem via duality
- \(\aleph_0\)-categoricity for rings without nilpotent elements and for Boolean structures
- Erratum to: ``A ground-theoretical modal definition of essence
- Corrigendum to: ``On translating between logics
- scientific article; zbMATH DE number 408804 (Why is no real title available?)
This page was built for publication: On formulas of one variable in intuitionistic propositional calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3843602)
