scientific article

Publication date: 5 June 1993

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

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)

Related Items (only showing first 100 items - show all)

The Σ 2 theory of D h ( ⩽ h O ) as an uppersemilattice with least and greatest element is decidable ⋮ Parallel Feedback Turing Computability ⋮ Anti-admissible sets ⋮ On the classification of computable languages ⋮ AN INTRODUCTION TO THE SCOTT COMPLEXITY OF COUNTABLE STRUCTURES AND A SURVEY OF RECENT RESULTS ⋮ THEOREMS OF HYPERARITHMETIC ANALYSIS AND ALMOST THEOREMS OF HYPERARITHMETIC ANALYSIS ⋮ IN MEMORIAM: GERALD E. SACKS, 1933–2019 ⋮ Parsimony hierarchies for inductive inference ⋮ Π₁¹ relations and paths through ⋮ There is no bound on Borel classes of graphs in the Luzin–Novikov theorem ⋮ A dichotomy characterizing analytic digraphs of uncountable Borel chromatic number in any dimension ⋮ A Π¹₁-uniformization principle for reals ⋮ LUZIN’S (N) AND RANDOMNESS REFLECTION ⋮ UNIFORM PROCEDURES IN UNCOUNTABLE STRUCTURES ⋮ RANDOMNESS VIA INFINITE COMPUTATION AND EFFECTIVE DESCRIPTIVE SET THEORY ⋮ Borel combinatorics fail in HYP ⋮ What is effective transfinite recursion in reverse mathematics? ⋮ A syntactic approach to Borel functions: some extensions of Louveau's theorem ⋮ On the complexity of the theory of a computably presented metric structure ⋮ Locally hyperarithmetical induction ⋮ THE DETERMINED PROPERTY OF BAIRE IN REVERSE MATH ⋮ COMPUTABLE REDUCIBILITY OF EQUIVALENCE RELATIONS AND AN EFFECTIVE JUMP OPERATOR ⋮ ALMOST THEOREMS OF HYPERARITHMETIC ANALYSIS ⋮ A recursion theoretic characterization of the Topological Vaught Conjecture in the Zermelo‐Fraenkel set theory ⋮ Π11‐Martin‐Löf randomness and Π11‐Solovay completeness ⋮ SOME CONSEQUENCES OF AND ⋮ Constructing the constructible universe constructively ⋮ HIGHER RANDOMNESS AND GENERICITY ⋮ ON THE DECIDABILITY OF THE THEORIES OF THE ARITHMETIC AND HYPERARITHMETIC DEGREES AS UPPERSEMILATTICES ⋮ The Π21$\Pi ^1_2$ consequences of a theory ⋮ THE STRENGTH OF AN AXIOM OF FINITE CHOICE FOR BRANCHES IN TREES ⋮ Complexity profiles and generic Muchnik reducibility ⋮ Computability and Recursion ⋮ BASIS THEOREMS FOR -SETS ⋮ Theses for Computation and Recursion on Concrete and Abstract Structures ⋮ α-degrees of α-theories ⋮ Cofinal maximal chains in the Turing degrees ⋮ FINDING DESCENDING SEQUENCES THROUGH ILL-FOUNDED LINEAR ORDERS ⋮ Up to equimorphism, hyperarithmetic is recursive ⋮ The weakness of the pigeonhole principle under hyperarithmetical reductions ⋮ Universal sets for pointsets properly on the n^th level of the projective hierarchy ⋮ Local Definitions in Degree Structures: The Turing Jump, Hyperdegrees and Beyond ⋮ Perfect Local Computability of Superatomic Boolean Algebras ⋮ The strength of Mac Lane set theory ⋮ On the Equimorphism Types of Linear Orderings ⋮ Forcing in Proof Theory ⋮ Ranked structures and arithmetic transfinite recursion ⋮ Lattice initial segments of the hyperdegrees ⋮ COMPUTABILITY IN UNCOUNTABLE BINARY TREES ⋮ Maximal chains in the Turing degrees ⋮ Index sets for classes of high rank structures ⋮ On generalized computational complexity ⋮ 2002 European Summer Meeting of the Association for Symbolic Logic Logic Colloquium '02 ⋮ COMPUTABILITY THEORY, NONSTANDARD ANALYSIS, AND THEIR CONNECTIONS ⋮ Unnamed Item ⋮ On Some Semi-constructive Theories Related to Kripke–Platek Set Theory ⋮ Predicativity and Feferman ⋮ Unnamed Item ⋮ Regular enumerations ⋮ On the mathematical and foundational significance of the uncountable ⋮ Computable trees of Scott rank ω₁^CK, and computable approximation ⋮ Computing with Functionals—Computability Theory or Computer Science? ⋮ A gap 1 cardinal transfer theorem ⋮ COMPUTABILITY IN PARTIAL COMBINATORY ALGEBRAS ⋮ Turing degrees in Polish spaces and decomposability of Borel functions ⋮ 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 bi-embeddable categoricity ⋮ Measure-theoretic uniformity and the Suslin functional ⋮ COH, SRT 2 2 , and multiple functionals ⋮ The effective content of surreal algebra ⋮ THE OPEN AND CLOPEN RAMSEY THEOREMS IN THE WEIHRAUCH LATTICE ⋮ COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS I: COMPUTABLE CATEGORICITY ⋮ COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS II: DEGREE SPECTRA ⋮ SEARCHING FOR AN ANALOGUE OF ATR₀ IN THE WEIHRAUCH LATTICE ⋮ Constructive Zermelo-Fraenkel Set Theory, Power Set, and the Calculus of Constructions ⋮ COMPUTABILITY OF POLISH SPACES UP TO HOMEOMORPHISM ⋮ INFINITARY TABLEAU FOR SEMANTIC TRUTH ⋮ ORDINAL ANALYSIS OF PARTIAL COMBINATORY ALGEBRAS ⋮ Point Degree Spectra of Represented Spaces ⋮ Infinite time Turing machines ⋮ A COMPARISON OF VARIOUS ANALYTIC CHOICE PRINCIPLES ⋮ Continuous higher randomness ⋮ THE PREHISTORY OF THE SUBSYSTEMS OF SECOND-ORDER ARITHMETIC ⋮ A contextual-hierarchical approach to truth and the liar paradox ⋮ Degrees of autostability relative to strong constructivizations for Boolean algebras ⋮ Kleene's Amazing Second Recursion Theorem ⋮ Reverse Mathematics: The Playground of Logic ⋮ Predicativity, the Russell-Myhill paradox, and Church's intensional logic ⋮ AXIOM I₀ AND HIGHER DEGREE THEORY ⋮ A New Proof of Friedman's Conjecture ⋮ Implicit definability in arithmetic ⋮ Determinacy and monotone inductive definitions ⋮ Computability and the game of cops and robbers on graphs ⋮ On notions of computability-theoretic reduction between Π21 principles ⋮ ${\Pi}_1^1$-Martin-Löf random reals as measures of natural open sets ⋮ FRAGMENTS OF FREGE’SGRUNDGESETZEAND GÖDEL’S CONSTRUCTIBLE UNIVERSE ⋮ The metamathematics of Stable Ramsey’s Theorem for Pairs ⋮ $$ITRM$$-Recognizability from Random Oracles ⋮ NONSTANDARD MODELS IN RECURSION THEORY AND REVERSE MATHEMATICS

This page was built for publication: