History and Philosophy of Logic 41 (3):281-290 (2020)

Authors
Stefan Neuwirth
Université de Franche-Comté
Abstract
We present a manuscript of Paul Lorenzen that provides a proof of consistency for elementary number theory as an application of the construction of the free countably complete pseudocomplemented semilattice over a preordered set. This manuscript rests in the Oskar-Becker-Nachlass at the Philosophisches Archiv of Universität Konstanz, file OB 5-3b-5. It has probably been written between March and May 1944. We also compare this proof to Gentzen's and Novikov's, and provide a translation of the manuscript.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
ISBN(s)
DOI 10.1080/01445340.2020.1752034
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 65,740
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

From Frege to Gödel.Jean van Heijenoort - 1968 - Philosophy of Science 35 (1):72-72.
Die Widerspruchsfreiheit der Reinen Zahlentheorie.Gerhard Gentzen - 1936 - Journal of Symbolic Logic 1 (2):75-75.
The Theory of Representations for Boolean Algebras.M. H. Stone - 1936 - Journal of Symbolic Logic 1 (3):118-119.

View all 17 references / Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

On the Philosophical Significance of Consistency Proofs.Michael D. Resnik - 1974 - Journal of Philosophical Logic 3 (1/2):133 - 147.
On the Original Gentzen Consistency Proof for Number Theory.Manfred Szabo - 1970 - In A. Kino, John Myhill & Richard Eugene Vesley (eds.), Intuitionism and Proof Theory. Amsterdam: North-Holland Pub. Co.. pp. 409.
A Simple Proof That Super-Consistency Implies Cut Elimination.Gilles Dowek & Olivier Hermant - 2012 - Notre Dame Journal of Formal Logic 53 (4):439-456.
Saturation and Σ₂-Transfer for ERNA.Chris Impens - 2009 - Journal of Symbolic Logic 74 (3):901-913.
Probability in Logic. [REVIEW]R. A. A. - 1957 - Review of Metaphysics 11 (2):348-348.
Perfect Trees and Elementary Embeddings.Sy-David Friedman & Katherine Thompson - 2008 - Journal of Symbolic Logic 73 (3):906-918.
Short Proofs for Slow Consistency.Anton Freund & Fedor Pakhomov - 2020 - Notre Dame Journal of Formal Logic 61 (1):31-49.

Analytics

Added to PP index
2020-06-13

Total views
9 ( #933,746 of 2,462,951 )

Recent downloads (6 months)
1 ( #449,363 of 2,462,951 )

How can I increase my downloads?

Downloads

My notes