CERES
From MaRDI portal
Software:21425
swMATH9442MaRDI QIDQ21425FDOQ21425
Author name not available (Why is that?)
Cited In (21)
- Understanding Resolution Proofs through Herbrand’s Theorem
- System Description: The Proof Transformation System CERES
- Extension without cut
- Describing proofs by short tautologies
- On the form of witness terms
- Reducing redundancy in cut-elimination by resolution
- CERES: An analysis of Fürstenberg's proof of the infinity of primes
- Schematic cut elimination and the ordered pigeonhole principle
- Logic for Programming, Artificial Intelligence, and Reasoning
- Complexity of translations from resolution to sequent calculus
- Ceres in intuitionistic logic
- A tableaux-based decision procedure for multi-parameter propositional schemata
- Herbrand-confluence
- A paramodulation-based calculus for refuting schemata of clause sets defined by rewrite rules
- Schematic refutations of formula schemata
- A Clausal Approach to Proof Analysis in Second-Order Logic
- The problem of proof identity, and why computer scientists should care about Hilbert's 24th problem
- Proof Transformation by CERES
- Extraction of expansion trees
- CERES in higher-order logic
- System description: GAPT 2.0
This page was built for software: CERES
