In [STU 00, KUT 03] we introduced a family of ‘modal' languages intended for talking about distances. These languages are interpreted in ‘distance spaces' which satisfy some of the standard axioms of metric spaces. Among other things, we singled out decidable logics of distance spaces and proved expressive completeness results relating classical and modal languages. The aim of this paper is to axiomatize the modal fragments of the semantically defined distance logics of [KUT 03] and give a new proof of (...) their decidability. (shrink)

Standard models for model predicate logic consist of a Kripke frame whose worlds come equipped with relational structures. Both modal and two-sorted predicate logic are natural languages for speaking about such models. In this paper we compare their expressivity. We determine a fragment of the two-sorted language for which the modal language is expressively complete on S5-models. Decidable criteria for modal definability are presented.

This collection includes twenty original philosophical essays in honour of Wolfgang Spohn. The contributions mirror the scope of Wolfgang Spohn’s work. They address topics from epistemology (e.g., the theory of ranking functions, belief revision, and the nature of knowledge and belief), philosophy of science (e.g., causation, induction, and laws of nature), the philosophy of language (e.g., the theory of meaning and the semantics of counterfactuals), and the philosophy of mind (e.g., intentionality and free will), as well as problems of ontology, (...) logic, the theory of practical rationality, and meta-philosophy. ― Contributors: Ansgar Beckermann, Wolfgang Benkewitz, Bernd Buldt, Ralf Busse, Christoph Fehige, Wolfgang Freitag, Gordian Haas, Volker Halbach, Franz Huber, Andreas Kemmerling, Manfred Kupffer, Hannes Leitgeb, Godehard Link, Arthur Merin, Thomas Müller, Julian Nida-Rümelin, Martine Nida-Rümelin, Hans Rott, Holger Sturm, Thomas Ede Zimmermann, Alexandra Zinke. (shrink)

In this paper we deal with the logic ${\cal M\kern-1pt L}_{\omega_1}$ which is the infinitary extension of propositional modal logic that has conjunctions and disjunctions only for countable sets of formulas. After introducing some basic concepts and tools from modal logic, we modify Makkai's generalization of the notion of consistency property to make it fit for modal purposes. Using this construction as a universal instrument, we prove, among other things, interpolation for ${\cal M\kern-1pt L}_{\omega_1}$ as well as preservation results for (...) universal, existential, and positive ${\cal M\kern-1pt L}_{\omega_1}$-formulas. (shrink)

The aim of this paper is to construct a tableau decision algorithm for the modal description logic K ALC with constant domains. More precisely, we present a tableau procedure that is capable of deciding, given an ALC-formula with extra modal operators (which are applied only to concepts and TBox axioms, but not to roles), whether is satisfiable in a model with constant domains and arbitrary accessibility relations. Tableau-based algorithms have been shown to be practical even for logics of rather high (...) complexity. This gives us grounds to believe that, although the satisfiability problem for K ALC is known to be NEXPTIME-complete, by providing a tableau decision algorithm we demonstrate that highly expressive description logics with modal operators have a chance to be implementable. The paper gives a solution to an open problem of Baader and Laux [5]. (shrink)

Dealing with topics of definability, this paper provides some interesting insights into the expressive power of basic modal logic. After some preliminary work it presents an abstract algebraic characterization of the elementary classes of basic modal logic, that is, of the classes of models that are definable by means of (sets of) basic modal formulas. Taking that for a start, the paper further contains characterization results for modal universal classes and modal positive classes.

Name der Zeitschrift: Archiv für Geschichte der Philosophie Jahrgang: 97 Heft: 2 Seiten: 234-260.

In this paper we deal with the logic which is the infinitary extension of propositional modal logic that has conjunctions and disjunctions only for countable sets of formulas. After introducing some basic concepts and tools from modal logic, we modify Makkai's generalization of the notion of consistency property to make it fit for modal purposes. Using this construction as a universal instrument, we prove, among other things, interpolation for as well as preservation results for universal, existential, and positive -formulas.

This paper deals with modal Horn formulas. It contains a characterization of the classes of models definable by modal universal Horn formulas as well as a preservation result for modal universal Horn formulas.

The aim of this paper is to establish a new notion of equivalencebetween temporal models, so-called S-similarity, as the appropriate notionof bisimilarity for temporal logic with Since and Until. The main technicalresults of the paper provide semantical characterizations of the first-orderformulas that are equivalent to a temporal formula: Theorem 3.7 concernsthe equivalence of temporal and first-order formulas with respect to pointedtemporal models, whereas Theorem 4.4 takes the level of temporal modelsinto account.