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
(97)- A note on decidable categoricity and index sets
- Index sets of constructive models of nontrivial signature autostable relative to strong constructivizations
- Primitively recursively categorical linear orderings
- Partial automorphism semigroups
- On the ``heap problem
- Separable enumerations of division rings and effective embeddability of rings therein
- The Tarski-Lindenbaum algebra of the class of all prime strongly constructivizable models of algorithmic dimension one
- On a question of Kalimullin
- On the effective universality of mereological theories
- AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES
- Degrees of categoricity and spectral dimension
- Effective choice for relations and reducibilities in classes of constructive and positive models
- On categoricity spectra for locally finite graphs
- New degree spectra of Polish spaces
- Computable torsion-free nilpotent groups of finite dimension.
- A note on computable distinguishing colorings
- A note on effective categoricity for linear orderings
- On decidable and computable models of theories
- Constructive homogeneous extensions
- Categoricity spectra of computable structures
- Definable Subsets of Polynomial-Time Algebraic Structures
- FOUNDATIONS OF ONLINE STRUCTURE THEORY
- Computable topological abelian groups
- Prime model with no degree of autostability relative to strong constructivizations
- Non-density in punctual computability
- Spectra of Algebraic Fields and Subfields
- Friedberg numberings in the Ershov hierarchy
- PUNCTUAL CATEGORICITY AND UNIVERSALITY
- The back-and-forth method and computability without delay
- A structure of punctual dimension two
- Effective categoricity for distributive lattices and Heyting algebras
- Index sets of autostable relative to strong constructivizations constructive models for familiar classes
- Abelian \(p\)-groups and the halting problem
- A Friedberg enumeration of equivalence structures
- 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 Models
- Graphs are not universal for online computability
- Punctual copies of algebraic structures
- Logical equations in monadic logic
- Computability of Polish spaces up to homeomorphism
- Enumerations in computable structure theory
- Autostability relative to strong constructivizations of Boolean algebras with distinguished ideals
- Separating notions in effective topology
- Categoricity spectra for polymodal algebras
- Negative dense linear orders
- Enumerating abelian \(p\)-groups
- The computable dimension of ordered abelian groups
- Computable topological groups and Pontryagin duality
- ON THE COMPLEXITY OF CLASSIFYING LEBESGUE SPACES
- Computable presentability of countable linear orders
- Independence in computable algebra
- The index set of Boolean algebras autostable relative to strong constructivizations
- Categorical linearly ordered structures
- Proper divisibility in computable rings
- Algebraic structures computable without delay
- The property of being a model complete theory is preserved by Cartesian extensions
- Computable torsion abelian groups
- A computable structure with non-standard computability
- Online presentations of finitely generated structures
- The index set of the groups autostable relative to strong constructivizations
- A transformation scheme for infinitary first-order combinatorics presenting computational level of expressiveness in predicate logic
- Decidable models of small theories
- scientific article; zbMATH DE number 7407778 (Why is no real title available?)
- On dark computably enumerable equivalence relations
- Homomorphisms onto effectively separable algebras
- On \(\Delta_2^0\)-categoricity of equivalence relations
- Autostable atomic-ideal enrichments of computable Boolean algebras
- Computable analysis and classification problems
- Decompositions of decidable abelian groups
- Uniform \(m\)-equivalencies and numberings of classical systems
- Punctually presented structures I: Closure theorems
- HKSS-completeness of modal algebras
- Uniform procedures in uncountable structures
- Every \(\Delta^0_2\) Polish space is computable topological
- Computable Polish group actions
- Computably separable numbering of locally finitely separable algebras
- Effectively closed subgroups of the infinite symmetric group
- Learning algebraic structures with the help of Borel equivalence relations
- Computably and punctually universal spaces
- Computable Heyting algebras with distinguished atoms and coatoms
- Lower semilattices of separable congruences of numbered algebras
- First-order combinatorics and model-theoretical properties that can be distinct for mutually interpretable theories
- On decidable categoricity and almost prime models
- Positive numberings in admissible sets
- Well-orders realized by C.E. equivalence relations
- COMPUTABLY COMPACT METRIC SPACES
- Correlation of some notions of constructive model theory
- Computable embeddability for algebraic 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
- Relativizing computable categoricity
- Complexity of \(\Sigma^0_n\)-classifications for definable subsets
- On the computability of ordered fields
- Arithmetical decidability of homogeneous and almost prime countable models of Ehrenfeucht theories with arithmetical types
- Primitive recursive reverse mathematics
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)
