Arithmetical Predicates and Function Quantifiers
From MaRDI portal
Publication:3226750
DOI10.2307/1993033zbMATH Open0066.25703OpenAlexW4254213451MaRDI QIDQ3226750FDOQ3226750
Authors: Stephen Cole Kleene 
Publication date: 1955
Full work available at URL: https://doi.org/10.2307/1993033
Cites Work
- Title not available (Why is that?)
- On notation for ordinal numbers
- On the Interpretation of Non-Finitist Proofs--Part I
- Recursively enumerable sets of positive integers and their decision problems
- 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
- A problem concerning the notion of definability
- On definable sets of positive integers
- Hierarchies of number-theoretic predicates
- Über den Zusammenhang der verschiedenen Begriffe der rekursiven Funktion
- Recursive well-orderings
- A set of postulates for the foundation of logic
- Arithmetic with creative definitions by induction
- Einige Betrachtungen über die Begriffe der ω-Widerspruchsfreiheit und der ω-Vollständigkeit
- Title not available (Why is that?)
- Certain predicates defined by induction schemata
- Die Definition durch vollständige Induktion
Cited In (35)
- Effective topological spaces. I: A definability theory
- Effective topological spaces. II: A hierarchy
- 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$
- Real recursive functions and their hierarchy
- Hierarchies of number-theoretic predicates
- Classes of Polish spaces under effective Borel isomorphism
- Hyperarithmetical Sets
- A Note on Function Quantification
- Kleene’s Amazing Second Recursion Theorem
- Constructive Versions of Ordinal Number Classes
- Title not available (Why is that?)
- The Forcing Method and the Upper Semilattice of Hyperdegrees
- Some results in the effective descriptive set theory
- A Property of Arithmetic Sets
- Hierarchies in Recursive Function Theory
- La prédicativité
- On a problem of Kleene’s
- The theory of recursive functions, approaching its centennial
- On a Subrecursive Hierarchy and Primitive Recursive Degrees
- Levels of undecidability in rewriting
- Turing oracle machines, online computing, and three displacements in computability theory
- Notation Systems and an Effective Fixed Point Property
- On the ‘definability of definable’ problem of Alfred Tarski, Part II
- Measure-Theoretic Uniformity in Recursion Theory and Set Theory
- Classical descriptive set theory as a refinement of effective descriptive set theory
- Algorithmic complexity for theories of commutative Kleene algebras
- A Recursion-Theoretic Characterization of the Ramified Analytical Hierarchy
- Effective topological spaces. III: Forcing and definability
- On Hierarchies and Systems of Notations
- Recursive nets
- Classifications of Recursive Functions by Means of Hierarchies
- A recursion theoretic characterization of the topological Vaught conjecture in the Zermelo-Fraenkel set theory
This page was built for publication: Arithmetical Predicates and Function Quantifiers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3226750)
