Relative to any nonrecursive set

DOI10.1090/S0002-9939-98-04307-XMaRDI QIDQ4387095zbMATH OpenOpenAlexFDO

Authors Theodore A. Slaman

Publication date 6 May 1998

Published in Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1090/s0002-9939-98-04307-x

zbMATH Keywords

Turing degreesrecursive presentationrecursive modelsrelative recursiveness

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Recommendations

• A generic relation on recursively enumerable sets
• scientific article; zbMATH DE number 3959401
• Relative set genericity
• scientific article; zbMATH DE number 7332477
• A limit on relative genericity in the recursively enumerable sets
• A class of recursively enumerable sets
• Recursive set relations
• Completely recursively enumerable sets
• Relativized topological size of sets of partial recursive functions

Cited in

(36)

• Categoricity and complexity of relations over algebraic structures
• New degree spectra of Polish spaces
• The theory of projective planes is complete with respect to degree spectra and effective dimensions
• Degree spectra and computable dimensions in algebraic structures
• Enumerations and completely decomposable torsion-free abelian groups
• Enumerations in computable structure theory
• The \(\Delta_2^0\)-spectrum of a linear order
• Computable trees, prime models, and relative decidability
• Some Questions in Computable Mathematics
• Relative to any non-hyperarithmetic set
• Limitwise monotonic spectra and their generalizations
• A local version of the Slaman-Wehner theorem and families closed under finite differences
• Degree spectra of structures relative to equivalences
• 2006 Summer Meeting of the Association for Symbolic Logic: Logic Colloquium '06
• Bi‐embeddability spectra and bases of spectra
• Degree spectra of prime models
• Using computability to measure complexity of algebraic structures and classes of structures
• Computable abelian groups
• Constructing decidable graphs from decidable structures
• Enumeration reducibility and computable structure theory
• TURING DEGREE SPECTRA OF DIFFERENTIALLY CLOSED FIELDS
• THE COMPLEMENTS OF LOWER CONES OF DEGREES AND THE DEGREE SPECTRA OF STRUCTURES
• Freely generated projective planes with finite computable dimension
• Degree spectra and immunity properties
• 11th Asian Logic Conference
• Computability of distributive lattices
• Computability of Fraïssé limits
• Punctual structures and primitive recursive reducibility
• The Slaman-Wehner theorem in higher recursion theory
• Degree spectra of structures
• Degrees of autostability relative to strong constructivizations
• Turing degrees of nonabelian groups
• Limitwise monotonic sequences and degree spectra of structures
• Computable categoricity of trees of finite height
• Boolean algebras with distinguished endomorphisms and generating trees
• Algebraic structures computable without delay

This page was built for publication: Relative to any nonrecursive set

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4387095)