39 research outputs found
Changing a semantics: opportunism or courage?
The generalized models for higher-order logics introduced by Leon Henkin, and
their multiple offspring over the years, have become a standard tool in many
areas of logic. Even so, discussion has persisted about their technical status,
and perhaps even their conceptual legitimacy. This paper gives a systematic
view of generalized model techniques, discusses what they mean in mathematical
and philosophical terms, and presents a few technical themes and results about
their role in algebraic representation, calibrating provability, lowering
complexity, understanding fixed-point logics, and achieving set-theoretic
absoluteness. We also show how thinking about Henkin's approach to semantics of
logical systems in this generality can yield new results, dispelling the
impression of adhocness. This paper is dedicated to Leon Henkin, a deep
logician who has changed the way we all work, while also being an always open,
modest, and encouraging colleague and friend.Comment: 27 pages. To appear in: The life and work of Leon Henkin: Essays on
his contributions (Studies in Universal Logic) eds: Manzano, M., Sain, I. and
Alonso, E., 201
Admissible Bases Via Stable Canonical Rules
We establish the dichotomy property for stable canonical multi-conclusion rules for IPC, K4, and S4. This yields an alternative proof of existence of explicit bases of admissible rules for these logics
Undecidability of the unification and admissibility problems for modal and description logics
We show that the unification problem “is there a substitution instance of a given formula that is provable in a given logic?” is undecidable for basic modal logics K and K4 extended with the universal modality. It follows that the admissibility problem for inference rules is undecidable for these logics as well. These are the first examples of standard decidable modal logics for which the unification and admissibility problems are undecidable. We also prove undecidability of the unification and admissibility problems for K and K4 with at least two modal operators and nominals (instead of the universal modality), thereby showing that these problems are undecidable for basic hybrid logics. Recently, unification has been introduced as an important reasoning service for description logics. The undecidability proof for K with nominals can be used to show the undecidability of unification for Boolean description logics with nominals (such as ALCO and SHIQO). The undecidability proof for K with the universal modality can be used to show that the unification problem relative to role boxes is undecidable for Boolean description logics with transitive roles, inverse roles, and role hierarchies (such as SHI and SHIQ)
A Note on Axiomatisations of Two-Dimensional Modal Logics
Abstract. We analyse the role of the modal axiom corresponding to the first-order formula “∃y (x = y) ” in axiomatisations of two-dimensional propositional modal logics. One of the several possible connections between propositional multi-modal logics and classical first-order logic is to consider finite variable fragments of the latter as ‘multi-dimensional ’ modal formalisms: First-order variable-assignment tuples are regarded as possible worlds in Kripke frames, and each first-order quantification ∃vi and ∀vi as ‘coordinate-wise ’ modal operators ✸i and ✷i in these frames. This view is implicit in the algebraisation of finite variable fragments using finite dimensional cylindric algebras [6], and is made explicit in [15, 12]. Here we look at axiomatisation questions for the two-dimensional case from this modal perspective. (For basic notions in modal logic and its Kripke semantics, consult e.g. [2, 3].) We consider the propositional multi-modal language ML δ 2 having the usual Boolean operators, unary modalities ✸0 and ✸1 (an