Pages that link to "Item:Q5608767"
From MaRDI portal
The following pages link to A new algorithm for derivability in the constructive propositional calculus (Q5608767):
Displaying 13 items.
- Constructive logics. I: A tutorial on proof systems and typed \(\lambda\)- calculi (Q1208732) (← links)
- The G4i analogue of a G3i sequent calculus (Q2106879) (← links)
- Uniform interpolation and the existence of sequent calculi (Q2326416) (← links)
- Contraction-free linear depth sequent calculi for intuitionistic propositional logic with the subformula property and minimal depth counter-models (Q2351164) (← links)
- Terminating calculi for propositional Dummett logic with subformula property (Q2352485) (← links)
- A unified procedure for provability and counter-model generation in minimal implicational logic (Q2397231) (← links)
- Invertible infinitary calculus without loop rules for restricted FTL (Q2577594) (← links)
- Admissibility of structural rules for contraction-free systems of intuitionistic logic (Q2710593) (← links)
- Intuitionistic Decision Procedures Since Gentzen (Q3305556) (← links)
- On an interpretation of second order quantification in first order intuitionistic propositional logic (Q4008745) (← links)
- An intuitionistic formula hierarchy based on high‐school identities (Q5108846) (← links)
- Proof-theoretical investigation of temporal logic with time gaps (Q5930981) (← links)
- Linear depth deduction with subformula property for intuitionistic epistemic logic (Q6156631) (← links)
