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