scientific article; zbMATH DE number 194101

Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Higher-type and set recursion theory (03D65)

Recommendations

Higher recursion theory
scientific article; zbMATH DE number 480999
Recursion theory
scientific article; zbMATH DE number 478433
scientific article; zbMATH DE number 1176133
Some recent developments in higher recursion theory
Recursion-theoretic hierarchies
Fundamentals of generalized recursion theory
scientific article; zbMATH DE number 3857082

Cited in

(only showing first 100 items - show all)

Infinite time extensions of Kleene's \({\mathcal O}\)
Ordinal machines and admissible recursion theory
Turing oracle machines, online computing, and three displacements in computability theory
Techniques of admissible recursion theory
Fundamentals of generalized recursion theory
Recursive functionals
The irregular and non-hyperregular -r.e. degrees
Computable isomorphisms, degree spectra of relations, and Scott families
Realizing levels of the hyperarithmetic hierarchy as degree spectra of relations on computable structures
Ordinal mind change complexity of language identification
Higher type recursion, ramification and polynomial time
Mind change complexity of learning logic programs
A representation of recursively enumerable sets through Horn formulas in higher recursion theory
The omega-rule interpretation of transfinite provability logic
Positive presentations of families in relation to reducibility with respect to enumerability
An ordinal analysis of stability
An ordinal analysis of parameter free \(\Pi^{1}_{2}\)-comprehension
Turing determinacy and the continuum hypothesis
On a generalized notion of mistake bounds
A contextual-hierarchical approach to truth and the liar paradox
Degrees of categoricity and the hyperarithmetic hierarchy
Simple structures with complex symmetry
Embeddings between well-orderings: computability-theoretic reductions
Beyond Erdős-Kunen-Mauldin: shift-compactness properties and singular sets
Bad oracles in higher computability and randomness
Characterizations of ITBM-computability. I
Absolute and relative properties of negatively numbered families
Characterizations of ITBM-computability. II
Infinitary action logic with exponentiation
Effectiveness for the dual Ramsey theorem
Computable topological abelian groups
Lower bounds on \(\beta (\alpha)\)
Computability and the game of cops and robbers on graphs
Turing reducibility in the fine hierarchy
Enumerating abelian \(p\)-groups
Minimal equivalence relations in hyperarithmetical and analytical hierarchies
Computable positive and Friedberg numberings in hyperarithmetic
The scope of Gödel's first incompleteness theorem
Recursion theory. Computational aspects of definability
Forbidden substructures and combinatorial dichotomies: WQO and universality
\(\Sigma\)-preorderings in \(\mathbb{HF}(\mathbb{R} )\)
Pincherle's theorem in reverse mathematics and computability theory
The strength of compactness in computability theory and nonstandard analysis
Partial decidable presentations in hyperarithmetic
The members of thin and minimal \(\Pi_1^0\) classes, their ranks and Turing degrees
A reducibility related to being hyperimmune-free
Degrees of autostability relative to strong constructivizations for Boolean algebras
The countable admissible ordinal equivalence relation
The computational power of infinite time Blum-Shub-Smale machines
Decidability and universality of quasiminimal subshifts
Avoiding uniformity in the \(\Delta_2^0\) enumeration degrees
The computational strengths of -tape infinite time Turing machines
Bounding lemmata for non-deterministic halting times of transfinite Turing machines
On the reducibility of \(\Pi_ 1^ 1\) sets
Determinacy and monotone inductive definitions
Weak and strong versions of effective transfinite recursion
Infinitary action logic with multiplexing
On the commutativity of jumps
Randomness in the higher setting
The generic degrees of density-1 sets, and a characterization of the hyperarithmetic reals
Descriptive inner model theory
Nonstandard models in recursion theory and reverse mathematics
Some observations on truth hierarchies
Mass problems and density
Strength and weakness in computable structure theory
On the non-enumerability of L
Predicativity, the Russell-Myhill paradox, and Church's intensional logic
Weak systems of determinacy and arithmetical quasi-inductive definitions
On the orbits of computably enumerable sets
Implicit definability in arithmetic
A Computational Approach to an Alternative Working Environment for the Constructible Universe
On a positive set theory with inequality
On Σ¹ ₁ equivalence relations over the natural numbers
Kleene's amazing second recursion theorem
Reverse mathematics: the playground of logic
A new proof of Friedman's conjecture
On notions of computability-theoretic reduction between Π21 principles
FRAGMENTS OF FREGE’SGRUNDGESETZEAND GÖDEL’S CONSTRUCTIBLE UNIVERSE
The metamathematics of Stable Ramsey’s Theorem for Pairs
ITRM-recognizability from random oracles
The ideal approach to computing closed subsets in well-quasi-orderings
\({\Pi}_1^1\)-Martin-Löf random reals as measures of natural open sets
Hyperarithmetical Sets
Some recent developments in higher recursion theory
Turing Computations On Ordinals
The Role of True Finiteness in the Admissible Recursively Enumerable Degrees
An application of recursion theory to analysis
Measure theory aspects of locally countable orderings
Randomness and Computability: Open Questions
AXIOM I₀ AND HIGHER DEGREE THEORY
Reals n-generic relative to some perfect tree
On the Equimorphism Types of Linear Orderings
Mass problems and measure-theoretic regularity
A lift of a theorem of Friedberg: A Banach-Mazur functional that coincides with no α-recursive functional on the class of α-recursive functions
α-degrees of α-theories
On generalized computational complexity
The effective content of surreal algebra
Anti-admissible sets
2002 European Summer Meeting of the Association for Symbolic Logic Logic Colloquium '02
Regular enumerations

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4040890)