Switch to: References

Add citations

You must login to add citations.
  1. Predicative functionals and an interpretation of ⌢ID.Jeremy Avigad - 1998 - Annals of Pure and Applied Logic 92 (1):1-34.
    In 1958 Gödel published his Dialectica interpretation, which reduces classical arithmetic to a quantifier-free theory T axiomatizing the primitive recursive functionals of finite type. Here we extend Gödel's T to theories Pn of “predicative” functionals, which are defined using Martin-Löf's universes of transfinite types. We then extend Gödel's interpretation to the theories of arithmetic inductive definitions IDn, so that each IDn is interpreted in the corresponding Pn. Since the strengths of the theories IDn are cofinal in the ordinal Γ0, as (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Proof-theoretic investigations on Kruskal's theorem.Michael Rathjen & Andreas Weiermann - 1993 - Annals of Pure and Applied Logic 60 (1):49-88.
    In this paper we calibrate the exact proof-theoretic strength of Kruskal's theorem, thereby giving, in some sense, the most elementary proof of Kruskal's theorem. Furthermore, these investigations give rise to ordinal analyses of restricted bar induction.
    Download  
     
    Export citation  
     
    Bookmark   34 citations  
  • Reflecting on the 3x+1 Mystery. Outline of a Scenario - Improbable or Realistic ?Edward G. Belaga - manuscript
    Guessing the outcome of iterations of even most simple arithmetical functions could be an extremely hazardous experience. Not less harder, if at all possible, might be to prove the veracity of even a "sure" guess concerning iterations : this is the case of the famous 3x+1 conjecture. Our purpose here is to study and conceptualize some intuitive insights related to the ultimate (un)solvability of this conjecture.
    Download  
     
    Export citation  
     
    Bookmark  
  • Mathematical Infinity, Its Inventors, Discoverers, Detractors, Defenders, Masters, Victims, Users, and Spectators.Edward G. Belaga - manuscript
    "The definitive clarification of the nature of the infinite has become necessary, not merely for the special interests of the individual sciences, but rather for the honour of the human understanding itself. The infinite has always stirred the emotions of mankind more deeply than any other question; the infinite has stimulated and fertilized reason as few other ideas have ; but also the infinite, more than other notion, is in need of clarification." (David Hilbert 1925).
    Download  
     
    Export citation  
     
    Bookmark  
  • Finite Axiomatizability of Transitive Modal Logics of Finite Depth and Width with Respect to Proper-Successor-Equivalence.Yan Zhang & X. U. Ming - forthcoming - Review of Symbolic Logic:1-14.
    This paper proves the finite axiomatizability of transitive modal logics of finite depth and finite width w.r.t. proper-successor-equivalence. The frame condition of the latter requires, in a rooted transitive frame, a finite upper bound of cardinality for antichains of points with different sets of proper successors. The result generalizes Rybakov’s result of the finite axiomatizability of extensions of$\mathbf {S4}$of finite depth and finite width.
    Download  
     
    Export citation  
     
    Bookmark  
  • Downey, R., Gasarch, W. and Moses, M., The structure.S. D. Friedman, W. G. Handley, S. S. Wainer, A. Joyal, I. Moerdijk, L. Newelski, F. van Engelen & J. van Oosten - 1994 - Annals of Pure and Applied Logic 70 (1):287.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • (1 other version)The Order Types of Termination Orderings on Monadic Terms, Strings and Monadic Terms, Strings and Multisets.Ursula Martin & Elizabeth Scott - 1997 - Journal of Symbolic Logic 62 (2):624-635.
    We consider total well-founded orderings on monadic terms satisfying the replacement and full invariance properties. We show that any such ordering on monadic terms in one variable and two unary function symbols must have order type $\omega, \omega^2$ or $\omega^\omega$. We show that a familiar construction gives rise to continuum many such orderings of order type $\omega$. We construct a new family of such orderings of order type $\omega^2$, and show that there are continuum many of these. We show that (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • (1 other version)The order types of termination orderings on monadic terms, strings and multisets.Ursula Martin & Elizabeth Scott - 1997 - Journal of Symbolic Logic 62 (2):624-635.
    We consider total well-founded orderings on monadic terms satisfying the replacement and full invariance properties. We show that any such ordering on monadic terms in one variable and two unary function symbols must have order typeω,ω2orωω. We show that a familiar construction gives rise to continuum many such orderings of order typeω. We construct a new family of such orderings of order typeω2, and show that there are continuum many of these. We show that there are only four such orderings (...))
    Download  
     
    Export citation  
     
    Bookmark  
  • An intuitionistic proof of Kruskal’s theorem.Wim Veldman - 2004 - Archive for Mathematical Logic 43 (2):215-264.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • The length of an intersection.Christian Delhommé & Maurice Pouzet - 2017 - Mathematical Logic Quarterly 63 (3-4):243-255.
    A poset is well‐partially ordered (WPO) if all its linear extensions are well orders; the supremum of ordered types of these linear extensions is the length, of p. We prove that if the vertex set X is infinite, of cardinality κ, and the ordering ⩽ is the intersection of finitely many well partial orderings of X,, then, letting, with, denote the euclidian division by κ (seen as an initial ordinal) of the length of each corresponding poset: where denotes the least (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Equational derivation vs. computation.W. G. Handley & S. S. Wainer - 1994 - Annals of Pure and Applied Logic 70 (1):17-49.
    Subrecursive hierarchy classifications are used to compare the complexities of recursive functions according to their derivations in a version of Kleene's equation calculus, and their computations by term-rewriting. In each case ordinal bounds are assigned, and it turns out that the respective complexity measures are given by a version of the Fast Growing Hierarchy, and the Slow Growing Hierarchy. Known comparisons between the two hierarchies then provide ordinal trade-offs between derivation and computation. Characteristics of some well-known subrecursive classes are also (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations