Algorithmic Correspondence and Completeness in Modal Logic. II. Polyadic and Hybrid Extensions of the Algorithm SQEMA - researchr publication

researchr

You are not signed in
Sign in
Sign up

Willem Conradie, Valentin Goranko, Dimiter Vakarelov. Algorithmic Correspondence and Completeness in Modal Logic. II. Polyadic and Hybrid Extensions of the Algorithm SQEMA. Journal of Logic and Computation, 16(5):579-612, 2006. [doi]

Abstract is missing.

runs on WebDSL