Hierarchies of number-theoretic predicates
From MaRDI portal
Publication:3226751
Cites work
- scientific article; zbMATH DE number 3024905 (Why is no real title available?)
- scientific article; zbMATH DE number 3057484 (Why is no real title available?)
- scientific article; zbMATH DE number 3070430 (Why is no real title available?)
- scientific article; zbMATH DE number 3073037 (Why is no real title available?)
- An Unsolvable Problem of Elementary Number Theory
- Arithmetical Predicates and Function Quantifiers
- Einige Betrachtungen über die Begriffe der ω-Widerspruchsfreiheit und der ω-Vollständigkeit
- General recursive functions of natural numbers
- On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction
- On definable sets of positive integers
- On notation for ordinal numbers
- On the Forms of the Predicates in the Theory of Constructive Ordinals
- On the Interpretation of Non-Finitist Proofs--Part I
- Recursive Predicates and Quantifiers
- Recursive well-orderings
- Recursively enumerable sets of positive integers and their decision problems
- Systems of Logic Based on Ordinals†
- The constructive second number class
- The upper semi-lattice of degrees of recursive unsolvability
Cited in
(62)- Definability in the monadic second-order theory of successor
- Searching for an analogue of \(\text{ATR}_0\) in the Weihrauch lattice
- Forcing and reductibilities. II. Forcing in fragments of analysis
- Index sets for ^0_1 classes
- Extending partial orders to dense linear orders
- INDECOMPOSABLE LINEAR ORDERINGS AND HYPERARITHMETIC ANALYSIS
- Effective topological spaces. I: A definability theory
- Effective topological spaces. II: A hierarchy
- An introduction to hyperarithmetical functions
- Logical reflection and formalism
- The Class of Recursive Functions
- Recursive Functions Over Well Ordered Partial Orderings
- On Minimal and Almost-Minimal Systems of Notations
- A complete classification of the Δ₂¹-functions
- On predicates expressible in the $1$-function quantifier forms in Kleene Hierarchy with free variables of type $2$
- Notes on overt choice
- Arithmetical Predicates and Function Quantifiers
- Independence friendly logic with classical negation via flattening is a second-order logic with weak dependencies
- Classes of Polish spaces under effective Borel isomorphism
- Hyperarithmetical Sets
- Kleene's amazing second recursion theorem
- 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
- Index sets in computable analysis
- The classical and the ω-complete arithmetic
- Computability and Recursion
- Constructive Versions of Ordinal Number Classes
- scientific article; zbMATH DE number 3139751 (Why is no real title available?)
- 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é
- On a problem of Kleene’s
- The theory of recursive functions, approaching its centennial
- Constructive definition of certain analytic sets of numbers
- Levels of undecidability in rewriting
- Turing oracle machines, online computing, and three displacements in computability theory
- Iterated priority arguments in descriptive set theory
- Classical descriptive set theory as a refinement of effective descriptive set theory
- Measure-Theoretic Uniformity in Recursion Theory and Set Theory
- A new concept of predicative truth and definability
- Parametrization over inductive relations of a bounded number of variables
- La théorie des fonctions récursives et ses applications. (Exposé d'information générale)
- Effective topological spaces. III: Forcing and definability
- An application of recursion theory to analysis
- The prehistory of the subsystems of second-order arithmetic
- A Hierarchy Based on a Type Two Object
- Nonlinear phenomena in spaces of algorithms
- Classifications of Recursive Functions by Means of Hierarchies
- The Game Quantifier
- Effectively closed sets and graphs of computable real functions.
- On the notational independence of various hierarchies of degrees of unsolvability
- Functional interpretation and inductive definitions
- LUZIN’S (N) AND RANDOMNESS REFLECTION
- Degrees of unsolvability of constructible sets of integers
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)
