Computational properties of the logic of partial quasiary predicates
Михаил Николаевич Рыбаков, Dmitry Shkatov · 2020
We show that the logic of partial quasiary predicates is undecidable over arbitrary structures and not recursively enumerable over finite structures. The results are obtained by reduction from the classical predicate logic.