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
- scientific article; zbMATH DE number 1390019
- Priority constructions
- Categoricity in hyperarithmetical degrees
Cites work
- A metatheorem for constructions by finitely many workers
- An introduction to recursively saturated and resplendent models
- Categoricity in hyperarithmetical degrees
- Jumps of Orderings
- Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees
- Stability of recursive structures in arithmetical degrees
Cited in
(44)- Annual Meeting of the Association for Symbolic Logic, Berkeley, 1990
- Mixed systems
- A construction for recursive linear orderings
- scientific article; zbMATH DE number 874495 (Why is no real title available?)
- Enumerations in computable structure theory
- Constructions by transfinitely many workers
- Labelling systems and r.e. structures
- The computable embedding problem
- COPYING ONE OF A PAIR OF STRUCTURES
- 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
- Categoricity spectra of computable structures
- Degrees of autostability for linear orders and linearly ordered abelian groups
- A note on effective categoricity for linear orderings
- Effective categoricity for distributive lattices and Heyting algebras
- Computable trees of Scott rank ω1CK, and computable approximation
- Realizing levels of the hyperarithmetic hierarchy as degree spectra of relations on computable structures
- Requirement systems
- Turing computable embeddings, computable infinitary equivalence, and linear orders
- On the $n$-back-and-forth types of Boolean algebras
- Computable isomorphisms, degree spectra of relations, and Scott families
- Computing maximal chains
- Permitting, forcing, and copying of a given recursive relation
- Possible degrees in recursive copies. II
- Computable structures of rank \(\omega _1^{\mathrm{CK}}\)
- 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
- scientific article; zbMATH DE number 1302872 (Why is no real title available?)
- 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
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)
