scientific article; zbMATH DE number 3316928

Cited in

(49)

Undecidability of some elementary theories over PAC fields
Nonconvergence, undecidability, and intractability in asymptotic problems
The undecidability of the lattice of r. e. closed subsets of an effective topological space
Algorithmic problems and hierarchies of first-order languages
Prevarieties of associative rings whose elementary theory is decidable
Some natural structures which fail to possess a sound and decidable Hoare-like logic for their while-programs
Mal'cev's correspondence and unsolvability
Undecidability of the elementary theory of groups of measure-preserving transformations
On the theories of free solvable groups
On quasi-identities of relation algebras with Diophantine operations
Recursive inseparability of the sets of identically valid and finitely refutable formulas of some elementary theories of varieties
Tarski-type problems for free associative algebras
Elementary theories and hereditary undecidability for semilattices of numberings
Nonassociative rings with a single defining relation whose elementary theories are decidable
Decidability results for metric and layered temporal logics
A prevariety of semigroups whose elementary theory is solvable
Critical theories of varieties of nilpotent rings
Automata techniques for query inference machines
Finite queries do not have effective syntax.
Undecidability of the theory of projective planes
Degree spectra of structures
Modal definability: two commuting equivalence relations
Critical theories of certain nonassociative rings
A.D. Taimanov and model theory in Kazakhstan
The undecidability of the elementary theory of lattices of all equational theories of large signature
Succinct definitions in the first order theory of graphs
Expanded elementary and universal theories of lattice-ordered Abelian groups with a finite number of fibres
Functional equations for the functions of real variables
Well-Quasi Orders and Hierarchy Theory
The Shrinking Property for NP and coNP
A note on definability in fragments of arithmetic with free unary predicates
Median Algebra
Strong reducibilities
The Härtig quantifier: a survey
Sheaf Constructions and Their Elementary Properties
scientific article; zbMATH DE number 1154174 (Why is no real title available?)
On the studies of Gennadii Semënovich Makanin on algorithmic questions of the theory of groups and semigroups
An improved lower bound for the elementary theories of trees
The recognition complexity of decidable theories
The Undecidability of Theories of Groupoids with an Extra Predicate
The Undecidability of Theories of Groupoids with an Extra Predicate
Further generalizations of results on structures of continuous functions
Algorithmic uses of the Feferman-Vaught theorem
On the effective universality of mereological theories
Elementary invariants for quantified probability logic
The shrinking property for NP and coNP
Cartesian extensions and definition of the concept of model-theoretic property
Relatively elementary definability of the class of universal partial graphic semiautomata over nontrivial reflexive graphs in the class of semigroups
A correspondence between commutative rings and Jordan loops

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 Q5596785)