Publication:4451633
From MaRDI portal
zbMath1034.03044MaRDI QIDQ4451633
Sergei S. Goncharov, Julia F. Knight
Publication date: 29 February 2004
classification; index sets; numberings; computable model; recursive model; classes of models; infinitary sentences
03C57: Computable structure theory, computable model theory
03D45: Theory of numerations, effectively presented structures
Related Items
Torsion-free abelian groups with optimal Scott families, A Friedberg enumeration of equivalence structures, Computable topological groups and Pontryagin duality, Degrees of categoricity of trees and the isomorphism problem, AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES, Decompositions of decidable abelian groups, Isomorphism relations on computable structures, Index Sets of Constructive Models that are Autostable Under Strong Constructivizations, Tree-Automatic Well-Founded Trees, ON THE COMPLEXITY OF CLASSIFYING LEBESGUE SPACES, COMPUTABILITY OF POLISH SPACES UP TO HOMEOMORPHISM, Computable embeddability for algebraic structures, Индексное множество автоустойчивых упорядоченных абелевых групп, Computable Stone spaces, On two types of concept lattices in the theory of numberings, STRUCTURAL HIGHNESS NOTIONS, COMPUTABLY COMPACT METRIC SPACES, Index sets of constructive models of finite and graph signatures that are autostable relative to strong constructivizations, Index sets of constructive models of nontrivial signature autostable relative to strong constructivizations, The index set of Boolean algebras autostable relative to strong constructivizations, Model-theoretic complexity of automatic structures, The computable embedding problem, The \(\delta_\alpha^0\)-computable enumerations of the classes of projective planes, Complexity of the isomorphism problem for computable free projective planes of finite rank, Index sets of constructive models of bounded signature that are autostable relative to strong constructivizations, PAC learning, VC dimension, and the arithmetic hierarchy, Computable numberings of the class of Boolean algebras with distinguished endomorphisms, Index sets of autostable relative to strong constructivizations constructive models for familiar classes, The isomorphism problem for torsion-free abelian groups is analytic complete, Index sets for some classes of structures, Computable torsion abelian groups, Classifications of computable structures, Scott sentences for certain groups, A note on computable distinguishing colorings, Computable topological abelian groups, Enumerating classes of effective quasi-Polish spaces, Computable analysis and classification problems, The isomorphism problem for FST injection structures, On the isomorphism problem for some classes of computable algebraic structures, Punctual copies of algebraic structures, Graphs are not universal for online computability, Enumerating abelian \(p\)-groups, A note on decidable categoricity and index sets, Learning families of algebraic structures from informant, Classifications of definable subsets, Scott sentences for equivalence structures, Categorical linearly ordered structures, The index set of the groups autostable relative to strong constructivizations, Degrees of autostability relative to strong constructivizations for Boolean algebras, Degrees of autostability for linear orders and linearly ordered abelian groups, Index set of structures with two equivalence relations that are autostable relative to strong constructivizations, Boolean algebras, Tarski invariants, and index sets, Degrees of autostability relative to strong constructivizations, Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces, On Σ1 1 equivalence relations over the natural numbers, Model Theoretic Complexity of Automatic Structures (Extended Abstract)
