Enumerations, countable structures and Turing degrees
From MaRDI portal
Publication:4387097
DOI10.1090/S0002-9939-98-04314-7zbMATH Open0906.03044MaRDI QIDQ4387097FDOQ4387097
Authors: Stephan Wehner 
Publication date: 6 May 1998
Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)
Recommendations
Turing degreeenumerationsrecursive degreecountable structuresrecursively represented elementary extension
Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)
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
- New degree spectra of Polish spaces
- Enumerations in computable structure theory
- Degree spectra and computable dimensions in algebraic structures
- Enumerations and completely decomposable torsion-free abelian groups
- The \(\Delta_2^0\)-spectrum of a linear order
- Computable trees, prime models, and relative decidability
- The enumeration spectrum hierarchy of \(n\)-families
- An extension of the recursively enumerable Turing degrees
- Some Questions in Computable Mathematics
- Relative to any non-hyperarithmetic set
- Limitwise monotonic spectra and their generalizations
- 2006 Summer Meeting of the Association for Symbolic Logic: Logic Colloquium '06
- Degree spectra of structures relative to equivalences
- COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS II: DEGREE SPECTRA
- Degree spectra of prime models
- Bi‐embeddability spectra and bases of spectra
- Computable abelian groups
- Using computability to measure complexity of algebraic structures and classes of structures
- Toward a Theory of Enumerations
- Constructing decidable graphs from decidable structures
- The tree of tuples of a structure
- Title not available (Why is that?)
- Enumeration reducibility and computable structure theory
- Computability-Theoretic Complexity of Countable Structures
- Computability in structures representing a Scott set
- TURING DEGREE SPECTRA OF DIFFERENTIALLY CLOSED FIELDS
- Degrees of enumerations of countable Wehner-like families
- Limitwise monotonic sets of reals
- On recursively enumerable structures
- THE COMPLEMENTS OF LOWER CONES OF DEGREES AND THE DEGREE SPECTRA OF STRUCTURES
- Spectra of theories and structures
- Freely generated projective planes with finite computable dimension
- On mutually coherent enumerations of countable sets
- Exact enumerations
- 11th Asian Logic Conference
- A hierarchy of classes of families and \(n\)-low degrees
- Computability of distributive lattices
- Computability of Fraïssé limits
- Punctual structures and primitive recursive reducibility
- The Slaman-Wehner theorem in higher recursion theory
- Countable Lawvere theories and computational effects
- Exact effective enumerations of total functional structures
- Least enumerations of unary partial structures
- Title not available (Why is that?)
- Degrees of autostability relative to strong constructivizations
- Degree spectra of structures
- Turing degrees of nonabelian groups
- Limitwise monotonic sequences and degree spectra of structures
- Computable categoricity of trees of finite height
- Every Set has a Least Jump Enumeration
- Boolean algebras with distinguished endomorphisms and generating trees
- Ranked structures and arithmetic transfinite recursion
- Correction to “Simple r. e. degree structures”
- The theory of projective planes is complete with respect to degree spectra and effective dimensions
- Algebraic structures computable without delay
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)
