Hierarchies of number-theoretic predicates

DOI10.1090/S0002-9904-1955-09896-3zbMATH Open0066.25901MaRDI QIDQ3226751FDOQ3226751

Stephen Cole Kleene

Publication date: 1955

Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

philosophy and foundations of mathematics

Cites Work

• Title not available (Why is that?)
• On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction
• The constructive second number class
• On notation for ordinal numbers
• On the Interpretation of Non-Finitist Proofs--Part I
• Recursively enumerable sets of positive integers and their decision problems
• Systems of Logic Based on Ordinals^†
• On the Forms of the Predicates in the Theory of Constructive Ordinals
• Recursive Predicates and Quantifiers
• The upper semi-lattice of degrees of recursive unsolvability
• On definable sets of positive integers
• Title not available (Why is that?)
• An Unsolvable Problem of Elementary Number Theory
• Arithmetical Predicates and Function Quantifiers
• Recursive well-orderings
• General recursive functions of natural numbers
• Title not available (Why is that?)
• Einige Betrachtungen über die Begriffe der ω-Widerspruchsfreiheit und der ω-Vollständigkeit
• Title not available (Why is that?)

Cited In (62)

• On Minimal and Almost-Minimal Systems of Notations
• Notes on overt choice
• Iterated priority arguments in descriptive set theory
• Forcing and reductibilities. II. Forcing in fragments of analysis
• Index sets for \(\Pi^0_1\) classes
• INDECOMPOSABLE LINEAR ORDERINGS AND HYPERARITHMETIC ANALYSIS
• Extending partial orders to dense linear orders
• An introduction to hyperarithmetical functions
• AN APPLICATION OF RECURSION THEORY TO ANALYSIS
• Effective topological spaces. I: A definability theory
• Effective topological spaces. II: A hierarchy
• Logical reflection and formalism
• The Class of Recursive Functions
• Recursive Functions Over Well Ordered Partial Orderings
• A complete classification of the Δ₂¹-functions
• On predicates expressible in the $1$-function quantifier forms in Kleene Hierarchy with free variables of type $2$
• Arithmetical Predicates and Function Quantifiers
• Classes of Polish spaces under effective Borel isomorphism
• Independence friendly logic with classical negation via flattening is a second-order logic with weak dependencies
• Hyperarithmetical Sets
• A Note on Function Quantification
• Hierarchies of Effective Descriptive Set Theory
• Hierarchies over recursive well-orderings
• Kleene’s Amazing Second Recursion Theorem
• Measure-theoretic construction of incomparable hyperdegrees
• Computability and Recursion
• The classical and the ω-complete arithmetic
• Constructive Versions of Ordinal Number Classes
• Title not available (Why is that?)
• Index sets in computable analysis
• Some results in the effective descriptive set theory
• Extensions of the constructive ordinals
• Abstract Computability and Invariant Definability
• The next admissible set
• Systems of predicative analysis
• On the Equimorphism Types of Linear Orderings
• Hierarchies in Recursive Function Theory
• La prédicativité
• THE PREHISTORY OF THE SUBSYSTEMS OF SECOND-ORDER ARITHMETIC
• On a problem of Kleene’s
• The theory of recursive functions, approaching its centennial
• Constructive definition of certain analytic sets of numbers
• Kleene's Amazing Second Recursion Theorem
• Levels of undecidability in rewriting
• Turing oracle machines, online computing, and three displacements in computability theory
• Measure-Theoretic Uniformity in Recursion Theory and Set Theory
• Classical descriptive set theory as a refinement of effective descriptive set theory
• A new concept of predicative truth and definability
• SEARCHING FOR AN ANALOGUE OF ATR₀ IN THE WEIHRAUCH LATTICE
• La théorie des fonctions récursives et ses applications. (Exposé d'information générale)
• Parametrization over inductive relations of a bounded number of variables
• Effective topological spaces. III: Forcing and definability
• A Hierarchy Based on a Type Two Object
• Nonlinear phenomena in spaces of algorithms
• The Game Quantifier
• Classifications of Recursive Functions by Means of Hierarchies
• On the notational independence of various hierarchies of degrees of unsolvability
• Effectively closed sets and graphs of computable real functions.
• Functional interpretation and inductive definitions
• LUZIN’S (N) AND RANDOMNESS REFLECTION
• Degrees of unsolvability of constructible sets of integers
• Definability in the monadic second-order theory of successor

This page was built for publication: Hierarchies of number-theoretic predicates

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3226751)