Publication:4956005

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)

Related Items

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