scientific article; zbMATH DE number 1450824

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)

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)

Independence in computable algebra
The index set of Boolean algebras autostable relative to strong constructivizations
Proper divisibility in computable rings
Positive numberings in admissible sets
On \(\Delta_2^0\)-categoricity of equivalence relations
Computable topological abelian groups
Index sets of autostable relative to strong constructivizations constructive models for familiar classes
scientific article; zbMATH DE number 7407778 (Why is no real title available?)
FOUNDATIONS OF ONLINE STRUCTURE THEORY
Categoricity spectra for polymodal algebras
Primitively recursively categorical linear orderings
Effective choice for relations and reducibilities in classes of constructive and positive models
Unoids with finiteness conditions over computably separable equivalences
A Friedberg enumeration of equivalence structures
ON THE COMPLEXITY OF CLASSIFYING LEBESGUE SPACES
Algebraic structures computable without delay
Computable topological groups
Computable Polish group actions
First-order combinatorics and model-theoretical properties that can be distinct for mutually interpretable theories
Definable Subsets of Polynomial-Time Algebraic Structures
On categoricity spectra for locally finite graphs
New degree spectra of Polish spaces
A structure of punctual dimension two
Uniform procedures in uncountable structures
Enumerations in computable structure theory
AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES
Every \(\Delta^0_2\) Polish space is computable topological
On the effective universality of mereological theories
A transformation scheme for infinitary first-order combinatorics presenting computational level of expressiveness in predicate logic
Decidable models of small theories
Well-orders realized by C.E. equivalence relations
Computable torsion-free nilpotent groups of finite dimension.
Separating notions in effective topology
Defining algorithmically presented structures in first order logic
PUNCTUAL CATEGORICITY AND UNIVERSALITY
A computable structure with non-standard computability
Relativizing computable categoricity
Ideal presentations and numberings of some classes of effective quasi-Polish spaces
On the Weihrauch degree of the additive Ramsey theorem
On the first-order parts of problems in the Weihrauch degrees
Computable presentability of countable linear orders
Complexity of \(\Sigma^0_n\)-classifications for definable subsets
Separable enumerations of division rings and effective embeddability of rings therein
Logical equations in monadic logic
Punctually presented structures I: Closure theorems
The property of being a model complete theory is preserved by Cartesian extensions
Learning algebraic structures with the help of Borel equivalence relations
Negative dense linear orders
The index set of the groups autostable relative to strong constructivizations
Correlation of some notions of constructive model theory
HKSS-completeness of modal algebras
Computable embeddability for algebraic structures
On the computability of ordered fields
Degrees of categoricity and spectral dimension
Computability of Polish spaces up to homeomorphism
Categoricity spectra of computable structures
A note on effective categoricity for linear orderings
Effective categoricity for distributive lattices and Heyting algebras
Computable analysis and classification problems
One question of the theory of numbered groups
A note on decidable categoricity and index sets
Computable Heyting algebras with distinguished atoms and coatoms
Computable topological groups and Pontryagin duality
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
Homomorphisms onto effectively separable algebras
Decompositions of decidable abelian groups
Computable torsion abelian groups
Partial automorphism semigroups
COMPUTABLY COMPACT METRIC SPACES
Primitive recursive reverse mathematics
Comparing notions of presentability in Polish spaces and Polish groups
Hilbert's tenth problem for term algebras with a substitution operator
Defining long words succinctly in FO and MSO
Abelian p-groups and the halting problem
Complemented subsets and Boolean-valued, partial functions
Algorithmically random series
Autostable atomic-ideal enrichments of computable Boolean algebras
On dark computably enumerable equivalence relations
Punctually presented structures. II: Comparing presentations.
The Tarski-Lindenbaum algebra of the class of strongly constructivizable models with -stable theories
A note on computable distinguishing colorings
Non-density in punctual computability
On the group of computable automorphisms of the linear order of the reals
Universal Boolean algebras with applications to semantic classes of models
Structures of finite punctual dimension \(n>2\)
On decidable and computable models of theories
Lower semilattices of separable congruences of numbered algebras
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
The back-and-forth method and computability without delay
Categorical linearly ordered structures
Computably and punctually universal spaces
Friedberg numberings in the Ershov hierarchy
Arithmetical decidability of homogeneous and almost prime countable models of Ehrenfeucht theories with arithmetical types
The computable dimension of ordered abelian groups

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)