Algorithmic Methods for Non-Classical Logics

Dimiter Georgiev
The scope of the dissertation is to define a deterministic version of the SQEMA algorithm, to show that it still succeeds on the two well-known classes of elementary modal formulas – the Sahlqvist and Inductive classes, and to show some modal and first-order definability results for two classes of Kripke frames, which are interesting in the area of artificial intelligence, namely, the KD45-frames and the Euclidean frames.
doi:10.6084/m9.figshare.14394656.v2 fatcat:zcwfcslqbvewdjgv4jqhcug3ou