Substitutions of \(\Sigma_1^0\)-sentences: Explorations between intuitionistic propositional logic and intuitionistic arithmetic

DOI10.1016/S0168-0072(01)00081-1zbMath1009.03029MaRDI QIDQ5957858

Albert Visser

Publication date: 27 April 2003

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

zbMATH Keywords

Heyting arithmeticconsequence relationsclosed fragmentintuitionistic propositional calculusprovability logicsrobust formulas

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Subsystems of classical logic (including intuitionistic logic) (03B20) Intuitionistic mathematics (03F55) Provability logics and related algebras (e.g., diagonalizable algebras) (03F45)

Related Items (17)

On rules ⋮ The basic intuitionistic logic of proofs ⋮ Tutorial on Admissible Rules in Gudauri ⋮ Implication via spacetime ⋮ Hard provability logics ⋮ EXTENDED FRAMES AND SEPARATIONS OF LOGICAL PRINCIPLES ⋮ Lewis meets Brouwer: constructive strict implication ⋮ Intermediate logics and the de Jongh property ⋮ Unnamed Item ⋮ Admissibility and refutation: some characterisations of intermediate logics ⋮ Provability logic and the completeness principle ⋮ On the rules of intermediate logics ⋮ The \(\Sigma_1\)-provability logic of \(\mathsf{HA}\) ⋮ THE -PROVABILITY LOGIC OF ⋮ Closed Fragments of Provability Logics of Constructive Theories ⋮ Proof theory for admissible rules ⋮ Predicate Logics of Constructive Arithmetical Theories

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the provability logic of bounded arithmetic
• Self-reference and modal logic
• Constructivism in mathematics. An introduction. Volume I
• Intuitionistic propositional logic is polynomial-space complete
• Admissibility of logical inference rules
• Shavrukov's theorem on the subalgebras of diagonalizable algebras for theories containing \(I\Delta_ 0 + \exp\)
• A semantical proof of De Jongh's theorem
• Undefinability of propositional quantifiers in the modal system S4
• Metamathematical investigation of intuitionistic arithmetic and analysis. With contributions by C. A. Smorynski, J. I. Zucker and W. A. Howard
• SOME VARIANTS OF THE NOTION OF REALIZABILITY FOR PREDICATE FORMULAS
• ABSOLUTE REALIZABILITY OF PREDICATE FORMULAS
• Innocuous substitutions
• Implicational complexity in intuitionistic arithmetic
• On an interpretation of second order quantification in first order intuitionistic propositional logic
• Rules of inference with parameters for intuitionistic logic
• The nonderivability in intuitionistic formal systems of theorems on the continuity of effective operations
• One hundred and two problems in mathematical logic
• THE NONARITHMETICITY OF THE CLASS OF REALIZABLE PREDICATE FORMULAS
• Unification in intuitionistic logic
• Fragments of Heyting arithmetic
• On the completenes principle: A study of provability in heyting's arithmetic and extensions
• The decidability of dependency in intuitionistic propositional logic
• A sheaf representation and duality for finitely presented Heyting algebras

This page was built for publication: Substitutions of \(\Sigma_1^0\)-sentences: Explorations between intuitionistic propositional logic and intuitionistic arithmetic