scientific article - MaRDI portal

zbMATH Open0716.03043MaRDI QIDQ4040890FDOQ4040890

Publication date: 5 June 1993

Title of this publication is not available (Why is that?)

hyperarithmetic higher recursion theory metarecursion E-recursion $\alpha $ - recursion computations in normal functionals Higher type computations

Mathematics Subject Classification ID

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)

Cited In (only showing first 100 items - show all)

Beyond Erdős-Kunen-Mauldin: shift-compactness properties and singular sets
Embeddings between well-orderings: computability-theoretic reductions
On a generalized notion of mistake bounds
Computability and the game of cops and robbers on graphs
Measure-theoretic uniformity and the Suslin functional
AN APPLICATION OF RECURSION THEORY TO ANALYSIS
Lower bounds on $\beta (\alpha)$
Effectiveness for the dual Ramsey theorem
COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS I: COMPUTABLE CATEGORICITY
The strength of compactness in computability theory and nonstandard analysis
On the commutativity of jumps
The members of thin and minimal $\Pi_1^0$ classes, their ranks and Turing degrees
Turing determinacy and the continuum hypothesis
A reducibility related to being hyperimmune-free
Realizing levels of the hyperarithmetic hierarchy as degree spectra of relations on computable structures
The computational strengths of $\alpha$-tape infinite time Turing machines
THE DETERMINED PROPERTY OF BAIRE IN REVERSE MATH
Characterizations of ITBM-computability. I
Computable isomorphisms, degree spectra of relations, and Scott families
Enumerating abelian $p$-groups
On Some Semi-constructive Theories Related to Kripke–Platek Set Theory
Parallel Feedback Turing Computability
Predicativity and Feferman
Computable positive and Friedberg numberings in hyperarithmetic
THE PREHISTORY OF THE SUBSYSTEMS OF SECOND-ORDER ARITHMETIC
Strength and Weakness in Computable Structure Theory
The weakness of the pigeonhole principle under hyperarithmetical reductions
The scope of Gödel's first incompleteness theorem
The computational power of infinite time Blum-Shub-Smale machines
BASIS THEOREMS FOR -SETS
Characterizations of ITBM-computability. II
UNIFORM PROCEDURES IN UNCOUNTABLE STRUCTURES
COMPUTABILITY IN PARTIAL COMBINATORY ALGEBRAS
Randomness in the higher setting
Bounding lemmata for non-deterministic halting times of transfinite Turing machines
Discrete transfinite computation models
SOME OBSERVATIONS ON TRUTH HIERARCHIES
A representation of recursively enumerable sets through Horn formulas in higher recursion theory
COMPUTABLE REDUCIBILITY OF EQUIVALENCE RELATIONS AND AN EFFECTIVE JUMP OPERATOR
COMPUTABILITY THEORY, NONSTANDARD ANALYSIS, AND THEIR CONNECTIONS
Maximal chains in the Turing degrees
Measure theory aspects of locally countable orderings
RANDOMNESS VIA INFINITE COMPUTATION AND EFFECTIVE DESCRIPTIVE SET THEORY
The countable admissible ordinal equivalence relation
Infinitary action logic with exponentiation
SEARCHING FOR AN ANALOGUE OF ATR₀ IN THE WEIHRAUCH LATTICE
Decidability and universality of quasiminimal subshifts
The generic degrees of density-1 sets, and a characterization of the hyperarithmetic reals
Turing reducibility in the fine hierarchy
Bad oracles in higher computability and randomness
$\Sigma$-preorderings in $\mathbb{HF}(\mathbb{R} )$
Computable topological abelian groups
Up to equimorphism, hyperarithmetic is recursive
Partial decidable presentations in hyperarithmetic
Point Degree Spectra of Represented Spaces
Regular enumerations
Minimal equivalence relations in hyperarithmetical and analytical hierarchies
Nonstandard models in recursion theory and reverse mathematics
Continuous higher randomness
AXIOM I₀ AND HIGHER DEGREE THEORY
Atomic models higher up
Remarks on two problems by M. Laczkovich on functions with Borel measurable differences
Universal sets for pointsets properly on the n^th level of the projective hierarchy
FRAGMENTS OF FREGE’SGRUNDGESETZEAND GÖDEL’S CONSTRUCTIBLE UNIVERSE
Mass problems associated with effectively closed sets
The strength of Mac Lane set theory
Absolute and relative properties of negatively numbered families
The strength of the Grätzer-Schmidt theorem
Reals n-generic relative to some perfect tree
The Π21$\Pi ^1_2$ consequences of a theory
Fixed points for the jump operator
Nonpresentability of the semigroup $\omega^\omega$ over $\mathbb H\mathbb F(\mathbb R)$
The metamathematics of Stable Ramsey’s Theorem for Pairs
Weak systems of determinacy and arithmetical quasi-inductive definitions
Degrees of autostability relative to strong constructivizations for Boolean algebras
COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS II: DEGREE SPECTRA
On the classification of computable languages
Computable trees of Scott rank ω₁^CK, and computable approximation
The Role of True Finiteness in the Admissible Recursively Enumerable Degrees
Parsimony hierarchies for inductive inference
An ordinal analysis of stability
An ordinal analysis of parameter free $\Pi^{1}_{2}$-comprehension
Higher Index Theory
Forbidden substructures and combinatorial dichotomies: WQO and universality
Computability and Recursion
Computing with Functionals—Computability Theory or Computer Science?
Fundamentals of generalized recursion theory
A contextual-hierarchical approach to truth and the liar paradox
Π₁¹ relations and paths through
Predicativity, the Russell-Myhill paradox, and Church's intensional logic
Implicit definability in arithmetic
On notions of computability-theoretic reduction between Π21 principles
Higher type recursion, ramification and polynomial time
Comparing Peano arithmetic, Basic Law V, and Hume's Principle
Computing maximal chains
On the Equimorphism Types of Linear Orderings
The theory of the $\alpha $ degrees is undecidable
Forcing in Proof Theory
Index sets for classes of high rank structures
On the orbits of computably enumerable sets

Recommendations

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)