scientific article; zbMATH DE number 2047478

zbMATH Open1034.03044MaRDI QIDQ4451633FDOQ4451633

S. S. Goncharov, J. F. Knight

Publication date: 29 February 2004

Title of this publication is not available (Why is that?)

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

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)

Cited In (70)

• Every \(\Delta^0_2\) Polish space is computable topological
• STRUCTURAL HIGHNESS NOTIONS
• COMPUTABLY COMPACT METRIC SPACES
• Индексное множество автоустойчивых упорядоченных абелевых групп
• On two types of concept lattices in the theory of numberings
• Title not available (Why is that?)
• Tree-Automatic Well-Founded Trees
• MAXIMAL TOWERS AND ULTRAFILTER BASES IN COMPUTABILITY THEORY
• Structure and Randomness in Computability and Set Theory
• AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES
• Title not available (Why is that?)
• Enumerating classes of effective quasi-Polish spaces
• The computable embedding problem
• Title not available (Why is that?)
• 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
• Computable embeddability for algebraic structures
• 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
• Isomorphism relations on computable structures
• Isomorphism of Computable Structures and Vaught's Conjecture
• Boolean algebras, Tarski invariants, and index sets
• Degrees of autostability for linear orders and linearly ordered abelian groups
• Computable topological groups and Pontryagin duality
• Decompositions of decidable abelian groups
• Computable analysis and classification problems
• A note on decidable categoricity and index sets
• 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
• Computable torsion abelian groups
• Scott sentences for certain groups
• Index Sets of Constructive Models that are Autostable Under Strong Constructivizations
• Index sets of constructive models of bounded signature that are autostable relative to strong constructivizations
• Computable numberings of the class of Boolean algebras with distinguished endomorphisms
• A note on computable distinguishing colorings
• Computability-Theoretic Complexity of Countable Structures
• 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
• 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
• Index sets for some classes of structures
• The isomorphism problem for torsion-free abelian groups is analytic complete
• Decidable structures between Church-style and Curry-style
• Structural properties for feasibly computable classes of type two
• Learning families of algebraic structures from informant
• Index sets of constructive models of nontrivial signature autostable relative to strong constructivizations
• Torsion-free abelian groups with optimal Scott families
• Degrees of categoricity of trees and the isomorphism problem
• Degrees of autostability relative to strong constructivizations
• Title not available (Why is that?)
• The index set of Boolean algebras autostable relative to strong constructivizations
• Title not available (Why is that?)
• 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
• Computable Stone spaces
• Scott sentences for equivalence structures
• Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces
• Classifications of definable subsets
• A Friedberg enumeration of equivalence structures
• ON THE COMPLEXITY OF CLASSIFYING LEBESGUE SPACES
• COMPUTABILITY OF POLISH SPACES UP TO HOMEOMORPHISM

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)