Phase transition thresholds for some Friedman-style independence results

Mathematical Logic Quarterly 53 (1):4-18 (2007)
  Copy   BIBTEX

Abstract

We classify the phase transition thresholds from provability to unprovability for certain Friedman-style miniaturizations of Kruskal's Theorem and Higman's Lemma. In addition we prove a new and unexpected phase transition result for ε0. Motivated by renormalization and universality issues from statistical physics we finally state a universality hypothesis

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,349

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

An application of graphical enumeration to PA.Andreas Weiermann - 2003 - Journal of Symbolic Logic 68 (1):5-16.
Some independence results for peano arithmetic.J. B. Paris - 1978 - Journal of Symbolic Logic 43 (4):725-731.
A Remark on Independence Results for Sharply Bounded Arithmetic.Jan Johannsen - 1998 - Mathematical Logic Quarterly 44 (4):568-570.
Hyperfinite law of large numbers.Yeneng Sun - 1996 - Bulletin of Symbolic Logic 2 (2):189-198.
Primitive independence results.Harvey M. Friedman - 2003 - Journal of Mathematical Logic 3 (1):67-83.
Discouraging results for ultraimaginary independence theory.Itay Ben-Yaacov - 2003 - Journal of Symbolic Logic 68 (3):846-850.
Functoroids and ptykoids.J. R. G. Catlow - 1995 - Archive for Mathematical Logic 33 (6):413-425.
Independence results.Saharon Shelah - 1980 - Journal of Symbolic Logic 45 (3):563-573.
A theory for log-space and NLIN versus co-NLIN.Chris Pollett - 2003 - Journal of Symbolic Logic 68 (4):1082-1090.
Bounded arithmetic, propositional logic, and complexity theory.Jan Krajíček - 1995 - New York, NY, USA: Cambridge University Press.

Analytics

Added to PP
2014-01-16

Downloads
16 (#880,136)

6 months
3 (#1,023,809)

Historical graph of downloads
How can I increase my downloads?