Publication:4935938
From MaRDI portal
zbMath1043.03518MaRDI QIDQ4935938
Yuri L. Ershov, Sergei S. Goncharov
Publication date: 17 January 2000
03-02: Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations
03C57: Computable structure theory, computable model theory
03D45: Theory of numerations, effectively presented structures
Related Items
Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs with guaranteed precision, 2007 European Summer Meeting of the Association for Symbolic Logic: Logic Colloquium '07, 2-Computably Enumerable Degrees of Categoricity for Boolean Algebras with Distinguished Automorphisms, Perfect Local Computability of Superatomic Boolean Algebras, Boolean Algebras with Distinguished Endomorphisms and Generating Trees, Index sets of constructive models of finite and graph signatures that are autostable relative to strong constructivizations, Orbits of maximal vector spaces, Definability of linear orders over negative equivalences, Computable categoricity of the Boolean algebra \(\mathfrak{B}(\omega )\) with a distinguished automorphism, Autostability of prime models under strong constructivizations, Computable dimensions of Pappusian and Desarguesian projective planes, Fields of algebraic numbers computable in polynomial time. I, The branching theorem and computable categoricity in the Ershov hierarchy, Index sets of constructive models of bounded signature that are autostable relative to strong constructivizations, How to find (compute) a separant, Computable numberings of the class of Boolean algebras with distinguished endomorphisms, Index sets for \(n\)-decidable structures categorical relative to \(m\)-decidable presentations, Strongly constructive models and numerations of the Boolean algebra of recursive sets, Degrees of autostability for prime Boolean algebras, Nonpresentability of some structures of analysis in hereditarily finite superstructures, The diversity of categoricity without delay, A computable structure with nonstandard computability, On constructive number fields and computability of solutions of PDEs, Countably categorical theories, Constructivizability of the Boolean algebra \( \mathfrak{B}( \omega ) \) with a distinguished automorphism, Polynomial computability of fields of algebraic numbers, Degree spectra of structures, Topological spaces over algorithmic representations of universal algebras, Turing degrees and automorphism groups of substructure lattices, Turing degrees of complete formulas of almost prime models, \(\Sigma\)-preorderings in \(\mathbb{HF}(\mathbb{R} )\), Abelian \(p\)-groups and autostability relative to an oracle, Computability-theoretic properties of injection structures, Autostability spectra for Boolean algebras, Degrees of autostability relative to strong constructivizations for Boolean algebras, Degrees of autostability for linear orders and linearly ordered abelian groups, \(\prod_1^1\)-completeness of the computable categoricity problem for projective planes, Index set of structures with two equivalence relations that are autostable relative to strong constructivizations, Effectively categorical abelian groups, Spectrum of the field of computable real numbers, Degrees of categoricity for superatomic Boolean algebras, Enumerating functions for nonnegative integer coordinates of \(L\)-dimensional vectors, Complexity of Ehrenfeucht models, 0″-Categorical Completely Decomposable Torsion-Free Abelian Groups
