Cut-elimination: experiments with CERES
From MaRDI portal
Recommendations
Cited in
(22)- The computational content of arithmetical proofs
- Herbrand's theorem as higher order recursion
- Physics and proof theory
- Cut-elimination: syntax and semantics
- Ceres in intuitionistic logic
- Schematic cut elimination and the ordered pigeonhole principle
- Reducing redundancy in cut-elimination by resolution
- Fast cut-elimination by CERES
- Cut-elimination and proof schemata
- A Clausal Approach to Proof Analysis in Second-Order Logic
- Expansion trees with cut
- Herbrand Sequent Extraction
- Cut Elimination for First Order Gödel Logic by Hyperclause Resolution
- CERES in many-valued logics
- System Description: The Proof Transformation System CERES
- Proof Transformation by CERES
- CERES for first-order schemata
- Methods of cut-elimination
- Extraction of expansion trees
- CERES in higher-order logic
- CERES: An analysis of Fürstenberg's proof of the infinity of primes
- On the form of witness terms
This page was built for publication: Cut-elimination: experiments with CERES
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5705944)