scientific article; zbMATH DE number 1450824
From MaRDI portal
Publication:4956005
zbMATH Open0954.03036MaRDI QIDQ4956005FDOQ4956005
S. S. Goncharov, Yuri L. Ershov
Publication date: 23 May 2000
Title of this publication is not available (Why is that?)
Recommendations
- scientific article; zbMATH DE number 1390542
- scientific article
- scientific article
- scientific article; zbMATH DE number 1357268
- scientific article; zbMATH DE number 3896734
- scientific article; zbMATH DE number 3290886
- Principles of model construction. (Printsipy postroeniya modelej).
- Constructive mathematics and mathematical logic. Part X. Transl. from the Russian
- scientific article
- scientific article; zbMATH DE number 1983465
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)
Cited In (97)
- Every \(\Delta^0_2\) Polish space is computable topological
- Well-orders realized by C.E. equivalence relations
- Relativizing computable categoricity
- Complexity of \(\Sigma^0_n\)-classifications for definable subsets
- Punctually presented structures I: Closure theorems
- Learning algebraic structures with the help of Borel equivalence relations
- Correlation of some notions of constructive model theory
- Computable embeddability for algebraic structures
- On the computability of ordered fields
- HKSS-completeness of modal algebras
- Computable Heyting algebras with distinguished atoms and coatoms
- COMPUTABLY COMPACT METRIC SPACES
- Primitive recursive reverse mathematics
- Lower semilattices of separable congruences of numbered algebras
- Computably and punctually universal spaces
- COMPUTABLE POLISH GROUP ACTIONS
- Arithmetical decidability of homogeneous and almost prime countable models of Ehrenfeucht theories with arithmetical types
- UNIFORM PROCEDURES IN UNCOUNTABLE STRUCTURES
- Computable Boolean algebras and complexity of the Fréchet ideal
- On learning for families of algebraic structures
- Numberings on admissible structures over equivalence relations
- Effectively closed subgroups of the infinite symmetric group
- Uniform \(m\)-equivalencies and numberings of classical systems
- On decidable categoricity and almost prime models
- Computably separable numbering of locally finitely separable algebras
- Positive numberings in admissible sets
- First-order combinatorics and model-theoretical properties that can be distinct for mutually interpretable theories
- On the effective universality of mereological theories
- AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES
- On categoricity spectra for locally finite graphs
- New degree spectra of Polish spaces
- Enumerations in computable structure theory
- A transformation scheme for infinitary first-order combinatorics presenting computational level of expressiveness in predicate logic
- Decidable models of small theories
- Separating notions in effective topology
- On Decidable and Computable Models of Theories
- Computable torsion-free nilpotent groups of finite dimension.
- PUNCTUAL CATEGORICITY AND UNIVERSALITY
- Computable presentability of countable linear orders
- Separable enumerations of division rings and effective embeddability of rings therein
- Logical equations in monadic logic
- The property of being a model complete theory is preserved by Cartesian extensions
- Negative dense linear orders
- The index set of the groups autostable relative to strong constructivizations
- Categoricity spectra of computable structures
- Effective categoricity for distributive lattices and Heyting algebras
- 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
- Autostability relative to strong constructivizations of Boolean algebras with distinguished ideals
- Computable torsion abelian groups
- Homomorphisms onto effectively separable algebras
- Partial automorphism semigroups
- Abelian \(p\)-groups and the halting problem
- On dark computably enumerable equivalence relations
- Autostable atomic-ideal enrichments of computable Boolean algebras
- A note on computable distinguishing colorings
- Non-density in punctual computability
- Graphs are not universal for online computability
- Punctual copies of algebraic structures
- Enumerating abelian \(p\)-groups
- Online presentations of finitely generated structures
- On the ``heap problem
- Friedberg numberings in the Ershov hierarchy
- The back-and-forth method and computability without delay
- Categorical linearly ordered structures
- A Note on Effective Categoricity for Linear Orderings
- The computable dimension of ordered abelian groups
- On a question of Kalimullin
- Computable Models
- Spectra of Algebraic Fields and Subfields
- Constructive homogeneous extensions
- The Tarski-Lindenbaum algebra of the class of all prime strongly constructivizable models of algorithmic dimension one
- Index sets of constructive models of nontrivial signature autostable relative to strong constructivizations
- A Computable Structure with Non-Standard Computability
- DEGREES OF CATEGORICITY AND SPECTRAL DIMENSION
- Independence in computable algebra
- The index set of Boolean algebras autostable relative to strong constructivizations
- Proper divisibility in computable rings
- On \(\Delta_2^0\)-categoricity of equivalence relations
- Computable topological abelian groups
- Title not available (Why is that?)
- FOUNDATIONS OF ONLINE STRUCTURE THEORY
- Index sets of autostable relative to strong constructivizations constructive models for familiar classes
- Prime Model with No Degree of Autostability Relative to Strong Constructivizations
- Categoricity spectra for polymodal algebras
- Primitively recursively categorical linear orderings
- Effective choice for relations and reducibilities in classes of constructive and positive models
- A Friedberg enumeration of equivalence structures
- ON THE COMPLEXITY OF CLASSIFYING LEBESGUE SPACES
- Definable Subsets of Polynomial-Time Algebraic Structures
- COMPUTABILITY OF POLISH SPACES UP TO HOMEOMORPHISM
- A structure of punctual dimension two
- Algebraic structures computable without delay
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 Q4956005)
