Enumerations, countable structures and Turing degrees
From MaRDI portal
Publication:4387097
Recommendations
Cited in
(57)- A local version of the Slaman-Wehner theorem and families closed under finite differences
- Categoricity and complexity of relations over algebraic structures
- Enumeration reducibility and computable structure theory
- Enumerations and completely decomposable torsion-free abelian groups
- Degrees of autostability relative to strong constructivizations
- Toward a Theory of Enumerations
- Limitwise monotonic sets of reals
- Degree spectra of structures
- Limitwise monotonic sequences and degree spectra of structures
- COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS II: DEGREE SPECTRA
- Computability in structures representing a Scott set
- Computable categoricity of trees of finite height
- TURING DEGREE SPECTRA OF DIFFERENTIALLY CLOSED FIELDS
- Limitwise monotonic spectra and their generalizations
- Ranked structures and arithmetic transfinite recursion
- 11th Asian Logic Conference
- Degrees of enumerations of countable Wehner-like families
- Every Set has a Least Jump Enumeration
- Computability of distributive lattices
- Computability of Fraïssé limits
- The \(\Delta_2^0\)-spectrum of a linear order
- Constructing decidable graphs from decidable structures
- New degree spectra of Polish spaces
- On recursively enumerable structures
- The Slaman-Wehner theorem in higher recursion theory
- A hierarchy of classes of families and \(n\)-low degrees
- THE COMPLEMENTS OF LOWER CONES OF DEGREES AND THE DEGREE SPECTRA OF STRUCTURES
- Turing degrees of nonabelian groups
- Computable trees, prime models, and relative decidability
- Spectra of theories and structures
- Freely generated projective planes with finite computable dimension
- Some Questions in Computable Mathematics
- Boolean algebras with distinguished endomorphisms and generating trees
- Computability-Theoretic Complexity of Countable Structures
- On mutually coherent enumerations of countable sets
- Punctual structures and primitive recursive reducibility
- Countable Lawvere theories and computational effects
- 2006 Summer Meeting of the Association for Symbolic Logic: Logic Colloquium '06
- The enumeration spectrum hierarchy of \(n\)-families
- Correction to “Simple r. e. degree structures”
- Enumerations in computable structure theory
- scientific article; zbMATH DE number 3841924 (Why is no real title available?)
- scientific article; zbMATH DE number 3950497 (Why is no real title available?)
- Relative to any non-hyperarithmetic set
- The theory of projective planes is complete with respect to degree spectra and effective dimensions
- Exact effective enumerations of total functional structures
- Least enumerations of unary partial structures
- Exact enumerations
- Computable abelian groups
- Degree spectra and computable dimensions in algebraic structures
- Algebraic structures computable without delay
- Using computability to measure complexity of algebraic structures and classes of structures
- Degree spectra of prime models
- An extension of the recursively enumerable Turing degrees
- Bi‐embeddability spectra and bases of spectra
- The tree of tuples of a structure
- Degree spectra of structures relative to equivalences
This page was built for publication: Enumerations, countable structures and Turing degrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4387097)
