A new algorithm for derivability in the constructive propositional calculus
From MaRDI portal
Publication:5608767
DOI10.1090/TRANS2/094/02zbMath0208.01905OpenAlexW4214599228MaRDI QIDQ5608767
Publication date: 1970
Published in: Sixteen Papers on Logic and Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/trans2/094/02
Related Items (13)
A unified procedure for provability and counter-model generation in minimal implicational logic ⋮ On an interpretation of second order quantification in first order intuitionistic propositional logic ⋮ An intuitionistic formula hierarchy based on high‐school identities ⋮ Linear depth deduction with subformula property for intuitionistic epistemic logic ⋮ Admissibility of structural rules for contraction-free systems of intuitionistic logic ⋮ Intuitionistic Decision Procedures Since Gentzen ⋮ Proof-theoretical investigation of temporal logic with time gaps ⋮ Constructive logics. I: A tutorial on proof systems and typed \(\lambda\)- calculi ⋮ Uniform interpolation and the existence of sequent calculi ⋮ Invertible infinitary calculus without loop rules for restricted FTL ⋮ The G4i analogue of a G3i sequent calculus ⋮ Contraction-free linear depth sequent calculi for intuitionistic propositional logic with the subformula property and minimal depth counter-models ⋮ Terminating calculi for propositional Dummett logic with subformula property
This page was built for publication: A new algorithm for derivability in the constructive propositional calculus
