scientific article; zbMATH DE number 1450824
From MaRDI portal
Publication:4956005
Recommendations
- scientific article; zbMATH DE number 1390542
- scientific article; zbMATH DE number 3458610
- scientific article; zbMATH DE number 4074982
- 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; zbMATH DE number 175647
- scientific article; zbMATH DE number 1983465
Cited in
(only showing first 100 items - show all)- Constructive homogeneous extensions
- Effective choice for relations and reducibilities in classes of constructive and positive models
- On dark computably enumerable equivalence relations
- Computable torsion abelian groups
- Negative dense linear orders
- The computable dimension of ordered abelian groups
- Primitively recursively categorical linear orderings
- Separable enumerations of division rings and effective embeddability of rings therein
- A note on computable distinguishing colorings
- Categoricity spectra of computable structures
- Computable presentability of countable linear orders
- Non-density in punctual computability
- Computable topological abelian groups
- Well-orders realized by C.E. equivalence relations
- Computable analysis and classification problems
- Punctual copies of algebraic structures
- Graphs are not universal for online computability
- Positive numberings in admissible sets
- Enumerating abelian \(p\)-groups
- A note on decidable categoricity and index sets
- On decidable categoricity and almost prime models
- Online presentations of finitely generated structures
- The property of being a model complete theory is preserved by Cartesian extensions
- HKSS-completeness of modal algebras
- The back-and-forth method and computability without delay
- Categorical linearly ordered structures
- On \(\Delta_2^0\)-categoricity of equivalence relations
- The index set of the groups autostable relative to strong constructivizations
- Effective categoricity for distributive lattices and Heyting algebras
- On the ``heap problem
- 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
- Uniform \(m\)-equivalencies and numberings of classical systems
- Learning algebraic structures with the help of Borel equivalence relations
- Complexity of \(\Sigma^0_n\)-classifications for definable subsets
- First-order combinatorics and model-theoretical properties that can be distinct for mutually interpretable theories
- A note on effective categoricity for linear orderings
- Homomorphisms onto effectively separable algebras
- Abelian p-groups and the halting problem
- Prime model with no degree of autostability relative to strong constructivizations
- Correlation of some notions of constructive model theory
- Computable Models
- Spectra of Algebraic Fields and Subfields
- Computable torsion-free nilpotent groups of finite dimension.
- On a question of Kalimullin
- Computable Polish group actions
- Uniform procedures in uncountable structures
- A Friedberg enumeration of equivalence structures
- Degrees of categoricity and spectral dimension
- Computable topological groups and Pontryagin duality
- Effectively closed subgroups of the infinite symmetric group
- Index sets of constructive models of nontrivial signature autostable relative to strong constructivizations
- Independence in computable algebra
- The index set of Boolean algebras autostable relative to strong constructivizations
- Autostability relative to strong constructivizations of Boolean algebras with distinguished ideals
- Relativizing computable categoricity
- Definable Subsets of Polynomial-Time Algebraic Structures
- Proper divisibility in computable rings
- A structure of punctual dimension two
- Categoricity spectra for polymodal algebras
- Foundations of online structure theory. II: The operator approach
- AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES
- Decompositions of decidable abelian groups
- FOUNDATIONS OF ONLINE STRUCTURE THEORY
- A computable structure with non-standard computability
- Algebraic structures computable without delay
- On decidable and computable models of theories
- ON THE COMPLEXITY OF CLASSIFYING LEBESGUE SPACES
- PUNCTUAL CATEGORICITY AND UNIVERSALITY
- Computability of Polish spaces up to homeomorphism
- Computable embeddability for algebraic structures
- Friedberg numberings in the Ershov hierarchy
- Autostable atomic-ideal enrichments of computable Boolean algebras
- Primitive recursive reverse mathematics
- On the effective universality of mereological theories
- Computable Heyting algebras with distinguished atoms and coatoms
- Separating notions in effective topology
- Punctually presented structures I: Closure theorems
- COMPUTABLY COMPACT METRIC SPACES
- Lower semilattices of separable congruences of numbered algebras
- Arithmetical decidability of homogeneous and almost prime countable models of Ehrenfeucht theories with arithmetical types
- Every \(\Delta^0_2\) Polish space is computable topological
- On the computability of ordered fields
- Computably and punctually universal spaces
- Computable Boolean algebras and complexity of the Fréchet ideal
- On learning for families of algebraic structures
- Numberings on admissible structures over equivalence relations
- Computably separable numbering of locally finitely separable algebras
- Complexity estimates for theories of some classes of prime models
- Computably locally compact groups and their closed subgroups
- On learning existentially definable subsets in a computable structure
- Unoids with finiteness conditions over computably separable equivalences
- Defining algorithmically presented structures in first order logic
- Computable topological groups
- One question of the theory of numbered groups
- Comparing notions of presentability in Polish spaces and Polish groups
- On the Weihrauch degree of the additive Ramsey theorem
- Hilbert's tenth problem for term algebras with a substitution operator
- Complemented subsets and Boolean-valued, partial functions
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)
