Fast-Collapsing Theories

Studia Logica (1):1-21 (2013)

Abstract

Reinhardt’s conjecture, a formalization of the statement that a truthful knowing machine can know its own truthfulness and mechanicalness, was proved by Carlson using sophisticated structural results about the ordinals and transfinite induction just beyond the first epsilon number. We prove a weaker version of the conjecture, by elementary methods and transfinite induction up to a smaller ordinal

Analytics

Added to PP
2013-11-14

Downloads
364 (#29,230)

6 months
27 (#33,573)

Historical graph of downloads
How can I increase my downloads?

Similar books and articles

A Machine That Knows Its Own Code.Samuel A. Alexander - 2014 - Studia Logica 102 (3):567-576.
A Remark on Martin's Conjecture.Su Gao - 2001 - Journal of Symbolic Logic 66 (1):401-406.
On the Strong Martin Conjecture.Masanori Itai - 1991 - Journal of Symbolic Logic 56 (3):862-875.
Kueker's Conjecture for Stable Theories.Ehud Hrushovski - 1989 - Journal of Symbolic Logic 54 (1):207-220.
Axiomatizing Kripke’s Theory of Truth.Volker Halbach & Leon Horsten - 2006 - Journal of Symbolic Logic 71 (2):677 - 712.
A Strategy for Assessing Closure.Peter Murphy - 2006 - Erkenntnis 65 (3):365 - 383.
A Refutation of Pure Conjecture.Timothy Cleveland - 1997 - Journal for General Philosophy of Science / Zeitschrift für Allgemeine Wissenschaftstheorie 28 (1):55-81.
Practical Certainty and Cosmological Conjectures.Nicholas Maxwell - 2005 - In Michael Rahnfeld (ed.), Is there Certain Knowledge? Leipziger Universitätsverlag.
On Downey's Conjecture.Marat M. Arslanov, Iskander Sh Kalimullin & Steffen Lempp - 2010 - Journal of Symbolic Logic 75 (2):401-441.
Wittgenstein and Strong Mathematical Verificationism.Cyrus Panjvani - 2006 - Philosophical Quarterly 56 (224):406–425.