The following pages link to Pairs of recursive structures (Q923075):
Displaying 42 items.
- Computing maximal chains (Q453200) (← links)
- The index set of Boolean algebras autostable relative to strong constructivizations (Q498225) (← links)
- Measuring complexities of classes of structures (Q499081) (← links)
- The computable embedding problem (Q695798) (← links)
- Index sets of autostable relative to strong constructivizations constructive models for familiar classes (Q906085) (← links)
- Labelling systems and r.e. structures (Q923076) (← links)
- Constructions by transfinitely many workers (Q923078) (← links)
- Sufficiency conditions for theories with recursive models (Q1184717) (← links)
- Computable isomorphisms, degree spectra of relations, and Scott families (Q1295389) (← links)
- Inseparability in recursive copies (Q1326768) (← links)
- Permitting, forcing, and copying of a given recursive relation (Q1365246) (← links)
- Possible degrees in recursive copies. II (Q1368584) (← links)
- Realizing levels of the hyperarithmetic hierarchy as degree spectra of relations on computable structures (Q1430995) (← links)
- Degrees of autostability for prime Boolean algebras (Q1620777) (← links)
- Back and forth relations for reduced abelian \(p\)-groups (Q1902617) (← links)
- Turing computable embeddings, computable infinitary equivalence, and linear orders (Q2011646) (← links)
- Categoricity spectra of computable structures (Q2036466) (← links)
- Computable embeddings for pairs of linear orders (Q2055305) (← links)
- Punctual categoricity spectra of computably categorical structures (Q2055311) (← links)
- On bi-embeddable categoricity of algebraic structures (Q2067511) (← links)
- Degrees of autostability relative to strong constructivizations for Boolean algebras (Q2364293) (← links)
- Degrees of autostability for linear orders and linearly ordered abelian groups (Q2364330) (← links)
- Computable linearizations of well-partial-orderings (Q2385530) (← links)
- Effective categoricity for distributive lattices and Heyting algebras (Q2404797) (← links)
- Enumerations in computable structure theory (Q2570135) (← links)
- RELATIVE TO ANY NON-HYPERARITHMETIC SET (Q2853977) (← links)
- A Note on Effective Categoricity for Linear Orderings (Q2988812) (← links)
- COMPUTABLE STRUCTURES OF RANK $\omega_{1}^{{\rm CK}}$ (Q3094353) (← links)
- On the $n$-back-and-forth types of Boolean algebras (Q3116576) (← links)
- Annual Meeting of the Association for Symbolic Logic, Berkeley, 1990 (Q3352991) (← links)
- Jumps of Orderings (Q3484823) (← links)
- A construction for recursive linear orderings (Q3984441) (← links)
- Mixed systems (Q4323050) (← links)
- Effectively closed subgroups of the infinite symmetric group (Q4691363) (← links)
- Requirement systems (Q4836053) (← links)
- Degrees of bi-embeddable categoricity (Q4995600) (← links)
- COPYING ONE OF A PAIR OF STRUCTURES (Q5100056) (← links)
- PRIORITY ARGUMENTS VIA TRUE STAGES (Q5177887) (← links)
- COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS II: DEGREE SPECTRA (Q5251362) (← links)
- Index sets for classes of high rank structures (Q5444710) (← links)
- Computable trees of Scott rank <i>ω</i><sub>1</sub><sup><i>CK</i></sup>, and computable approximation (Q5477636) (← links)
- THE COMPLEXITY OF SCOTT SENTENCES OF SCATTERED LINEAR ORDERS (Q5855748) (← links)
