Modal Consequence Relations Extending S4.3: An Application of Projective Unification

We characterize all finitary consequence relations over $\mathbf{S4.3}$ , both syntactically, by exhibiting so-called (admissible) passive rules that extend the given logic, and semantically, by providing suitable strongly adequate classes of algebras. This is achieved by applying an earlier result stating that a modal logic $L$ extending $\mathbf{S4}$ has projective unification if and only if $L$ contains $\mathbf{S4.3}$ . In particular, we show that these consequence relations enjoy the strong finite model property, and are finitely based. In this way, we extend the known results by Bull and Fine, from logics, to consequence relations. We also show that the lattice of consequence relation…

Unification in superintuitionistic predicate logics and its applications

AbstractWe introduce unification in first-order logic. In propositional logic, unification was introduced by S. Ghilardi, see Ghilardi (1997, 1999, 2000). He successfully applied it in solving systematically the problem of admissibility of inference rules in intuitionistic and transitive modal propositional logics. Here we focus on superintuitionistic predicate logics and apply unification to some old and new problems: definability of disjunction and existential quantifier, disjunction and existential quantifier under implication, admissible rules, a basis for the passive rules, (almost) structural completeness, etc. For this aim we apply modified specific notions, introduced in proposition…

Unification in first-order transitive modal logic

We introduce unification in first-order transitive modal logics, i.e. logics extending Q–K4, and apply it to solve some problems such as admissibility of rules. Unifiable formulas in some extensions of Q–K4 are characterized and an explicit basis for the passive rules (those with non-unifiable premises) is provided. Both unifiability and passive rules depend on the number of logical constants in the logic; we focus on extensions of Q–K4 with at most four constants ⊤,⊥,□⊥,◊⊤⁠. Projective formulas, defined in a way similar to propositional logic, are used to solve some questions concerning the disjunction and existence properties. A partial characterization of first-order modal logics with pr…

Finitary unification in locally tabular modal logics characterized

We provide necessary and sufficient conditions for finitary unification in locally tabular modal logics, solely in terms of Kripke models. We apply the conditions to establish the unification types of logics determined by simple finite frames. In particular, we show that unification is finitary (or unitary) in the logic determined by the fork (frame F4, see Fig. 6), the rhombus (frame F5), inGL.3m,GrzBd2,S4Bd2and other logics; whereas it is nullary in the logic of F6, and of the pentagon FN5. In Appendix analogous results are given for superintuitionistic logics.

Almost structurally complete infinitary consequence operations extending S4.3