Undecidability of the Logic of Partial Quasiary Predicates (original) (raw)

Logic Journal of the IGPL, 2021

Abstract

We obtain an effective embedding of the classical predicate logic into the logic of partial quasiary predicates. The embedding has the property that an image of a non-theorem of the classical logic is refutable in a model of the logic of partial quasiary predicates that has the same cardinality as the classical countermodel of the non-theorem. Therefore, we also obtain an embedding of the classical predicate logic of finite models into the logic of partial quasiary predicates over finite structures. As a consequence, we prove that the logic of partial quasiary predicates is undecidable—more precisely, varSigma0_1\varSigma ^0_1varSigma01-complete—over arbitrary structures and not recursively enumerable—more precisely, varPi01\varPi ^0_1varPi0_1-complete—over finite structures.

Михаил Рыбаков hasn't uploaded this paper.

Let Михаил know you want this paper to be uploaded.

Ask for this paper to be uploaded.