Logic for Programming, Artificial Intelligence, and Reasoning
From MaRDI portal
Publication:5705944
DOI10.1007/b106931zbMath1108.03305MaRDI QIDQ5705944
Clemens Richter, Hendrik Spohr, Stefan Hetzl, Matthias Baaz, Alexander Leitsch
Publication date: 10 November 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b106931
03B35: Mechanization of proofs and logical operations
03F05: Cut-elimination and normal-form theorems
Related Items
Expansion trees with cut, Herbrand Sequent Extraction, System Description: The Proof Transformation System CERES, 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, The computational content of arithmetical proofs, Herbrand's theorem as higher order recursion, Physics and proof theory, Ceres in intuitionistic logic, Cut-Elimination and Proof Schemata
Uses Software