On the Forms of the Predicates in the Theory of Constructive Ordinals (Second Paper)
From MaRDI portal
Publication:3228608
DOI10.2307/2372632zbMath0067.25203OpenAlexW2315610131WikidataQ29041501 ScholiaQ29041501MaRDI QIDQ3228608
Publication date: 1955
Published in: American Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2372632
Related Items (61)
A complete classification of the Δ₂¹-functions ⋮ Kleene's Amazing Second Recursion Theorem ⋮ Some results in the effective descriptive set theory ⋮ Some properties of $\sum\nolimits_1^1$- and $\prod\nolimits_1^1$-sets in $N^N $ ⋮ Relativization of a primitive recursive hierarchy ⋮ Unnamed Item ⋮ Π11 Sets, ω-Sets, and metacompleteness ⋮ Degrees of unsolvability of constructible sets of integers ⋮ Non-uniqueness at ω2 in Kleene'sO ⋮ Fragments of Kripke-Platek set theory and the metamathematics of \(\alpha \)-recursion theory ⋮ AN INTRODUCTION TO THE SCOTT COMPLEXITY OF COUNTABLE STRUCTURES AND A SURVEY OF RECENT RESULTS ⋮ Parsimony hierarchies for inductive inference ⋮ The countable admissible ordinal equivalence relation ⋮ The equivalence of determinacy and iterated sharps ⋮ Borel ideals vs. Borel sets of countable relations and trees ⋮ Abstract Computability and Invariant Definability ⋮ The Mathematical Work of S.C.Kleene ⋮ On analytic well-orderings ⋮ Every recursive linear ordering has a copy in DTIME-SPACE(n,log(n)) ⋮ Hyperanalytic Predicates ⋮ Systems of predicative analysis ⋮ Extensions of the constructive ordinals ⋮ The Forcing Method and the Upper Semilattice of Hyperdegrees ⋮ Unnamed Item ⋮ Natural well-orderings ⋮ Recursive Pseudo-Well-Orderings ⋮ Classes of Polish spaces under effective Borel isomorphism ⋮ The classical and the ω-complete arithmetic ⋮ Inductive definability: Measure and category ⋮ Learning with ordinal-bounded memory from positive data ⋮ Mathematical significance of consistency proofs ⋮ Constructive definition of certain analytic sets of numbers ⋮ Determinacy and the sharp function on objects of type k ⋮ Parametrization over inductive relations of a bounded number of variables ⋮ Computability and Recursion ⋮ Measure-Theoretic Uniformity in Recursion Theory and Set Theory ⋮ Degrees of models ⋮ Avoiding uniformity in the \(\Delta_2^0\) enumeration degrees ⋮ NOMINALISTIC ORDINALS, RECURSION ON HIGHER TYPES, AND FINITISM ⋮ Hyperarithmetical Sets ⋮ Fast growing functions based on Ramsey theorems ⋮ Transfinite recursive progressions of axiomatic theories ⋮ Incompleteness along paths in progressions of theories ⋮ Determinacy and the sharp function on the reals ⋮ Barwise: Infinitary Logic and Admissible Sets ⋮ Learning correction grammars ⋮ Rice and Rice-Shapiro Theorems for transfinite correction grammars ⋮ Kleene’s Amazing Second Recursion Theorem ⋮ Determinacy and the sharp function on the reals ⋮ A Note on Function Quantification ⋮ Infinite time extensions of Kleene's \({\mathcal O}\) ⋮ Turing oracle machines, online computing, and three displacements in computability theory ⋮ An example of general recursive well-ordering which is not primitive recursive ⋮ On a Subrecursive Hierarchy and Primitive Recursive Degrees ⋮ On the notational independence of various hierarchies of degrees of unsolvability ⋮ Classifications of Recursive Functions by Means of Hierarchies ⋮ The theory of recursive functions, approaching its centennial ⋮ Alternative proof of a theorem of Kleene ⋮ Metarecursively enumerable sets and admissible ordinals ⋮ Unnamed Item ⋮ Metarecursive sets
This page was built for publication: On the Forms of the Predicates in the Theory of Constructive Ordinals (Second Paper)
