scientific article; zbMATH DE number 1303200
From MaRDI portal
Publication:4249723
zbMath0941.03044MaRDI QIDQ4249723
Douglas Cenzer, Jeffery B. Remmel
Publication date: 15 September 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Undecidability and degrees of sets of sentences (03D35) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Complexity of computation (including implicit computational complexity) (03D15) Other degrees and reducibilities in computability and recursion theory (03D30) Theory of numerations, effectively presented structures (03D45)
Related Items
\(\Pi_{1}^{0}\) classes and orderable groups, Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism, Computability in Symbolic Dynamics, The \(\forall \exists \)-theory of the effectively closed Medvedev degrees is decidable, A connection between the Cantor-Bendixson derivative and the well-founded semantics of finite logic programs, Turing degrees of multidimensional SFTs, Coding true arithmetic in the Medvedev degrees of \(\Pi^0_1\) classes, COMPUTABLY COMPACT METRIC SPACES, The complexity of recursive constraint satisfaction problems, A blend of methods of recursion theory and topology., Computable symbolic dynamics, On Turing degrees of points in computable topology, Singular coverings and non‐uniform notions of closed set computability, Inside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functions, On degree-preserving homeomorphisms between trees in computable topology, Effectively closed sets and enumerations, Subshifts with sparse traces, $\it \Pi^0_1$ Sets and Tilings, Automorphisms of the lattice of $\Pi _1^0$ classes; perfect thin classes and anc degrees, The upward closure of a perfect thin class, Recursive Quantum Functions, Avoidable Points, & Shadow Points in Recursive Analysis, Singular Coverings and Non-Uniform Notions of Closed Set Computability, Effective Symbolic Dynamics, Immunity for Closed Sets, Random Continuous Functions, A blend of methods of recursion theory and topology: a \(\Pi_1^0\) tree of shadow points, Sequent calculi for skeptical reasoning in predicate default logic and other nonmonotonic logics, The random members of a \({\Pi }_{1}^{0}\) class, Invariance in ℰ* and ℰ_{Π}, Index sets in computable analysis, Feasible graphs with standard universe, The members of thin and minimal \(\Pi_1^0\) classes, their ranks and Turing degrees, Computability of Subsets of Metric Spaces, Effectively closed sets and graphs of computable real functions.
