Representation theorems and theorem proving in non-classical logics

V. Sofronie-Stokkermans
Proceedings 1999 29th IEEE International Symposium on Multiple-Valued Logic (Cat. No.99CB36329)  
In this paper we present a method for automated theorem proving in non-classical logics having as algebraic models bounded distributive lattices with certain types of operators. The idea is to use a Priestley-style representation for distributive lattices with operators in order to define a class of Kripke-style models with respect to which the logic is sound and complete. If this class of Kripke-style models is elementary, it can then be used for a translation to clause form; satisfiability of
more » ... the resulting clauses can be checked by resolution. We illustrate the ideas by several examples.
doi:10.1109/ismvl.1999.779723 dblp:conf/ismvl/Sofronie-Stokkermans99 fatcat:vaq3ubi6dvgdjexhdv2q2rprre