Recommendations
Cited in
(38)- Don't eliminate cut
- First-order interpolation derived from propositional interpolation
- Simulating strong practical proof systems with extended resolution
- Hybrid-logical reasoning in the Smarties and Sally-Anne tasks
- Cut-elimination: syntax and semantics
- On interpolation in automated theorem proving
- Ceres in intuitionistic logic
- Schematic refutations of formula schemata
- Craig interpolation with clausal first-order tableaux
- Schematic cut elimination and the ordered pigeonhole principle
- On the convergence of reduction-based and model-based methods in proof theory
- Reducing redundancy in cut-elimination by resolution
- Fast cut-elimination by CERES
- Cutting Out Continuations
- A Clausal Approach to Proof Analysis in Second-Order Logic
- scientific article; zbMATH DE number 2006630 (Why is no real title available?)
- scientific article; zbMATH DE number 1471986 (Why is no real title available?)
- The elimination of atomic cuts and the semishortening property for Gentzen's sequent calculus with equality
- scientific article; zbMATH DE number 7580067 (Why is no real title available?)
- PROOF-THEORETIC ANALYSIS OF THE QUANTIFIED ARGUMENT CALCULUS
- Complexity of translations from resolution to sequent calculus
- Cut Elimination In Situ
- Cut Elimination for First Order Gödel Logic by Hyperclause Resolution
- Logic for Programming, Artificial Intelligence, and Reasoning
- Logic for Programming, Artificial Intelligence, and Reasoning
- Proof Transformation by CERES
- CERES for first-order schemata
- Effective Skolemization
- Analytic Non-Labelled Proof-Systems for Hybrid Logic: Overview and a couple of striking facts
- The logicality of equality
- Extraction of expansion trees
- Efficient interpolation beyond cut-free proofs: admissible cuts and optimized extraction
- Extracting Herbrand systems from refutation schemata
- Herbrand analyses in geometry: a case study
- On the completeness of interpolation algorithms
- Herbrand's theorem in inductive proofs
- Epsilon calculus provides shorter cut-free proofs
- A complete tableau system for basic hybrid logic with propositional quantification
This page was built for publication: Methods of cut-elimination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q609451)