Complexity function and complexity of validity of modal and superintuitionistic propositional logics

DOI10.1093/LOGCOM/EXAC085MaRDI QIDQ6189216zbMATH OpenFDO

Authors Mikhail Rybakov, Dmitry Shkatov

Publication date 8 February 2024

Published in Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/LOGCOM/EXAC085

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Computer science (68-XX)

Cited in

(2)

• Algorithmic properties of modal and superintuitionistic logics of monadic predicates over finite Kripke frames
• Variations on the Kripke trick

This page was built for publication: Complexity function and complexity of validity of modal and superintuitionistic propositional logics

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