Quasi-simple relations in copies of a given recursive structure

DOI10.1016/S0168-0072(97)00010-9zbMath0883.03030OpenAlexW2091435900MaRDI QIDQ1365244

C. J. Ash, Jeffery B. Remmel, Julia F. Knight

Publication date: 14 October 1997

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0168-0072(97)00010-9

zbMATH Keywords

recursive structuresimple setquasi-simple relations

Mathematics Subject Classification ID

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

Related Items

Turing degrees of hypersimple relations on computable structures, The Lattice of Computably Enumerable Vector Spaces, Turing degrees of certain isomorphic images of computable relations, Generalised weak presentations

Cites Work

• Unnamed Item
• Recursive properties of relations on models
• Automorphisms of substructure lattices in recursive algebra
• Some effects of Ash-Nerode and other decidability conditions on degree spectra
• Ramified systems
• Recursive isomorphism types of recursive Boolean algebras
• Automorphisms of supermaximal subspaces
• A Theorem on Hypersimple Sets