Fast-Collapsing Theories

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

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

Author's Profile

Samuel Allen Alexander
Ohio State University (PhD)

Analytics

Added to PP
2013-11-14

Downloads
542 (#26,960)

6 months
89 (#41,364)

Historical graph of downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.
How can I increase my downloads?