Cut-elimination: syntax and semantics
From MaRDI portal
Publication:2259012
DOI10.1007/S11225-014-9563-2zbMATH Open1354.03086OpenAlexW1992495792MaRDI QIDQ2259012FDOQ2259012
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
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 (4)
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 π π
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)