Switch to: References

Add citations

You must login to add citations.
  1. Semantic analysis of tense logics.S. K. Thomason - 1972 - Journal of Symbolic Logic 37 (1):150-158.
    Although we believe the results reported below to have direct philosophical import, we shall for the most part confine our remarks to the realm of mathematics. The reader is referred to [4] for a philosophically oriented discussion, comprehensible to mathematicians, of tense logic.The “minimal” tense logicT0is the system having connectives ∼, →,F(“at some future time”), andP(“at some past time”); the following axioms:(whereGandHabbreviate ∼F∼ and ∼P∼ respectively); and the following rules:(8) fromαandα → β, inferβ,(9) fromα, infer any substitution instance ofα,(10) fromα, (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   53 citations  
  • Reduction of tense logic to modal logic. I.S. K. Thomason - 1974 - Journal of Symbolic Logic 39 (3):549-551.
  • Noncompactness in propositional modal logic.S. K. Thomason - 1972 - Journal of Symbolic Logic 37 (4):716-720.
  • Synonymous logics.Francis Jeffry Pelletier & Alasdair Urquhart - 2003 - Journal of Philosophical Logic 32 (3):259-285.
    This paper discusses the general problem of translation functions between logics, given in axiomatic form, and in particular, the problem of determining when two such logics are "synonymous" or "translationally equivalent." We discuss a proposed formal definition of translational equivalence, show why it is reasonable, and also discuss its relation to earlier definitions in the literature. We also give a simple criterion for showing that two modal logics are not translationally equivalent, and apply this to well-known examples. Some philosophical morals (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   37 citations  
  • Simulation and transfer results in modal logic – a survey.Marcus Kracht & Frank Wolter - 1997 - Studia Logica 59 (2):149-177.
    This papers gives a survey of recent results about simulations of one class of modal logics by another class and of the transfer of properties of modal logics under extensions of the underlying modal language. We discuss: the transfer from normal polymodal logics to their fusions, the transfer from normal modal logics to their extensions by adding the universal modality, and the transfer from normal monomodal logics to minimal tense extensions. Likewise, we discuss simulations of normal polymodal logics by normal (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   13 citations  
  • Mathematical modal logic: A view of its evolution.Robert Goldblatt - 2003 - Journal of Applied Logic 1 (5-6):309-392.
  • First-order definability in modal logic.R. I. Goldblatt - 1975 - Journal of Symbolic Logic 40 (1):35-40.
    It is shown that a formula of modal propositional logic has precisely the same models as a sentence of the first-order language of a single dyadic predicate iff its class of models is closed under ultraproducts. as a corollary, any modal formula definable by a set of first-order conditions is always definable by a single such condition. these results are then used to show that the formula (lmp 'validates' mlp) is not first-order definable.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   16 citations  
  • Erdős graphs resolve fine's canonicity problem.Robert Goldblatt, Ian Hodkinson & Yde Venema - 2004 - Bulletin of Symbolic Logic 10 (2):186-208.
    We show that there exist 2 ℵ 0 equational classes of Boolean algebras with operators that are not generated by the complex algebras of any first-order definable class of relational structures. Using a variant of this construction, we resolve a long-standing question of Fine, by exhibiting a bimodal logic that is valid in its canonical frames, but is not sound and complete for any first-order definable class of Kripke frames (a monomodal example can then be obtained using simulation results of (...)
    Direct download (10 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  • Simulating polyadic modal logics by monadic ones.George Goguadze, Carla Piazza & Yde Venema - 2003 - Journal of Symbolic Logic 68 (2):419-462.
    We define an interpretation of modal languages with polyadic operators in modal languages that use monadic operators (diamonds) only. We also define a simulation operator which associates a logic $\Lambda^{sim}$ in the diamond language with each logic Λ in the language with polyadic modal connectives. We prove that this simulation operator transfers several useful properties of modal logics, such as finite/recursive axiomatizability, frame completeness and the finite model property, canonicity and first-order definability.
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  • An algebraic theory of normal forms.Silvio Ghilardi - 1995 - Annals of Pure and Applied Logic 71 (3):189-245.
    In this paper we present a general theory of normal forms, based on a categorial result for the free monoid construction. We shall use the theory mainly for proposictional modal logic, although it seems to have a wider range of applications. We shall formally represent normal forms as combinatorial objects, basically labelled trees and forests. This geometric conceptualization is implicit in and our approach will extend it to other cases and make it more direct: operations of a purely geometric and (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   18 citations  
  • Logic and time.John P. Burgess - 1979 - Journal of Symbolic Logic 44 (4):566-582.
  • AGM Belief Revision in Monotone Modal Logics.Gregory Wheeler - 2010 - LPAR 2010 Short Paper Proceedings.
    Classical modal logics, based on the neighborhood semantics of Scott and Montague, provide a generalization of the familiar normal systems based on Kripke semantics. This paper defines AGM revision operators on several first-order monotonic modal correspondents, where each first-order correspondence language is defined by Marc Pauly’s version of the van Benthem characterization theorem for monotone modal logic. A revision problem expressed in a monotone modal system is translated into first-order logic, the revision is performed, and the new belief set is (...)
    Direct download  
     
    Export citation  
     
    Bookmark   3 citations