scientific article; zbMATH DE number 2047478

MaRDI QIDQ4451633zbMATH OpenFDO

Authors S. S. Goncharov, J. F. Knight

Publication date 29 February 2004

zbMATH Keywords

classificationcomputable modelindex setsnumberingsrecursive modelclasses of modelsinfinitary sentences

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Recommendations

• scientific article; zbMATH DE number 1302873
• Computability theoretic classifications for classes of structures
• Classification from a Computable Viewpoint
• Computability in special models
• Comparing Classes of Finite Structures

Cited in

(73)

• AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES
• Every \(\Delta^0_2\) Polish space is computable topological
• Enumerating classes of effective quasi-Polish spaces
• Coding and definability in computable structures
• scientific article; zbMATH DE number 1984268 (Why is no real title available?)
• STRUCTURAL HIGHNESS NOTIONS
• The computable embedding problem
• scientific article; zbMATH DE number 41858 (Why is no real title available?)
• Model-theoretic complexity of automatic structures
• Model Theoretic Complexity of Automatic Structures (Extended Abstract)
• Index sets of constructive models of finite and graph signatures that are autostable relative to strong constructivizations
• The index set of the groups autostable relative to strong constructivizations
• Degrees of autostability relative to strong constructivizations for Boolean algebras
• Index set of structures with two equivalence relations that are autostable relative to strong constructivizations
• Computable embeddability for algebraic structures
• Isomorphism relations on computable structures
• Isomorphism of Computable Structures and Vaught's Conjecture
• Boolean algebras, Tarski invariants, and index sets
• Computability of Polish spaces up to homeomorphism
• Degrees of autostability for linear orders and linearly ordered abelian groups
• Computable analysis and classification problems
• A note on decidable categoricity and index sets
• Computable topological groups and Pontryagin duality
• Complexity of the isomorphism problem for computable free projective planes of finite rank
• The \(\delta_\alpha^0\)-computable enumerations of the classes of projective planes
• Decompositions of decidable abelian groups
• Computable torsion abelian groups
• Scott sentences for certain groups
• Index sets of constructive models of bounded signature that are autostable relative to strong constructivizations
• COMPUTABLY COMPACT METRIC SPACES
• Computable numberings of the class of Boolean algebras with distinguished endomorphisms
• Индексное множество автоустойчивых упорядоченных абелевых групп
• Computable axiomatizability of elementary classes
• A note on computable distinguishing colorings
• Graphs are not universal for online computability
• Punctual copies of algebraic structures
• On the isomorphism problem for some classes of computable algebraic structures
• Enumerating abelian \(p\)-groups
• Computability-Theoretic Complexity of Countable Structures
• On two types of concept lattices in the theory of numberings
• Turing computability: structural theory
• Computable structures and the hyperarithmetical hierarchy
• Categorical linearly ordered structures
• The isomorphism problem for FST injection structures
• PAC learning, VC dimension, and the arithmetic hierarchy
• scientific article; zbMATH DE number 4154430 (Why is no real title available?)
• Index sets for some classes of structures
• The isomorphism problem for torsion-free abelian groups is analytic complete
• Index sets of constructive models that are autostable under strong constructivizations
• Decidable structures between Church-style and Curry-style
• Tree-automatic well-founded trees
• Learning families of algebraic structures from informant
• Structural properties for feasibly computable classes of type two
• Index sets of constructive models of nontrivial signature autostable relative to strong constructivizations
• MAXIMAL TOWERS AND ULTRAFILTER BASES IN COMPUTABILITY THEORY
• Torsion-free abelian groups with optimal Scott families
• Degrees of autostability relative to strong constructivizations
• Degrees of categoricity of trees and the isomorphism problem
• The index set of Boolean algebras autostable relative to strong constructivizations
• scientific article; zbMATH DE number 6536307 (Why is no real title available?)
• scientific article; zbMATH DE number 2063217 (Why is no real title available?)
• On Σ¹ ₁ equivalence relations over the natural numbers
• Computable topological abelian groups
• Classifications of computable structures
• Index sets of autostable relative to strong constructivizations constructive models for familiar classes
• Scott sentences for equivalence structures
• Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces
• Computable Stone spaces
• Structure and Randomness in Computability and Set Theory
• Classifications of definable subsets
• Computability theoretic classifications for classes of structures
• A Friedberg enumeration of equivalence structures
• ON THE COMPLEXITY OF CLASSIFYING LEBESGUE SPACES

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4451633)