The decidability of the Kreisel-Putnam system
From MaRDI portal
Publication:5635427
DOI10.2307/2270700zbMath0228.02013OpenAlexW2091330336MaRDI QIDQ5635427
Publication date: 1971
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2270700
Decidability of theories and sets of sentences (03B25) Subsystems of classical logic (including intuitionistic logic) (03B20)
Related Items (14)
Recognizability of all WIP-minimal logics ⋮ A method to single out maximal propositional logics with the disjunction property. I ⋮ A method to single out maximal propositional logics with the disjunction property. II ⋮ Generalized tableau systems for intermediate propositional logics ⋮ On fragments of Medvedev's logic ⋮ The disjunction property of intermediate propositional logics ⋮ Structural connections between a forcing class and its modal logic ⋮ On the modal logic of subset and superset: tense logic over Medvedev frames ⋮ An infinite class of maximal intermediate propositional logics with the disjunction property ⋮ Modal counterparts of Medvedev logic of finite problems are not finitely axiomatizable ⋮ Complexity of intuitionistic propositional logic and its fragments ⋮ On the extension of intuitionistic propositional logic with Kreisel- Putnam's and Scott's schemes ⋮ Some results on the intermediate logics ⋮ On maximal intermediate predicate constructive logics
Cites Work
This page was built for publication: The decidability of the Kreisel-Putnam system
