scientific article
From MaRDI portal
Publication:3768858
zbMath0632.03001MaRDI QIDQ3768858
Yuri L. Ershov, Evgeniĭ Andreevich Palyutin
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
theorem provingpropositional logicmodel theoryset theorypredicate logicrecursive functionstheory of algorithms
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Classical first-order logic (03B10) Classical propositional logic (03B05)
Related Items
The index set of the groups autostable relative to strong constructivizations, Axiomatizability of the class of weakly injective \(S\)-acts, Universal equivalence of general and special linear groups over fields, Elementary definability of the class of universal planar automata in the class of semigroups, On model-theoretical properties in the sense of Peretyat’kin, o-minimality, and mutually interpretable theories, On axiomatizability of the class of finitary matroids and decidability of their universal theory, Theories of relatively free solvable groups with extra predicate, Axiomatizability and completeness of the class of injective acts over a commutative monoid or a group, Index Sets of Constructive Models that are Autostable Under Strong Constructivizations, Turing computability: structural theory, On algebras of distributions of binary isolating formulas for theories of abelian groups and their ordered enrichments, Model-theoretic properties of Turing degrees in the Ershov difference hierarchy, Tarski’s problem about the elementary theory of free groups has a positive solution, Implicit expressibility in multiple-valued logic
