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

DOI10.1016/J.TCS.2008.02.043zbMATH Open1181.68264OpenAlexW2171522258MaRDI QIDQ944367FDOQ944367

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

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

Recommendations

• scientific article; zbMATH DE number 7178366
• Logic for Programming, Artificial Intelligence, and Reasoning
• CERES for first-order schemata
• System Description: The Proof Transformation System CERES
• Logic for Programming, Artificial Intelligence, and Reasoning

zbMATH Keywords

proof theoryresolutionproof analysiscut-eliminationcut-elimination method

Mathematics Subject Classification ID

Cites Work

• Subsystems of second order arithmetic
• Title not available (Why is that?)
• On the Infinitude of Primes
• Title not available (Why is that?)
• Herbrand-Analysen zweier Beweise des Satzes von Roth: Polynomiale Anzahlschranken
• Title not available (Why is that?)
• Title not available (Why is that?)
• A new deconstructive logic: linear logic
• Towards a clausal analysis of cut-elimination
• Logic for Programming, Artificial Intelligence, and Reasoning
• Proof Transformation by CERES
• Cut-elimination and redundancy-elimination by resolution
• Cut normal forms and proof complexity
• Decision-algorithms for the associativity of latin squares

Cited In (14)

• Title not available (Why is that?)
• System Description: The Proof Transformation System CERES
• Describing proofs by short tautologies
• System Description: GAPT 2.0
• On the form of witness terms
• A Tableaux-Based Decision Procedure for Multi-parameter Propositional Schemata
• Ceres in intuitionistic logic
• Schematic Cut Elimination and the Ordered Pigeonhole Principle
• Schematic refutations of formula schemata
• Herbrand Sequent Extraction
• A Clausal Approach to Proof Analysis in Second-Order Logic
• Cut-Elimination and Proof Schemata
• The problem of proof identity, and why computer scientists should care about Hilbert's 24th problem
• CERES in higher-order logic

Uses Software

• CERES

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q944367)