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)An Approach to Tense Logic.R. A. Bull - 1974 - Journal of Symbolic Logic 39 (1):173-173.
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  • Towards a general theory of action and time.James F. Allen - 1984 - Artificial Intelligence 23 (2):123-154.
    Download  
     
    Export citation  
     
    Bookmark   79 citations  
  • On a decidable generalized quantifier logic corresponding to a decidable fragment of first-order logic.Natasha Alechina - 1995 - Journal of Logic, Language and Information 4 (3):177-189.
    Van Lambalgen (1990) proposed a translation from a language containing a generalized quantifierQ into a first-order language enriched with a family of predicatesR i, for every arityi (or an infinitary predicateR) which takesQxg(x, y1,..., yn) to x(R(x, y1,..., y1) (x,y1,...,yn)) (y 1,...,yn are precisely the free variables ofQx). The logic ofQ (without ordinary quantifiers) corresponds therefore to the fragment of first-order logic which contains only specially restricted quantification. We prove that it is decidable using the method of analytic tableaux. Related (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Correspondence and Completeness for Generalized Quantifiers.Natasha Alechina & Michiel van Lambalgen - 1995 - Logic Journal of the IGPL 3 (2-3):167-190.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Dynamic Logic.Lenore D. Zuck & David Harel - 1989 - Journal of Symbolic Logic 54 (4):1480.
    Download  
     
    Export citation  
     
    Bookmark   157 citations  
  • 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   421 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   20 citations  
  • Model theory.Wilfrid Hodges - 2008 - Stanford Encyclopedia of Philosophy.
    Download  
     
    Export citation  
     
    Bookmark   144 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  
  • (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  
  • 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   69 citations  
  • Temporal logic.Nicholas Rescher - 1971 - New York,: Springer Verlag. Edited by Alasdair Urquhart.
    Download  
     
    Export citation  
     
    Bookmark   34 citations  
  • Temporal Logic.Nicholas Rescher & Alasdair Urquhart - 1971 - Philosophy of Science 42 (1):100-103.
    Download  
     
    Export citation  
     
    Bookmark   54 citations  
  • (1 other version)"Now".Arthur Prior - 1968 - Noûs 2 (2):101-119.
    Download  
     
    Export citation  
     
    Bookmark   23 citations  
  • Temporal Representation and Inference.Barry Richards, Inge Bethke, Jon Oberlander & Jaap van der Does - 1989
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • (1 other version)Now.A. N. Prior - 1968 - Noûs 2 (2):101-119.
    Download  
     
    Export citation  
     
    Bookmark   53 citations  
  • Nominal tense logic.Patrick Blackburn - 1992 - Notre Dame Journal of Formal Logic 34 (1):56-83.
    Download  
     
    Export citation  
     
    Bookmark   36 citations  
  • Past, present, and future.Arthur Prior - 1967 - Revue Philosophique de la France Et de l'Etranger 157:476-476.
    Download  
     
    Export citation  
     
    Bookmark   374 citations  
  • A Temporal Logic for Reasoning about Processes and Plans.Drew McDermott - 1982 - Cognitive Science 6 (2):101-155.
    Much previous work in artificial intelligence has neglected representing time in all its complexity. In particular, it has neglected continuous change and the indeterminacy of the future. To rectify this, I have developed a first‐order temporal logic, in which it is possible to name and prove things about facts, events, plans, and world histories. In particular, the logic provides analyses of causality, continuous change in quantities, the persistence of facts (the frame problem), and the relationship between tasks and actions. It (...)
    Download  
     
    Export citation  
     
    Bookmark   82 citations  
  • Temporal Logic.Kit Fine - 1972 - Philosophical Quarterly 22 (89):370-371.
    Download  
     
    Export citation  
     
    Bookmark   15 citations