The following pages link to (Q4809790):
Displaying 20 items.
- Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs (Q622117) (← links)
- Proof and refutation in MALL as a game (Q636305) (← links)
- Reduction rules for intuitionistic \(\lambda\rho\)-calculus (Q897480) (← links)
- On reduction rules, meaning-as-use, and proof-theoretic semantics (Q1005958) (← links)
- Representing scope in intuitionistic deductions (Q1274448) (← links)
- On the intuitionistic force of classical search (Q1575923) (← links)
- Does reductive proof theory have a viable rationale? (Q1841001) (← links)
- Proof-theoretic reduction as a philosopher's tool (Q1841003) (← links)
- A coinductive approach to proof search through typed lambda-calculi (Q2231698) (← links)
- Notes towards a semantics for proof-search (Q2703721) (← links)
- Structural proof theory. With an appendix by Aarne Ranta (Q2744125) (← links)
- How to optimize proof-search in modal logics (Q3184509) (← links)
- (Q4281464) (← links)
- Proof-terms for classical and intuitionistic resolution (Q4487255) (← links)
- Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs (Q4649731) (← links)
- REDUCTION TECHNIQUES FOR PROVING DECIDABILITY IN LOGICS AND THEIR MEET–COMBINATION (Q5009679) (← links)
- Towards Ludics Programming: Interactive Proof Search (Q5504660) (← links)
- Reductions for non-clausal theorem proving (Q5958754) (← links)
- Semantical analysis of the logic of bunched implications (Q6115849) (← links)
- Reductive logic, proof-search, and coalgebra: a perspective from resource semantics (Q6612799) (← links)
