Complexity Bounds for Some Finite Forms of Kruskal's Theorem

Bulletin of Symbolic Logic 10 (4):588-590 (2004)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,616

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Proof-theoretic investigations on Kruskal's theorem.Michael Rathjen & Andreas Weiermann - 1993 - Annals of Pure and Applied Logic 60 (1):49-88.
Conway–Kochen and the Finite Precision Loophole.Ronnie Hermens - 2014 - Foundations of Physics 44 (10):1038-1048.
How to define a linear order on finite models.Lauri Hella, Phokion G. Kolaitis & Kerkko Luosto - 1997 - Annals of Pure and Applied Logic 87 (3):241-267.
More about uniform upper Bounds on ideals of Turing degrees.Harold T. Hodes - 1983 - Journal of Symbolic Logic 48 (2):441-457.
Uniform bounds for the Iitaka fibration.Gabriele Di Cerbo - 2014 - Annali della Scuola Normale Superiore di Pisa- Classe di Scienze 13 (4):1133-1143.
Topological framework for finite injury.Kyriakos Kontostathis - 1992 - Mathematical Logic Quarterly 38 (1):189-195.
A Gödel Theorem on Network Complexity Lower Bounds.C. P. Schnorr - 1986 - Mathematical Logic Quarterly 32 (19‐24):377-384.
Phase transitions for Gödel incompleteness.Andreas Weiermann - 2009 - Annals of Pure and Applied Logic 157 (2-3):281-296.

Analytics

Added to PP
2015-02-06

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

The Bachmann-Howard Structure in Terms of Σ1-Elementarity.Gunnar Wilken - 2006 - Archive for Mathematical Logic 45 (7):807-829.

Add more citations

References found in this work

No references found.

Add more references