scientific article; zbMATH DE number 1390542

Publication date: 17 January 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

computability numerations constructive models constructivizable models computable trees

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 (59)

The Diophantine problem in the classical matrix groups ⋮ Degrees of autostability for prime 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 ⋮ Index sets of constructive models of finite and graph signatures that are autostable relative to strong constructivizations ⋮ Orbits of maximal vector spaces ⋮ Primitive recursive ordered fields and some applications ⋮ Effectively categorical abelian groups ⋮ Fields of algebraic numbers computable in polynomial time. II ⋮ Virtual algebraic isomorphisms between predicate calculi of finite rich signatures ⋮ Definability of linear orders over negative equivalences ⋮ Nonpresentability of some structures of analysis in hereditarily finite superstructures ⋮ Spectrum of the field of computable real numbers ⋮ Computably separable models ⋮ Computable categoricity of the Boolean algebra \(\mathfrak{B}(\omega )\) with a distinguished automorphism ⋮ Countably categorical theories ⋮ 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 ⋮ The diversity of categoricity without delay ⋮ Computable numberings of the class of Boolean algebras with distinguished endomorphisms ⋮ Constructivizability of the Boolean algebra \( \mathfrak{B}( \omega ) \) with a distinguished automorphism ⋮ Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces ⋮ Computability and universal determinability of negatively representable models ⋮ Topological spaces over algorithmic representations of universal algebras ⋮ Separable algorithmic representations of classical systems and their applications ⋮ Index sets for \(n\)-decidable structures categorical relative to \(m\)-decidable presentations ⋮ Autostability of prime models under strong constructivizations ⋮ A computable structure with nonstandard computability ⋮ Degrees of categoricity for superatomic Boolean algebras ⋮ On constructive number fields and computability of solutions of PDEs ⋮ Turing degrees and automorphism groups of substructure lattices ⋮ Primitive recursive ordered fields and some applications ⋮ Enumerating functions for nonnegative integer coordinates of \(L\)-dimensional vectors ⋮ 2007 European Summer Meeting of the Association for Symbolic Logic: Logic Colloquium '07 ⋮ Complexity of Ehrenfeucht models ⋮ Polynomial computability of fields of algebraic numbers ⋮ 0″-Categorical Completely Decomposable Torsion-Free Abelian Groups ⋮ Computable dimensions of Pappusian and Desarguesian projective planes ⋮ 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 ⋮ Strongly constructive models and numerations of the Boolean algebra of recursive sets ⋮ Degree spectra of structures ⋮ Turing degrees of complete formulas of almost prime models ⋮ \(\Sigma\)-preorderings in \(\mathbb{HF}(\mathbb{R} )\) ⋮ \(T_1\)-separable numberings of subdirectly indecomposable algebras ⋮ Structures of degrees of negative representations of linear orders ⋮ Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs with guaranteed precision ⋮ Fields of algebraic numbers computable in polynomial time. I ⋮ Abelian \(p\)-groups and autostability relative to an oracle ⋮ Computability-theoretic properties of injection structures ⋮ Enumerating classes of effective quasi-Polish spaces ⋮ Computational complexity of classical solutions of partial differential equations ⋮ Autostability spectra for Boolean algebras ⋮ Searching for applicable versions of computable structures ⋮ Индексное множество автоустойчивых упорядоченных абелевых групп

This page was built for publication: