Cut-elimination: syntax and semantics
From MaRDI portal
Publication:2259012
DOI10.1007/S11225-014-9563-2zbMATH Open1354.03086OpenAlexW1992495792MaRDI QIDQ2259012FDOQ2259012
Authors: Matthias Baaz, Alexander Leitsch 
Publication date: 27 February 2015
Published in: Studia Logica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11225-014-9563-2
Recommendations
- Towards a clausal analysis of cut-elimination
- Logic for Programming, Artificial Intelligence, and Reasoning
- CERES in higher-order logic
- Methods of cut-elimination
- Proof Transformation by CERES
- Reducing redundancy in cut-elimination by resolution
- Logic for Programming, Artificial Intelligence, and Reasoning
- System Description: The Proof Transformation System CERES
- Ceres in intuitionistic logic
- Cut Elimination for First Order Gödel Logic by Hyperclause Resolution
Cites Work
- Title not available (Why is that?)
- Untersuchungen über das logische Schliessen. II
- A Machine-Oriented Logic Based on the Resolution Principle
- Proof theory
- The number of proof lines and the size of proofs in first order logic
- On the complexity of proof deskolemization
- Title not available (Why is that?)
- Methods of cut-elimination
- Towards a clausal analysis of cut-elimination
- Cut-elimination and redundancy-elimination by resolution
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (8)
- Cut Elimination for First Order Gödel Logic by Hyperclause Resolution
- Methods of cut-elimination
- Ceres in intuitionistic logic
- Logic for Programming, Artificial Intelligence, and Reasoning
- Towards a semantic characterization of cut-elimination
- The role of quantifier alternations in cut elimination
- Extraction of expansion trees
- CERES in higher-order logic
This page was built for publication: Cut-elimination: syntax and semantics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2259012)
