Pages that link to "Item:Q2570135"
From MaRDI portal
The following pages link to Enumerations in computable structure theory (Q2570135):
Displaying 40 items.
- Isomorphisms and algorithmic properties of structures with two equivalences (Q321265) (← links)
- Computable categoricity of the Boolean algebra \(\mathfrak{B}(\omega )\) with a distinguished automorphism (Q384395) (← links)
- Reducibility on families (Q431669) (← links)
- The complexity of computable categoricity (Q471691) (← links)
- Relations between algorithmic reducibilities of algebraic systems (Q735978) (← links)
- Preserving categoricity and complexity of relations (Q887644) (← links)
- A hierarchy of classes of families and \(n\)-low degrees (Q904326) (← links)
- Effective categoricity of abelian \(p\)-groups (Q1023056) (← links)
- Jump inversions of algebraic structures and the \({\Sigma}\)-definability (Q1620784) (← links)
- Computability-theoretic categoricity and Scott families (Q1740457) (← links)
- Categoricity spectra of computable structures (Q2036466) (← links)
- Degrees of enumerations of countable Wehner-like families (Q2036467) (← links)
- Degree spectra of structures (Q2036471) (← links)
- Computable embeddings for pairs of linear orders (Q2055305) (← links)
- Punctual structures and primitive recursive reducibility (Q2172879) (← links)
- Effective categoricity for distributive lattices and Heyting algebras (Q2404797) (← links)
- Degrees of categoricity for superatomic Boolean algebras (Q2434601) (← links)
- Effective categoricity of equivalence structures (Q2498900) (← links)
- Degrees of autostability relative to strong constructivizations (Q2510761) (← links)
- Degrees of categoricity of computable structures (Q2655143) (← links)
- The enumeration spectrum hierarchy of<i>n</i>-families (Q2827955) (← links)
- Limitwise monotonic sequences and degree spectra of structures (Q2845476) (← links)
- RELATIVE TO ANY NON-HYPERARITHMETIC SET (Q2853977) (← links)
- Rice sequences of relations (Q2941599) (← links)
- Enumeration Reducibility and Computable Structure Theory (Q2970965) (← links)
- A Note on Effective Categoricity for Linear Orderings (Q2988812) (← links)
- The Slaman-Wehner theorem in higher recursion theory (Q3003597) (← links)
- Computability of Fraïssé limits (Q3083128) (← links)
- COMPUTABLE STRUCTURES OF RANK $\omega_{1}^{{\rm CK}}$ (Q3094353) (← links)
- Intrinsic bounds on complexity and definability at limit levels (Q3399191) (← links)
- Degree spectra and immunity properties (Q3406451) (← links)
- THE TREE OF TUPLES OF A STRUCTURE (Q5070461) (← links)
- Jump inversions of algebraic structures and Σ‐definability (Q5108844) (← links)
- COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS II: DEGREE SPECTRA (Q5251362) (← links)
- DEGREES OF CATEGORICITY ON A CONE VIA<i>η</i>-SYSTEMS (Q5738206) (← links)
- 2-Computably Enumerable Degrees of Categoricity for Boolean Algebras with Distinguished Automorphisms (Q5741344) (← links)
- Boolean Algebras with Distinguished Endomorphisms and Generating Trees (Q5741387) (← links)
- Two theorems on minimal generalized computable numberings (Q6052274) (← links)
- On the main scientific achievements of Victor Selivanov (Q6146819) (← links)
- A family with a single minimal but not least numbering (Q6203338) (← links)
