Extraction of expansion trees
From MaRDI portal
Publication:670704
Recommendations
Cites work
- scientific article; zbMATH DE number 3871342 (Why is no real title available?)
- scientific article; zbMATH DE number 4033738 (Why is no real title available?)
- scientific article; zbMATH DE number 627412 (Why is no real title available?)
- A compact representation of proofs
- CERES in higher-order logic
- Cut-elimination and redundancy-elimination by resolution
- Cut-elimination: syntax and semantics
- Expansion trees with cut
- Herbrand Sequent Extraction
- Logic for Programming, Artificial Intelligence, and Reasoning
- Methods of cut-elimination
- On the Infinitude of Primes
- Program extraction from normalization proofs
- Proof Transformation by CERES
- Refined program extraction from classical proofs
- System description: GAPT 2.0
- Topological dynamics and combinatorial number theory
- Towards a clausal analysis of cut-elimination
- Understanding Resolution Proofs through Herbrand’s Theorem
- Untersuchungen über das logische Schliessen. II
- ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES
Cited in
(5)
This page was built for publication: Extraction of expansion trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q670704)