Pairs of recursive structures

DOI10.1016/0168-0072(90)90004-LzbMATH Open0712.03020OpenAlexW1971015044MaRDI QIDQ923075FDOQ923075

Authors: C. J. Ash, J. 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

Recommendations

• Sufficiency conditions for theories with recursive models
• Constructions by transfinitely many workers
• Hyperarithmetical relations in expansions of recursive structures
• Intrinsically \(\Sigma ^ 0_{\alpha}\) relations
• A construction for recursive linear orderings
• The Role of True Finiteness in the Admissible Recursively Enumerable Degrees
• An α-finite injury method of the unbounded type
• Publication:4934284
• Priority constructions
• Categoricity in hyperarithmetical degrees

zbMATH Keywords

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

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57)

Cites Work

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

Cited In (44)

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

This page was built for publication: Pairs of recursive structures

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