Switch to: Citations

Add references

You must login to add references.
  1. Modal Logic: An Introduction.Brian F. Chellas - 1980 - New York: Cambridge University Press.
    A textbook on modal logic, intended for readers already acquainted with the elements of formal logic, containing nearly 500 exercises. Brian F. Chellas provides a systematic introduction to the principal ideas and results in contemporary treatments of modality, including theorems on completeness and decidability. Illustrative chapters focus on deontic logic and conditionality. Modality is a rapidly expanding branch of logic, and familiarity with the subject is now regarded as a necessary part of every philosopher's technical equipment. Chellas here offers an (...)
    Download  
     
    Export citation  
     
    Bookmark   436 citations  
  • Moment/History Duality in Prior’s Logics of Branching-Time.Alberto Zanardo - 2006 - Synthese 150 (3):483-507.
    The basic notions in Prior's Ockhamist and Peircean logics of branching-time are the notion of moment and that of history. In the tree semantics, histories are defined as maximal linearly ordered sets of moments. In the geometrical approach, both moments and histories are primitive entities and there is no set theoretical dependency of the latter on the former. In the topological approach, moments can be defined as the elements of a rank 1 base of a non-Archimedean topology on the set (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Temporal Logic: Mathematical Foundations and Computational Aspects.Dov M. Gabbay, Ian Hodkinson & Mark A. Reynolds - 1994 - Oxford University Press on Demand.
    This much-needed book provides a thorough account of temporal logic, one of the most important areas of logic in computer science today. The book begins with a solid introduction to semantical and axiomatic approaches to temporal logic. It goes on to cover predicate temporal logic, meta-languages, general theories of axiomatization, many dimensional systems, propositional quantifiers, expressive power, Henkin dimension, temporalization of other logics, and decidability results. With its inclusion of cutting-edge results and unifying methodologies, this book is an indispensable reference (...)
    Download  
     
    Export citation  
     
    Bookmark   39 citations  
  • Review: Michael O. Rabin, Decidability of Second-order Theories and Automata on Infinite Trees. [REVIEW]Dirk Siefkes - 1972 - Journal of Symbolic Logic 37 (3):618-619.
    Download  
     
    Export citation  
     
    Bookmark   29 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   306 citations  
  • Combinations of tense and modality for predicate logic.Stefan Wölfl - 1999 - Journal of Philosophical Logic 28 (4):371-398.
    In recent years combinations of tense and modality have moved intothe focus of logical research. From a philosophical point of view, logical systems combining tense and modality are of interest because these logics have a wide field of application in original philosophical issues, for example in the theory of causation, of action, etc. But until now only methods yielding completeness results for propositional languages have been developed. In view of philosophical applications, analogous results with respect to languages of predicate logic (...)
    Download  
     
    Export citation  
     
    Bookmark   15 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 and Temporal Logics.Colin P. Stirling - 1991 - LFCS, Department of Computer Science, University of Edinburgh.
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  • Propositional Q-Logic.Wolfl Stefan - 2002 - Journal of Philosophical Logic 31 (5):387-414.
    Topic of the paper is Q-logic – a logic of agency in its temporal and modal context. Q-logic may be considered as a basal logic of agency since the most important stit-operators discussed in the literature can be defined or axiomatized easily within its semantical and syntactical framework. Its basic agent dependent operator, the Q-operator (also known as Δ- or cstit-operator), which has been discussed independently by F. v. Kutschera and B. F. Chellas, is investigated here in respect of its (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Axiomatization of 'peircean' branching-time logic.Alberto Zanardo - 1990 - Studia Logica 49 (2):183 - 195.
    The branching-time logic called Peircean by Arthur Prior is considered and given an infinite axiomatization. The axiomatization uses only the standard deduction rules for tense logic.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Topological aspects of branching-time semantics.Michela Sabbadin & Alberto Zanardo - 2003 - Studia Logica 75 (3):271 - 286.
    The aim of this paper is to present a new perspective under which branching-time semantics can be viewed. The set of histories (maximal linearly ordered sets) in a tree structure can be endowed in a natural way with a topological structure. Properties of trees and of bundled trees can be expressed in topological terms. In particular, we can consider the new notion of topological validity for Ockhamist temporal formulae. It will be proved that this notion of validity is equivalent to (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Logic and time.John P. Burgess - 1979 - Journal of Symbolic Logic 44 (4):566-582.
    Download  
     
    Export citation  
     
    Bookmark   43 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  
  • Modal Logic. An Introduction.Zia Movahed - 2002 - Tehran: Hermes Publishers.
    Download  
     
    Export citation  
     
    Bookmark   83 citations  
  • Past, Present and Future.L. Jonathan Cohen - 1970 - Philosophical Quarterly 20 (78):83-84.
    Download  
     
    Export citation  
     
    Bookmark   35 citations  
  • Temporal patterns and modal structure.J. van Benthem - 1999 - Logic Journal of the IGPL 7 (1):7-26.
    Temporal logic arose at the border of philosophy and linguistics. From the seventies onward, it because a major tool also in computer science and artificial intelligence, which have turned into the most powerful source of new logical developments since. We discuss some recent themes demonstrating new connections with modal logic. In the course of this, we also point out some new types of open research questions.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • The unreal future.John P. Burgess - 1978 - Theoria 44 (3):157-179.
    Perhaps if the future existed, concretely and individually, as something that could be discerned by a better brain, the past would not be so seductive: its demands would he balanced by those of the future. Persons might then straddle the middle stretch of the seesaw when considering this or that object. It might be fun. But the future has no such reality (as the pictured past and the perceived present possess); the future is but a figure of speech, a specter (...)
    Download  
     
    Export citation  
     
    Bookmark   26 citations  
  • An axiomatization of full computation tree logic.M. Reynolds - 2001 - Journal of Symbolic Logic 66 (3):1011-1057.
    We give a sound and complete axiomatization for the full computation tree logic, CTL*, of R-generable models. This solves a long standing open problem in branching time temporal logic.
    Download  
     
    Export citation  
     
    Bookmark   21 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  
  • 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  
  • Propositional q-logic.Stefan Wölfl - 2002 - Journal of Philosophical Logic 31 (5):387-414.
    Topic of the paper is Q-logic - a logic of agency in its temporal and modal context. Q-logic may be considered as a basal logic of agency since the most important stitoperators discussed in the literature can be defined or axiomatized easily within its semantical and syntactical framework. Its basic agent dependent operator, the Q-operator (also known as Δ- or cstit-operator), which has been discussed independently by E v. Kutschera and B. E Chellas, is investigated here in respect of its (...)
    Download  
     
    Export citation  
     
    Bookmark   9 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  
  • Past, Present and Future.Arthur N. Prior - 1967 - Oxford, GB: Oxford University Press.
    Surveys and extens work that has been done in the past two years on 'tense logic' and is a sequel to the author's book, Time and Modality.
    Download  
     
    Export citation  
     
    Bookmark   254 citations  
  • Completeness in the theory of types.Leon Henkin - 1950 - Journal of Symbolic Logic 15 (2):81-91.
    Download  
     
    Export citation  
     
    Bookmark   202 citations  
  • Moment/History Duality in Prior’s Logics of Branching-Time.Alberto Zanardo - 2006 - Synthese 150 (3):483 - 507.
    The basic notions in Prior’s Ockhamist and Peircean logics of branching-time are the notion of moment and that of history (or course of events). In the tree semantics, histories are defined as maximal linearly ordered sets of moments. In the geometrical approach, both moments and histories are primitive entities and there is no set theoretical (and ontological) dependency of the latter on the former. In the topological approach, moments can be defined as the elements of a rank 1 base of (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations