Undecidability of the Logic of Partial Quasiary Predicates

DOI10.1093/JIGPAL/JZAB018MaRDI QIDQ5092565zbMATH OpenOpenAlexFDO

Authors 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

logic of parital quasiary predicatesrecursive enumerabilitysatisfiability problemundecidabilityvalidity problem

Mathematics Subject Classification ID

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

Recommendations

• Undecidability of partial order logics
• Undecidability of propositional separation logic and its neighbours
• Undecidability of modal logics of unary predicate
• Undecidable properties of extensions of the logic of provability
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• Algebras and logics of partial quasiary predicates
• Undecidable properties of extensions of provability logic. II
• scientific article; zbMATH DE number 1859179
• Nonaxiomatizability of predicate logics of proofs
• Undecidability of relation-changing modal logics

Cited in

(7)

• Undefinability in inquisitive logic with tensor
• scientific article; zbMATH DE number 4055575 (Why is no real title available?)
• scientific article; zbMATH DE number 1859179 (Why is no real title available?)
• Undecidability of QLTL and QCTL with two variables and one monadic predicate letter
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• Бинарный предикат, транзитивное замыкание, две-три переменные: сыграем в домино?
• Undecidable properties of extensions of the logic of provability

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5092565)