Switch to: Citations

Add references

You must login to add references.
  1. Hybrid Completeness.P. Blackburn & M. Tzakova - 1998 - Logic Journal of the IGPL 6 (4):625-650.
    In this paper we discuss two hybrid languages, ℒ and ℒ, and provide them with complete axiomatizations. Both languages combine features of modal and classical logic. Like modal languages, they contain modal operators and have a Kripke semantics. Unlike modal languages, in these systems it is possible to 'label' states by using A and ↓ to bind special state variables.This paper explores the consequences of hybridization for completeness. As we shall show, the challenge is to blend the modal idea of (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Past, Present and Future.Arthur Prior - 1967 - Clarendon Press.
    But Findlay's remark, like so much that has been written on the subject of time in the present century, was provoked in the first place by McTaggart's ...
    Download  
     
    Export citation  
     
    Bookmark   178 citations  
  • Modal Logic with Names.George Gargov & Valentin Goranko - 1993 - Journal of Philosophical Logic 22 (6):607 - 636.
    We investigate an enrichment of the propositional modal language L with a "universal" modality ■ having semantics x ⊧ ■φ iff ∀y(y ⊧ φ), and a countable set of "names" - a special kind of propositional variables ranging over singleton sets of worlds. The obtained language ℒ $_{c}$ proves to have a great expressive power. It is equivalent with respect to modal definability to another enrichment ℒ(⍯) of ℒ, where ⍯ is an additional modality with the semantics x ⊧ ⍯φ (...)
    Download  
     
    Export citation  
     
    Bookmark   46 citations  
  • Hierarchies of Modal and Temporal Logics with Reference Pointers.Valentin Goranko - 1996 - Journal of Logic, Language and Information 5 (1):1-24.
    We introduce and study hierarchies of extensions of the propositional modal and temporal languages with pairs of new syntactic devices: point of reference-reference pointer which enable semantic references to be made within a formula. We propose three different but equivalent semantics for the extended languages, discuss and compare their expressiveness. The languages with reference pointers are shown to have great expressive power (especially when their frugal syntax is taken into account), perspicuous semantics, and simple deductive systems. For instance, Kamp's and (...)
    Download  
     
    Export citation  
     
    Bookmark   20 citations  
  • Derivation Rules as Anti-Axioms in Modal Logic.Yde Venema - 1993 - Journal of Symbolic Logic 58 (3):1003-1034.
    We discuss a `negative' way of defining frame classes in (multi)modal logic, and address the question of whether these classes can be axiomatized by derivation rules, the `non-ξ rules', styled after Gabbay's Irreflexivity Rule. The main result of this paper is a metatheorem on completeness, of the following kind: If Λ is a derivation system having a set of axioms that are special Sahlqvist formulas and Λ+ is the extension of Λ with a set of non-ξ rules, then Λ+ is (...)
    Download  
     
    Export citation  
     
    Bookmark   24 citations  
  • Branching-Time Logic with Quantification Over Branches: The Point of View of Modal Logic.Alberto Zanardo - 1996 - Journal of Symbolic Logic 61 (1):1-39.
    In Ockhamist branching-time logic [Prior 67], formulas are meant to be evaluated on a specified branch, or history, passing through the moment at hand. The linguistic counterpart of the manifoldness of future is a possibility operator which is read as `at some branch, or history (passing through the moment at hand)'. Both the bundled-trees semantics [Burgess 79] and the $\langle moment, history\rangle$ semantics [Thomason 84] for the possibility operator involve a quantification over sets of moments. The Ockhamist frames are (3-modal) (...)
    Download  
     
    Export citation  
     
    Bookmark   24 citations  
  • The Decision Problem for Branching Time Logic.Yuri Gurevich & Saharon Shelah - 1985 - Journal of Symbolic Logic 50 (3):668-681.
    The theory of trees with additional unary predicates and quantification over nodes and branches embraces a rich branching time logic. This theory was reduced in the companion paper to the first-order theory of binary, bounded, well-founded trees with additional unary predicates. Here we prove the decidability of the latter theory.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • A First-Order Axiomatization of the Theory of Finite Trees.Rolf Backofen, James Rogers & K. Vijay-Shanker - 1995 - Journal of Logic, Language and Information 4 (1):5-39.
    We provide first-order axioms for the theories of finite trees with bounded branching and finite trees with arbitrary (finite) branching. The signature is chosen to express, in a natural way, those properties of trees most relevant to linguistic theories. These axioms provide a foundation for results in linguistics that are based on reasoning formally about such properties. We include some observations on the expressive power of these theories relative to traditional language complexity classes.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Hybrid Languages.Patrick Blackburn & Jerry Seligman - 1995 - Journal of Logic, Language and Information 4 (3):251-272.
    Hybrid languages have both modal and first-order characteristics: a Kripke semantics, and explicit variable binding apparatus. This paper motivates the development of hybrid languages, sketches their history, and examines the expressive power of three hybrid binders. We show that all three binders give rise to languages strictly weaker than the corresponding first-order language, that full first-order expressivity can be gained by adding the universal modality, and that all three binders can force the existence of infinite models and have undecidable satisfiability (...)
    Download  
     
    Export citation  
     
    Bookmark   31 citations  
  • Past, present and future.Arthur Prior - 1967 - Revue Philosophique de la France Et de l'Etranger 157:476-476.
    Download  
    Translate
     
     
    Export citation  
     
    Bookmark   214 citations  
  • An Irreflexivity Lemma with Applications to Axiomatizations of Conditions on Tense Frames.Dov M. Gabbay - 1981 - In U. Mönnich (ed.), Aspects of Philosophical Logic. Dordrecht. pp. 67--89.
    Download  
     
    Export citation  
     
    Bookmark   36 citations  
  • Zooming in, Zooming Out.Patrick Blackburn & Maarten De Rijke - 1997 - Journal of Logic, Language and Information 6 (1):5-31.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • [Omnibus Review].Robert Goldblatt - 1986 - Journal of Symbolic Logic 51 (1):225-227.
    Download  
     
    Export citation  
     
    Bookmark   52 citations