Hierarchies of number-theoretic predicates
From MaRDI portal
Publication:3226751
DOI10.1090/S0002-9904-1955-09896-3zbMath0066.25901MaRDI QIDQ3226751
Publication date: 1955
Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)
Related Items
A complete classification of the Δ₂¹-functions, Kleene's Amazing Second Recursion Theorem, Some results in the effective descriptive set theory, Degrees of unsolvability of constructible sets of integers, Effective topological spaces. III: Forcing and definability, Definability in the monadic second-order theory of successor, LUZIN’S (N) AND RANDOMNESS REFLECTION, Abstract Computability and Invariant Definability, Hierarchies over recursive well-orderings, La prédicativité, Systems of predicative analysis, Extensions of the constructive ordinals, The next admissible set, Levels of undecidability in rewriting, Notes on overt choice, Classes of Polish spaces under effective Borel isomorphism, The classical and the ω-complete arithmetic, Hierarchies of Effective Descriptive Set Theory, A Hierarchy Based on a Type Two Object, Measure-theoretic construction of incomparable hyperdegrees, Logical reflection and formalism, Classical descriptive set theory as a refinement of effective descriptive set theory, Constructive definition of certain analytic sets of numbers, Parametrization over inductive relations of a bounded number of variables, On a problem of Kleene’s, On predicates expressible in the $1$-function quantifier forms in Kleene Hierarchy with free variables of type $2$, Computability and Recursion, Measure-Theoretic Uniformity in Recursion Theory and Set Theory, Independence friendly logic with classical negation via flattening is a second-order logic with weak dependencies, On Minimal and Almost-Minimal Systems of Notations, Hierarchies in Recursive Function Theory, Hyperarithmetical Sets, The Game Quantifier, A new concept of predicative truth and definability, On the Equimorphism Types of Linear Orderings, AN APPLICATION OF RECURSION THEORY TO ANALYSIS, Arithmetical Predicates and Function Quantifiers, Kleene’s Amazing Second Recursion Theorem, INDECOMPOSABLE LINEAR ORDERINGS AND HYPERARITHMETIC ANALYSIS, Nonlinear phenomena in spaces of algorithms, A Note on Function Quantification, Turing oracle machines, online computing, and three displacements in computability theory, The Class of Recursive Functions, Functional interpretation and inductive definitions, Index sets in computable analysis, Index sets for \(\Pi^0_1\) classes, Extending partial orders to dense linear orders, Recursive Functions Over Well Ordered Partial Orderings, On the notational independence of various hierarchies of degrees of unsolvability, Constructive Versions of Ordinal Number Classes, SEARCHING FOR AN ANALOGUE OF ATR0 IN THE WEIHRAUCH LATTICE, Classifications of Recursive Functions by Means of Hierarchies, Effective topological spaces. I: A definability theory, The theory of recursive functions, approaching its centennial, An introduction to hyperarithmetical functions, Unnamed Item, La théorie des fonctions récursives et ses applications. (Exposé d'information générale), Effectively closed sets and graphs of computable real functions., Forcing and reductibilities. II. Forcing in fragments of analysis, Effective topological spaces. II: A hierarchy, THE PREHISTORY OF THE SUBSYSTEMS OF SECOND-ORDER ARITHMETIC
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- General recursive functions of natural numbers
- The upper semi-lattice of degrees of recursive unsolvability
- Arithmetical Predicates and Function Quantifiers
- Recursive well-orderings
- Einige Betrachtungen über die Begriffe der ω-Widerspruchsfreiheit und der ω-Vollständigkeit
- An Unsolvable Problem of Elementary Number Theory
- On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction
- The constructive second number class
- On notation for ordinal numbers
- Systems of Logic Based on Ordinals†
- On definable sets of positive integers
- On the Interpretation of Non-Finitist Proofs--Part I
- On the Forms of the Predicates in the Theory of Constructive Ordinals
- Recursive Predicates and Quantifiers
- Recursively enumerable sets of positive integers and their decision problems
