|
Vestnik TVGU. Seriya: Prikladnaya Matematika [Herald of Tver State University. Series: Applied Mathematics], 2014, Issue 4, Pages 17–32
(Mi vtpmk99)
|
|
|
|
Theoretical Foundations of Computer Science
On undecidability of logic of quasiary predicates
M. N. Rybakov Tver State University
Abstract:
A translation from the first-order language to the language of the logic of quasiary predicates is constructed. The translation preserves satisfiability of formulas in classes of models defined on the same sets of elements. As a corollary we obtain that the logic of quasiary predicates is undecidable, the finite model theory of quasiary predicates is not recursively enumerable, etc.
Keywords:
logic of quasiary predicates, undecidability, recursive enumerability.
Received: 22.11.2014
Linking options:
https://www.mathnet.ru/eng/vtpmk99
|
Statistics & downloads: |
Abstract page: | 28 |
|