Pages that link to "Item:Q1575928"
From MaRDI portal
The following pages link to Proof finding algorithms for implicational logics (Q1575928):
Displaying 17 items.
- The decidability of a fragment of \(\text{BB}'\text{IW}\)-logic (Q596035) (← links)
- Proof search algorithm in pure logical framework (Q779163) (← links)
- Types of I-free hereditary right maximal terms (Q812102) (← links)
- Proof-finding algorithms for classical and subclassical propositional logics (Q1049689) (← links)
- Algorithmic proof methods and cut elimination for implicational logics. I: Modal implication (Q1580655) (← links)
- Logical foundation of the quintuple implication inference methods (Q1726231) (← links)
- Inhabitants of intuitionistic implicational theorems (Q1799268) (← links)
- An algorithm for the class of pure implicational formulas (Q1961448) (← links)
- Pre-grammars and inhabitation for a subset of rank 2 intersection types (Q2333664) (← links)
- Long normal form proof search and counter-model generation (Q2703714) (← links)
- Notes towards a semantics for proof-search (Q2703721) (← links)
- IMPLICATIONAL RELEVANCE LOGIC IS 2-EXPTIME-COMPLETE (Q3188334) (← links)
- Theorem provers for substructural logics (Q3510441) (← links)
- Studying provability in implicational intuitionistic logic (Q4916206) (← links)
- A unifying framework for type inhabitation (Q4993331) (← links)
- (Q5020970) (← links)
- Artificial Intelligence and Symbolic Computation (Q5464715) (← links)