Switch to: Citations

Add references

You must login to add references.
  1. (1 other version)An approach to tense logic.R. A. Bull - 1970 - Theoria 36 (3):282-300.
    The author's motivation for constructing the calculi of this paper\nis so that time and tense can be "discussed together in the same\nlanguage" (p. 282). Two types of enriched propositional caluli for\ntense logic are considered, both containing ordinary propositional\nvariables for which any proposition may be substituted. One type\nalso contains "clock-propositional" variables, a,b,c, etc., for\nwhich only clock-propositional variables may be substituted and that\ncorrespond to instants or moments in the semantics. The other type\nalso contains "history-propositional" variables, u,v,w, etc., for\nwhich only history-propositional variables may (...)
    Download  
     
    Export citation  
     
    Bookmark   28 citations  
  • (1 other version)Past, present and future.Arthur N. Prior - 1967 - Oxford,: Clarendon P..
    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   306 citations  
  • Branching space-time.Nuel Belnap - 1992 - Synthese 92 (3):385 - 434.
    Branching space-time is a simple blend of relativity and indeterminism. Postulates and definitions rigorously describe the causal order relation between possible point events. The key postulate is a version of everything has a causal origin; key defined terms include history and choice point. Some elementary but helpful facts are proved. Application is made to the status of causal contemporaries of indeterministic events, to how splitting of histories happens, to indeterminism without choice, and to Einstein-Podolsky-Rosen distant correlations.
    Download  
     
    Export citation  
     
    Bookmark   143 citations  
  • Axiomatizations with context rules of inference in modal logic.Valentin Goranko - 1998 - Studia Logica 61 (2):179-197.
    A certain type of inference rules in modal logics, generalizing Gabbay's Irreflexivity rule, is introduced and some general completeness results about modal logics axiomatized with such rules are proved.
    Download  
     
    Export citation  
     
    Bookmark   9 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   26 citations  
  • Decidability for branching time.John P. Burgess - 1980 - Studia Logica 39 (2-3):203-218.
    The species of indeterminist tense logic called Peircean by A. N. Prior is proved to be recursively decidable.
    Download  
     
    Export citation  
     
    Bookmark   31 citations  
  • An irreflexivity lemma with applications to axiomatizations of conditions on tense frames.Dov M. Gabbay - 1981 - In Uwe Mönnich (ed.), Aspects of Philosophical Logic: Some Logical Forays Into Central Notions of Linguistics and Philosophy. Dordrecht, Netherland: Dordrecht. pp. 67--89.
    Download  
     
    Export citation  
     
    Bookmark   47 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   14 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   68 citations  
  • (1 other version)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   33 citations  
  • A Gabbay-Rule Free Axiomatization of T×W Validity.Maria Concetta Di Maio & Alberto Zanardo - 1998 - Journal of Philosophical Logic 27 (5):435-487.
    The semantical structures called T×W frames were introduced in (Thomason, 1984) for the Ockhamist temporal-modal language, ℒO, which consists of the usual propositional language augmented with the Priorean operators P and F and with a possibility operator ⋄. However, these structures are also suitable for interpreting an extended language, ℒSO, containing a further possibility operator ⋄s which expresses synchronism among possibly incompatible histories and which can thus be thought of as a cross-history ‘simultaneity’ operator. In the present paper we provide (...)
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • A complete deductive-system for since-until branching-time logic.Alberto Zanardo - 1991 - Journal of Philosophical Logic 20 (2):131 - 148.
    Download  
     
    Export citation  
     
    Bookmark   11 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   37 citations  
  • (1 other version)An Approach to Tense Logic.R. A. Bull - 1974 - Journal of Symbolic Logic 39 (1):173-173.
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  • Modal and Temporal Logics.Colin Stirling - 1991 - LFCS, Department of Computer Science, University of Edinburgh.
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  • Undivided and indistinguishable histories in branching-time logics.Alberto Zanardo - 1998 - Journal of Logic, Language and Information 7 (3):297-315.
    In the tree-like representation of Time, two histories are undivided at a moment t whenever they share a common moment in the future of t. In the present paper, it will first be proved that Ockhamist and Peircean branching-time logics are unable to express some important sentences in which the notion of undividedness is involved. Then, a new semantics for branching-time logic will be presented. The new semantics is based on trees endowed with an indistinguishability function, a generalization of the (...)
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Logic and time.John P. Burgess - 1979 - Journal of Symbolic Logic 44 (4):566-582.
    Download  
     
    Export citation  
     
    Bookmark   43 citations  
  • Past, present, and future.Arthur Prior - 1967 - Revue Philosophique de la France Et de l'Etranger 157:476-476.
    Download  
     
    Export citation  
     
    Bookmark   370 citations  
  • (1 other version)The modal logic of inequality.Maarten de Rijke - 1992 - Journal of Symbolic Logic 57 (2):566-584.
    We consider some modal languages with a modal operator $D$ whose semantics is based on the relation of inequality. Basic logical properties such as definability, expressive power and completeness are studied. Also, some connections with a number of other recent proposals to extend the standard modal language are pointed at.
    Download  
     
    Export citation  
     
    Bookmark   40 citations  
  • Nominal tense logic.Patrick Blackburn - 1992 - Notre Dame Journal of Formal Logic 34 (1):56-83.
    Download  
     
    Export citation  
     
    Bookmark   36 citations  
  • A finite axiomatization of the set of strongly valid ockhamist formulas.Alberto Zanardo - 1985 - Journal of Philosophical Logic 14 (4):447 - 468.
    Download  
     
    Export citation  
     
    Bookmark   30 citations  
  • Modality and quantification in S5.A. N. Prior - 1956 - Journal of Symbolic Logic 21 (1):60-62.
    Download  
     
    Export citation  
     
    Bookmark   54 citations