Relative to any nonrecursive set
From MaRDI portal
Publication:4387095
DOI10.1090/S0002-9939-98-04307-XzbMath0894.03017OpenAlexW1571286435MaRDI QIDQ4387095
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
Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)
Related Items (36)
Degree spectra and computable dimensions in algebraic structures ⋮ New degree spectra of Polish spaces ⋮ 11th Asian Logic Conference ⋮ Turing degrees of nonabelian groups ⋮ Degree spectra of prime models ⋮ Freely generated projective planes with finite computable dimension ⋮ Punctual structures and primitive recursive reducibility ⋮ Bi‐embeddability spectra and bases of spectra ⋮ A local version of the Slaman-Wehner theorem and families closed under finite differences ⋮ Enumeration Reducibility and Computable Structure Theory ⋮ Some Questions in Computable Mathematics ⋮ THE COMPLEMENTS OF LOWER CONES OF DEGREES AND THE DEGREE SPECTRA OF STRUCTURES ⋮ The Slaman-Wehner theorem in higher recursion theory ⋮ Computability of distributive lattices ⋮ The -spectrum of a linear order ⋮ Algebraic structures computable without delay ⋮ TURING DEGREE SPECTRA OF DIFFERENTIALLY CLOSED FIELDS ⋮ 2006 Summer Meeting of the Association for Symbolic Logic: Logic Colloquium '06 ⋮ Boolean Algebras with Distinguished Endomorphisms and Generating Trees ⋮ Using computability to measure complexity of algebraic structures and classes of structures ⋮ Degree spectra of structures relative to equivalences ⋮ COMPUTABLE ABELIAN GROUPS ⋮ Degrees of autostability relative to strong constructivizations ⋮ Degree spectra of structures ⋮ The theory of projective planes is complete with respect to degree spectra and effective dimensions ⋮ Categoricity and complexity of relations over algebraic structures ⋮ Enumerations and completely decomposable torsion-free abelian groups ⋮ Computable categoricity of trees of finite height ⋮ Computable trees, prime models, and relative decidability ⋮ Computability of Fraïssé limits ⋮ Constructing decidable graphs from decidable structures ⋮ Degree spectra and immunity properties ⋮ Limitwise monotonic sequences and degree spectra of structures ⋮ Enumerations in computable structure theory ⋮ RELATIVE TO ANY NON-HYPERARITHMETIC SET ⋮ Limitwise monotonic spectra and their generalizations
This page was built for publication: Relative to any nonrecursive set
