Maximal Kripke-type semantics for modal and superintuitionistic predicate logics (Q688796)

Many non-classical predicate logics were recently found to be incomplete with respect to the corresponding Kripke semantics with which the propositional case is complete. This has given rise to several generalizations of Kripke semantics for the first-order case such as Kripke sheaf, Kripke bundles, and functor semantics. In this paper the authors generalize such notions further. For intermediate logics and modal logics including S4 the semantical objects called Kripke metaframes are defined in a very general setting featuring ``abstract \(n\)- dimensional vectors'' which play the role of \(n\)-tuples of individuals together with some transformations of these vectors. The soundness conditions on such metaframes then are shown to be characterized purely in relational terms without any appeal to non-classical formulas, that is, the class of metaframes thus characterized is maximal in the semantics. Another remarkable feature of the metaframe semantics is that it allows us to carry on completeness proofs in a uniform method via canonical models. Thus the completeness theorems are obtained for the first-order versions (with or without constant domain axiom) of canonical (modal or intermediate) propositional logics in the sense of van Benthem. Representation theorems in the last section show that in some cases metaframes are equivalent to `Cartesian' ones in which all the vectors are \(n\)-tuples.