Pairs of recursive structures

DOI10.1016/0168-0072(90)90004-LzbMath0712.03020OpenAlexW1971015044MaRDI QIDQ923075

C. J. Ash, Julia F. Knight

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1016/0168-0072(90)90004-l

zbMATH Keywords

\(\alpha \) -systemsrecursive collection of recursive structures

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57)

Related Items (42)

Inseparability in recursive copies ⋮ Degrees of autostability for prime Boolean algebras ⋮ Degrees of autostability relative to strong constructivizations for Boolean algebras ⋮ Degrees of autostability for linear orders and linearly ordered abelian groups ⋮ A construction for recursive linear orderings ⋮ Computable linearizations of well-partial-orderings ⋮ Back and forth relations for reduced abelian \(p\)-groups ⋮ Permitting, forcing, and copying of a given recursive relation ⋮ Possible degrees in recursive copies. II ⋮ Effective categoricity for distributive lattices and Heyting algebras ⋮ Requirement systems ⋮ COPYING ONE OF A PAIR OF STRUCTURES ⋮ Mixed systems ⋮ Index sets of autostable relative to strong constructivizations constructive models for familiar classes ⋮ Computing maximal chains ⋮ Labelling systems and r.e. structures ⋮ Constructions by transfinitely many workers ⋮ A Note on Effective Categoricity for Linear Orderings ⋮ Realizing levels of the hyperarithmetic hierarchy as degree spectra of relations on computable structures ⋮ Sufficiency conditions for theories with recursive models ⋮ The index set of Boolean algebras autostable relative to strong constructivizations ⋮ Measuring complexities of classes of structures ⋮ The computable embedding problem ⋮ PRIORITY ARGUMENTS VIA TRUE STAGES ⋮ Turing computable embeddings, computable infinitary equivalence, and linear orders ⋮ Annual Meeting of the Association for Symbolic Logic, Berkeley, 1990 ⋮ Index sets for classes of high rank structures ⋮ Jumps of Orderings ⋮ Effectively closed subgroups of the infinite symmetric group ⋮ Categoricity spectra of computable structures ⋮ Computable embeddings for pairs of linear orders ⋮ Punctual categoricity spectra of computably categorical structures ⋮ Computable trees of Scott rank ω₁^CK, and computable approximation ⋮ COMPUTABLE STRUCTURES OF RANK $\omega_{1}^{{\rm CK}}$ ⋮ On bi-embeddable categoricity of algebraic structures ⋮ Degrees of bi-embeddable categoricity ⋮ On the $n$-back-and-forth types of Boolean algebras ⋮ Computable isomorphisms, degree spectra of relations, and Scott families ⋮ Enumerations in computable structure theory ⋮ COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS II: DEGREE SPECTRA ⋮ RELATIVE TO ANY NON-HYPERARITHMETIC SET ⋮ THE COMPLEXITY OF SCOTT SENTENCES OF SCATTERED LINEAR ORDERS

Cites Work

• Stability of recursive structures in arithmetical degrees
• Categoricity in hyperarithmetical degrees
• Jumps of Orderings
• A metatheorem for constructions by finitely many workers
• Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees
• An introduction to recursively saturated and resplendent models

This page was built for publication: Pairs of recursive structures