## Representation Theorems and the Semantics of Non-Classical Logics , and Applications to Automated Theorem Proving (2002)

Citations: | 4 - 2 self |

### BibTeX

@MISC{Sofronie-stokkermans02representationtheorems,

author = {Viorica Sofronie-stokkermans},

title = {Representation Theorems and the Semantics of Non-Classical Logics , and Applications to Automated Theorem Proving},

year = {2002}

}

### OpenURL

### Abstract

We give a uniform presentation of representation and decidability results related to the Kripke-style semantics of several nonclassical logics. We show that a general representation theorem (which has as particular instances the representation theorems as algebras of sets for Boolean algebras, distributive lattices and semilattices) extends in a natural way to several classes of operators and allows to establish a relationship between algebraic and Kripke-style models. We illustrate the ideas on several examples. We conclude by showing how the Kripkestyle models thus obtained can be used (if rst-order axiomatizable) for automated theorem proving by resolution for some non-classical logics.