scientific article; zbMATH DE number 1390542
From MaRDI portal
Publication:4935938
Cited in
(67)- 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
- \(T_1\)-separable numberings of subdirectly indecomposable algebras
- Structures of degrees of negative representations of linear orders
- Enumerating classes of effective quasi-Polish spaces
- Computational complexity of classical solutions of partial differential equations
- Searching for applicable versions of computable structures
- Fields of algebraic numbers computable in polynomial time. II
- Virtual algebraic isomorphisms between predicate calculi of finite rich signatures
- Computably separable models
- 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
- _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
- Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces
- Computability and universal determinability of negatively representable models
- 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
- Complexity of Ehrenfeucht models
- \(\mathbf 0\)-categorical completely decomposable torsion-free abelian groups
- scientific article; zbMATH DE number 3918348 (Why is no real title available?)
- Computable categoricity of the Boolean algebra \(\mathfrak{B}(\omega )\) with a distinguished automorphism
- Autostability of prime models under strong constructivizations
- scientific article; zbMATH DE number 4118557 (Why is no real title available?)
- scientific article; zbMATH DE number 1450824 (Why is no real title available?)
- Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs with guaranteed precision
- The Diophantine problem in the classical matrix groups
- 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
- Индексное множество автоустойчивых упорядоченных абелевых групп
- Primitive recursive ordered fields and some applications
- Separable algorithmic representations of classical systems and their applications
- Order positive fields. I
- Logical specifications of effectively separable data models
- Ordered fields and Grzegorczyk's hierarchy
- Finite logical specifications of effectively separable data models
- Computable dimensions of Pappusian and Desarguesian projective planes
- Isomorphism of atomless Boolean algebras with distinguished ideals
- Fields of algebraic numbers computable in polynomial time. I
- Primitive recursive ordered fields and some applications
- 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
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 Q4935938)
