A Reverse Analysis of the Sylvester-Gallai Theorem

Notre Dame Journal of Formal Logic 50 (3):245-260 (2009)
  Copy   BIBTEX

Abstract

Reverse analyses of three proofs of the Sylvester-Gallai theorem lead to three different and incompatible axiom systems. In particular, we show that proofs respecting the purity of the method, using only notions considered to be part of the statement of the theorem to be proved, are not always the simplest, as they may require axioms which proofs using extraneous predicates do not rely upon

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,069

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Reverse mathematics and Isbell's zig‐zag theorem.Takashi Sato - 2014 - Mathematical Logic Quarterly 60 (4-5):348-353.
The Thin Set Theorem for Pairs Implies DNR.Brian Rice - 2015 - Notre Dame Journal of Formal Logic 56 (4):595-601.
Classifying Dini's Theorem.Josef Berger & Peter Schuster - 2006 - Notre Dame Journal of Formal Logic 47 (2):253-262.
Ontological Purity for Formal Proofs.Robin Martinot - 2024 - Review of Symbolic Logic 17 (2):395-434.
Complex analysis in subsystems of second order arithmetic.Keita Yokoyama - 2007 - Archive for Mathematical Logic 46 (1):15-35.
Reverse mathematics: proofs from the inside out.John Stillwell - 2018 - Princeton: Princeton University Press.
Uniform Short Proofs for Classical Theorems.Kees Doets - 2001 - Notre Dame Journal of Formal Logic 42 (2):121-127.

Analytics

Added to PP
2010-09-13

Downloads
30 (#550,560)

6 months
10 (#308,654)

Historical graph of downloads
How can I increase my downloads?