Pages that link to "Item:Q3228608"

The following pages link to On the Forms of the Predicates in the Theory of Constructive Ordinals (Second Paper) (Q3228608):

Displaying 50 items.

• Fragments of Kripke-Platek set theory and the metamathematics of \(\alpha \)-recursion theory (Q334991) (← links)
• Learning with ordinal-bounded memory from positive data (Q440010) (← links)
• An example of general recursive well-ordering which is not primitive recursive (Q772781) (← links)
• Parametrization over inductive relations of a bounded number of variables (Q917545) (← links)
• Infinite time extensions of Kleene's \({\mathcal O}\) (Q1031833) (← links)
• Turing oracle machines, online computing, and three displacements in computability theory (Q1032637) (← links)
• Borel ideals vs. Borel sets of countable relations and trees (Q1120573) (← links)
• Inductive definability: Measure and category (Q1155049) (← links)
• Fast growing functions based on Ramsey theorems (Q1191932) (← links)
• The countable admissible ordinal equivalence relation (Q2400501) (← links)
• Avoiding uniformity in the \(\Delta_2^0\) enumeration degrees (Q2453064) (← links)
• Relativization of a primitive recursive hierarchy (Q2626203) (← links)
• Rice and Rice-Shapiro Theorems for transfinite correction grammars (Q3096086) (← links)
• Kleene's Amazing Second Recursion Theorem (Q3161629) (← links)
• The classical and the <i>ω</i>-complete arithmetic (Q3252699) (← links)
• A Note on Function Quantification (Q3252702) (← links)
• (Q3256314) (← links)
• On a Subrecursive Hierarchy and Primitive Recursive Degrees (Q3257773) (← links)
• Mathematical significance of consistency proofs (Q3260570) (← links)
• Constructive definition of certain analytic sets of numbers (Q3265667) (← links)
• Degrees of models (Q3290719) (← links)
• Classifications of Recursive Functions by Means of Hierarchies (Q3291527) (← links)
• (Q3296941) (← links)
• Hyperarithmetical Sets (Q3305318) (← links)
• The equivalence of determinacy and iterated sharps (Q3476807) (← links)
• Every recursive linear ordering has a copy in DTIME-SPACE(<i>n</i>,log(<i>n</i>)) (Q3489983) (← links)
• Learning correction grammars (Q3630576) (← links)
• Kleene’s Amazing Second Recursion Theorem (Q3644738) (← links)
• Natural well-orderings (Q3772212) (← links)
• The theory of recursive functions, approaching its centennial (Q3946156) (← links)
• NOMINALISTIC ORDINALS, RECURSION ON HIGHER TYPES, AND FINITISM (Q4632541) (← links)
• Barwise: Infinitary Logic and Admissible Sets (Q4678932) (← links)
• The Mathematical Work of S.C.Kleene (Q4837673) (← links)
• Determinacy and the sharp function on objects of type <i>k</i> (Q4876310) (← links)
• AN INTRODUCTION TO THE SCOTT COMPLEXITY OF COUNTABLE STRUCTURES AND A SURVEY OF RECENT RESULTS (Q5067872) (← links)
• Parsimony hierarchies for inductive inference (Q5311725) (← links)
• Systems of predicative analysis (Q5344166) (← links)
• Extensions of the constructive ordinals (Q5344168) (← links)
• Classes of Polish spaces under effective Borel isomorphism (Q5365177) (← links)
• On the notational independence of various hierarchies of degrees of unsolvability (Q5509684) (← links)
• (Q5518362) (← links)
• Alternative proof of a theorem of Kleene (Q5526123) (← links)
• Metarecursively enumerable sets and admissible ordinals (Q5528641) (← links)
• Metarecursive sets (Q5536268) (← links)
• Hyperanalytic Predicates (Q5542099) (← links)
• A complete classification of the Δ₂¹-functions (Q5551156) (← links)
• The Forcing Method and the Upper Semilattice of Hyperdegrees (Q5554956) (← links)
• Some results in the effective descriptive set theory (Q5567856) (← links)
• Some properties of $\sum\nolimits_1^1$- and $\prod\nolimits_1^1$-sets in $N^N $ (Q5567857) (← links)
• Recursive Pseudo-Well-Orderings (Q5579489) (← links)