Switch to: References

Add citations

You must login to add citations.
  1. Analytic combinatorics, proof-theoretic ordinals, and phase transitions for independence results.Andreas Weiermann - 2005 - Annals of Pure and Applied Logic 136 (1):189-218.
    This paper is intended to give for a general mathematical audience a survey of intriguing connections between analytic combinatorics and logic. We define the ordinals below ε0 in non-logical terms and we survey a selection of recent results about the analytic combinatorics of these ordinals. Using a versatile and flexible compression technique we give applications to phase transitions for independence results, Hilbert’s basis theorem, local number theory, Ramsey theory, Hydra games, and Goodstein sequences. We discuss briefly universality and renormalization issues (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  • Well-partial-orderings and the big Veblen number.Jeroen Van der Meeren, Michael Rathjen & Andreas Weiermann - 2015 - Archive for Mathematical Logic 54 (1-2):193-230.
    In this article we characterize a countable ordinal known as the big Veblen number in terms of natural well-partially ordered tree-like structures. To this end, we consider generalized trees where the immediate subtrees are grouped in pairs with address-like objects. Motivated by natural ordering properties, extracted from the standard notations for the big Veblen number, we investigate different choices for embeddability relations on the generalized trees. We observe that for addresses using one finite sequence only, the embeddability coincides with the (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  • Associative Ordinal Functions, Well Partial Orderings and a Problem of Skolem.Diana Schmidt - 1978 - Mathematical Logic Quarterly 24 (19-24):297-302.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • A Mathematical Commitment Without Computational Strength.Anton Freund - 2022 - Review of Symbolic Logic 15 (4):880-906.
    We present a new manifestation of Gödel’s second incompleteness theorem and discuss its foundational significance, in particular with respect to Hilbert’s program. Specifically, we consider a proper extension of Peano arithmetic ( $\mathbf {PA}$ ) by a mathematically meaningful axiom scheme that consists of $\Sigma ^0_2$ -sentences. These sentences assert that each computably enumerable ( $\Sigma ^0_1$ -definable without parameters) property of finite binary trees has a finite basis. Since this fact entails the existence of polynomial time algorithms, it is (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
    		•