Pages that link to "Item:Q4032862"
From MaRDI portal
The following pages link to Contraction-free sequent calculi for intuitionistic logic (Q4032862):
Displaying 31 items.
- Improving Coq Propositional Reasoning Using a Lazy CNF Conversion Scheme (Q3655207) (← links)
- 1998 European Summer Meeting of the Association for Symbolic Logic (Q4254644) (← links)
- A Formalisation of Weak Normalisation (with Respect to Permutations) of Sequent Calculus Proofs (Q4506460) (← links)
- Generalized tableau systems for intermediate propositional logics (Q4610314) (← links)
- Two loop detection mechanisms: A comparison (Q4610326) (← links)
- ileanTAP: An intuitionistic theorem prover (Q4610335) (← links)
- Efficient loop-check for backward proof search in some non-classical propositional logics (Q4645239) (← links)
- A timing refinement of intuitionistic proofs and its application to the timing analysis of combinational circuits (Q4645242) (← links)
- Proof-search in intuitionistic logic based on constraint satisfaction (Q4645245) (← links)
- CONTRACTION-FREE SEQUENT CALCULI FOR INTUITIONISTIC LOGIC: A CORRECTION (Q4647120) (← links)
- A resolution theorem prover for intuitionistic logic (Q4647496) (← links)
- Sequent Calculi for Intuitionistic Linear Logic with Strong Negation (Q4796512) (← links)
- European Summer Meeting of the Association for Symbolic Logic (Q4837676) (← links)
- (Q4856945) (← links)
- Eigenvariables, bracketing and the decidability of positive minimal intuitionistic logic (Q4924544) (← links)
- The Tableau Workbench (Q4982114) (← links)
- (Q5020970) (← links)
- Abductive Reasoning in Intuitionistic Propositional Logic via Theorem Synthesis (Q5038472) (← links)
- Practical Proof Search for Coq by Type Inhabitation (Q5048991) (← links)
- An intuitionistic formula hierarchy based on high‐school identities (Q5108846) (← links)
- Deciding intuitionistic propositional logic via translation into classical logic (Q5234697) (← links)
- Minlog: A minimal logic theorem prover (Q5234710) (← links)
- Proof Search and Counter Model of Positive Minimal Predicate Logic (Q5415611) (← links)
- Continuation-Passing Style and Strong Normalisation for Intuitionistic Sequent Calculi (Q5902124) (← links)
- Proof-theoretical investigation of temporal logic with time gaps (Q5930981) (← links)
- Subtractive logic (Q5940919) (← links)
- An ecumenical notion of entailment (Q6067097) (← links)
- Interactive matching logic proofs in Coq (Q6605348) (← links)
- General clauses for SAT-based proof search in intuitionistic propositional logic (Q6611961) (← links)
- Proof theory for Lax Logic (Q6612814) (← links)
- On Dummett's pragmatist justification procedure (Q6652859) (← links)