The following pages link to CERES (Q21425):
Displaying 21 items.
- Extraction of expansion trees (Q670704) (← links)
- Extension without cut (Q714731) (← links)
- CERES in higher-order logic (Q716500) (← links)
- CERES: An analysis of Fürstenberg's proof of the infinity of primes (Q944367) (← links)
- On the form of witness terms (Q982183) (← links)
- Describing proofs by short tautologies (Q1023053) (← links)
- Ceres in intuitionistic logic (Q2363201) (← links)
- Schematic refutations of formula schemata (Q2666952) (← links)
- Schematic Cut Elimination and the Ordered Pigeonhole Principle (Q2817924) (← links)
- System Description: GAPT 2.0 (Q2817928) (← links)
- Understanding Resolution Proofs through Herbrand’s Theorem (Q2851942) (← links)
- Herbrand-Confluence (Q2871477) (← links)
- A paramodulation-based calculus for refuting schemata of clause sets defined by rewrite rules (Q2987065) (← links)
- Reducing redundancy in cut-elimination by resolution (Q2987066) (← links)
- A Clausal Approach to Proof Analysis in Second-Order Logic (Q3605531) (← links)
- The problem of proof identity, and why computer scientists should care about Hilbert's 24th problem (Q5204803) (← links)
- Complexity of translations from resolution to sequent calculus (Q5236549) (← links)
- A Tableaux-Based Decision Procedure for Multi-parameter Propositional Schemata (Q5495914) (← links)
- Logic for Programming, Artificial Intelligence, and Reasoning (Q5705944) (← links)
- System Description: The Proof Transformation System CERES (Q5747781) (← links)
- Proof Transformation by CERES (Q5756761) (← links)
