Arithmetical Predicates and Function Quantifiers
From MaRDI portal
Publication:3226750
DOI10.2307/1993033zbMath0066.25703OpenAlexW4254213451MaRDI QIDQ3226750
Publication date: 1955
Full work available at URL: https://doi.org/10.2307/1993033
Related Items
A complete classification of the Δ₂¹-functions, On the ‘definability of definable’ problem of Alfred Tarski, Part II, Some results in the effective descriptive set theory, Effective topological spaces. III: Forcing and definability, La prédicativité, The Forcing Method and the Upper Semilattice of Hyperdegrees, Hierarchies of number-theoretic predicates, A recursion theoretic characterization of the Topological Vaught Conjecture in the Zermelo‐Fraenkel set theory, Levels of undecidability in rewriting, Classes of Polish spaces under effective Borel isomorphism, Classical descriptive set theory as a refinement of effective descriptive set theory, On a problem of Kleene’s, On predicates expressible in the $1$-function quantifier forms in Kleene Hierarchy with free variables of type $2$, Measure-Theoretic Uniformity in Recursion Theory and Set Theory, A Recursion-Theoretic Characterization of the Ramified Analytical Hierarchy, On Minimal and Almost-Minimal Systems of Notations, Hierarchies in Recursive Function Theory, Notation Systems and an Effective Fixed Point Property, Hyperarithmetical Sets, On Hierarchies and Systems of Notations, A Property of Arithmetic Sets, Real recursive functions and their hierarchy, Kleene’s Amazing Second Recursion Theorem, Recursive nets, A Note on Function Quantification, Turing oracle machines, online computing, and three displacements in computability theory, On a Subrecursive Hierarchy and Primitive Recursive Degrees, Recursive Functions Over Well Ordered Partial Orderings, Constructive Versions of Ordinal Number Classes, Classifications of Recursive Functions by Means of Hierarchies, Effective topological spaces. I: A definability theory, The theory of recursive functions, approaching its centennial, Unnamed Item, Effective topological spaces. II: A hierarchy
Cites Work
- Unnamed Item
- Unnamed Item
- A set of postulates for the foundation of logic
- Über den Zusammenhang der verschiedenen Begriffe der rekursiven Funktion
- The upper semi-lattice of degrees of recursive unsolvability
- Hierarchies of number-theoretic predicates
- Recursive well-orderings
- Einige Betrachtungen über die Begriffe der ω-Widerspruchsfreiheit und der ω-Vollständigkeit
- On notation for ordinal numbers
- Die Definition durch vollständige Induktion
- A problem concerning the notion of definability
- On definable sets of positive integers
- On the Interpretation of Non-Finitist Proofs--Part I
- Certain predicates defined by induction schemata
- Arithmetic with creative definitions by induction
- 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
