Cut-elimination: syntax and semantics
From MaRDI portal
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
- scientific article; zbMATH DE number 440474 (Why is no real title available?)
- scientific article; zbMATH DE number 4033738 (Why is no real title available?)
- scientific article; zbMATH DE number 976360 (Why is no real title available?)
- scientific article; zbMATH DE number 3327279 (Why is no real title available?)
- A Machine-Oriented Logic Based on the Resolution Principle
- Cut-elimination and redundancy-elimination by resolution
- Methods of cut-elimination
- On the complexity of proof deskolemization
- Proof theory
- The number of proof lines and the size of proofs in first order logic
- Towards a clausal analysis of cut-elimination
- Untersuchungen über das logische Schliessen. II
Cited in
(11)- Ceres in intuitionistic logic
- On the convergence of reduction-based and model-based methods in proof theory
- Reducing redundancy in cut-elimination by resolution
- Towards a semantic characterization of cut-elimination
- Extraction of expansion trees
- Methods of cut-elimination
- Cut Elimination for First Order Gödel Logic by Hyperclause Resolution
- Logic for Programming, Artificial Intelligence, and Reasoning
- CERES in higher-order logic
- CERES for first-order schemata
- The role of quantifier alternations in cut elimination
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)
