I PRIKLADNAYA MATEMATIKA
(FUNDAMENTAL AND APPLIED MATHEMATICS)
1998, VOLUME 4, NUMBER 2, PAGES 733-749
Decidable first order logics
R. E. Yavorsky
View as HTML
View as gif image
View as LaTeX source
The logic of arbitrary first order
is the set of predicate formulae, provable in under every
interpretation into the language of .
It is proved, that for the theory of equation and the theory of dense
linear order without minimal and maximal elements is
decidable, but can not be axiomatized by any set of schemes with
On the other hand, for most of the expressively strong theories
turn out to be undecidable.
All articles are
published in Russian.
Last modified: June 17, 1998