CERES: An analysis of Fürstenberg's proof of the infinity of primes

DOI10.1016/j.tcs.2008.02.043zbMath1181.68264OpenAlexW2171522258MaRDI QIDQ944367

Alexander Leitsch, Matthias Baaz, Clemens Richter, Hendrik Spohr, Stefan Hetzl

Publication date: 16 September 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.02.043

zbMATH Keywords

proof theoryresolutioncut-eliminationproof analysiscut-elimination method

Mathematics Subject Classification ID

Related Items (14)

Ceres in intuitionistic logic ⋮ Cut-Elimination and Proof Schemata ⋮ Schematic refutations of formula schemata ⋮ Unnamed Item ⋮ System Description: The Proof Transformation System CERES ⋮ On the form of witness terms ⋮ CERES in higher-order logic ⋮ 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 ⋮ Schematic Cut Elimination and the Ordered Pigeonhole Principle ⋮ System Description: GAPT 2.0 ⋮ Describing proofs by short tautologies ⋮ A Tableaux-Based Decision Procedure for Multi-parameter Propositional Schemata ⋮ Herbrand Sequent Extraction

Uses Software

• CERES

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cut normal forms and proof complexity
• Towards a clausal analysis of cut-elimination
• On the Infinitude of Primes
• Herbrand-Analysen zweier Beweise des Satzes von Roth: Polynomiale Anzahlschranken
• A new deconstructive logic: linear logic
• Decision-algorithms for the associativity of latin squares
• Logic for Programming, Artificial Intelligence, and Reasoning
• Proof Transformation by CERES
• Cut-elimination and redundancy-elimination by resolution

This page was built for publication: CERES: An analysis of Fürstenberg's proof of the infinity of primes