Undecidability of the Logic of Partial Quasiary Predicates

DOI10.1093/jigpal/jzab018zbMath1494.03076OpenAlexW3165422239MaRDI QIDQ5092565

Mikhail Rybakov, Dmitry Shkatov

Publication date: 22 July 2022

Published in: Logic Journal of the IGPL (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/jigpal/jzab018

zbMATH Keywords

undecidabilitysatisfiability problemrecursive enumerabilityvalidity problemlogic of parital quasiary predicates

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Logic in computer science (03B70) Decidability of theories and sets of sentences (03B25)

Related Items (2)

Undecidability of QLTL and QCTL with two variables and one monadic predicate letter ⋮ Бинарный предикат, транзитивное замыкание, две-три переменные: сыграем в домино?

This page was built for publication: Undecidability of the Logic of Partial Quasiary Predicates