Classical recursion theory. The theory of functions and sets of natural numbers.
From MaRDI portal
Publication:1189450
zbMath0744.03044MaRDI QIDQ1189450
Publication date: 18 September 1992
Published in: Studies in Logic and the Foundations of Mathematics (Search for Journal in Brave)
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Recursive functions and relations, subrecursive hierarchies (03D20) Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30) Hierarchies of computability and definability (03D55)
Related Items
On categoricity spectra for locally finite graphs, Invertible classes, Primitive recursive equivalence relations and their primitive recursive complexity, Extending properly n - REA sets1, Parametric Church's thesis: synthetic computability without choice, THE REVERSE MATHEMATICS OF THE THIN SET AND ERDŐS–MOSER THEOREMS, On the Hardness of Almost–Sure Termination, Synchronizing Automata with Extremal Properties, Unification of infinite sets of terms schematized by primal grammars, A characterization of functions over the integers computable in polynomial time using discrete ordinary differential equations, How much partiality is needed for a theory of computability?, Computation as an unbounded process, On-demand minimum cost benchmarking for intermediate dataset storage in scientific cloud workflow systems, Unnamed Item, On the hardness of analyzing probabilistic programs, Degrees bounding principles and universal instances in reverse mathematics, On the logic of UNITY, The Rogers semilattices of generalized computable enumerations, Covering the recursive sets, Irreducible, singular, and contiguous degrees, Strong jump-traceability. I: The computably enumerable case, Preference aggregation theory without acyclicity: the core without majority dissatisfaction, Computability of simple games: A characterization and application to the core, Numberings optimal for learning, The P\(\neq\) NP conjecture in the context of real and complex analysis, Computability of simple games: a complete investigation of the sixty-four possibilities, Totally non‐immune sets, Index sets and universal numberings, Constructive logic and the Medvedev lattice, Undecidability of equality for codata types, CURRENT RESEARCH ON GÖDEL’S INCOMPLETENESS THEOREMS, The expressiveness of quasiperiodic and minimal shifts of finite type, Polylog depth, highness and lowness for E, The Nakamura numbers for computable simple games, Kolmogorov-Loveland randomness and stochasticity, Elementarily computable functions over the real numbers and \(\mathbb R\)-sub-recursive functions, Well-orders realized by C.E. equivalence relations, Random reals as measures of natural open sets
