scientific article; zbMATH DE number 1303200

zbMATH Open0941.03044MaRDI QIDQ4249723FDOQ4249723

Authors: Douglas Cenzer, Jeffrey Remmel 

Publication date: 15 September 1999

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

Recommendations

• scientific article; zbMATH DE number 1531920
• Π₁⁰ classes with complex elements
• Small \(\Pi^{0}_{1}\) classes
• \(\Pi_1^0\) classes and minimal degrees
• choice classes
• scientific article; zbMATH DE number 1390012
• scientific article; zbMATH DE number 3891998
• Functions of class \(\Pi\)
• Almost complemented \(\Pi^{0}_{1}\) classes
• Π₀¹-classes and Rado's selection principle

zbMATH Keywords

surveynonmonotonic logic\(\Pi^0_1\) classesrecursive combinatoricsrecursive algebrarecursive graphs

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Theory of numerations, effectively presented structures (03D45) Complexity of computation (including implicit computational complexity) (03D15) Other degrees and reducibilities in computability and recursion theory (03D30) Undecidability and degrees of sets of sentences (03D35)

Cited In (40)

• The upward closure of a perfect thin class
• Turing degrees of multidimensional SFTs
• Inside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functions
• Small \(\Pi^{0}_{1}\) classes
• Automorphisms of the lattice of \(\Pi_1^0\) classes; perfect thin classes and anc degrees
• Coding true arithmetic in the Medvedev degrees of \(\Pi^0_1\) classes
• Recursive Quantum Functions, Avoidable Points, & Shadow Points in Recursive Analysis
• The random members of a \({\Pi }_{1}^{0}\) class
• Effectively closed sets and enumerations
• Computability of Subsets of Metric Spaces
• Singular coverings and non-uniform notions of closed set computability
• Computability in Symbolic Dynamics
• Invariance in ℰ* and ℰ_{Π}
• Members of countable \(\Pi ^ 0_ 1\) classes
• \(\Pi_{1}^{0}\) classes and orderable groups
• The members of thin and minimal \(\Pi_1^0\) classes, their ranks and Turing degrees
• $\it \Pi^0_1$ Sets and Tilings
• Effective symbolic dynamics
• COMPUTABLY COMPACT METRIC SPACES
• Subshifts with sparse traces
• Index sets in computable analysis
• On Turing degrees of points in computable topology
• Π₀¹-classes and Rado's selection principle
• Feasible graphs with standard universe
• A blend of methods of recursion theory and topology.
• Sequent calculi for skeptical reasoning in predicate default logic and other nonmonotonic logics
• Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism
• A connection between the Cantor-Bendixson derivative and the well-founded semantics of finite logic programs
• choice classes
• The \(\forall \exists \)-theory of the effectively closed Medvedev degrees is decidable
• The complexity of recursive constraint satisfaction problems
• Computable symbolic dynamics
• Singular coverings and non‐uniform notions of closed set computability
• On degree-preserving homeomorphisms between trees in computable topology
• Random Continuous Functions
• Effectively closed sets and graphs of computable real functions.
• Immunity for closed sets
• A blend of methods of recursion theory and topology: a \(\Pi_1^0\) tree of shadow points
• Title not available (Why is that?)
• Graph colorings and recursively bounded \(\Pi ^ 0_ 1\)-classes

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 Q4249723)