Switch to: References

Citations of:

An essay in classical modal logic

Uppsala,: Filosofiska föreningen och Filosofiska institutionen vid Uppsala universitet (1971)

Add citations

You must login to add citations.
  1. Quantification in Some Non-normal Modal Logics.Erica Calardo & Antonino Rotolo - 2017 - Journal of Philosophical Logic 46 (5):541-576.
    This paper offers a semantic study in multi-relational semantics of quantified N-Monotonic modal logics with varying domains with and without the identity symbol. We identify conditions on frames to characterise Barcan and Ghilardi schemata and present some related completeness results. The characterisation of Barcan schemata in multi-relational frames with varying domains shows the independence of BF and CBF from well-known propositional modal schemata, an independence that does not hold with constant domains. This fact was firstly suggested for classical modal systems (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Temporal logic of surjective bounded morphisms between finite linear processes.David Gabelaia, Evgeny Kuznetsov, Radu Casian Mihailescu, Konstantine Razmadze & Levan Uridia - 2024 - Journal of Applied Non-Classical Logics 34 (1):1-30.
    In this paper, we study temporal logic for finite linear structures and surjective bounded morphisms between them. We give a characterisation of such structures by modal formulas and show that every pair of linear structures with a bounded morphism between them can be uniquely characterised by a temporal formula up to an isomorphism. As the main result, we prove Kripke completeness of the logic with respect to the class of finite linear structures with bounded morphisms between them.
    Download  
     
    Export citation  
     
    Bookmark  
  • Post Completeness in Congruential Modal Logics.Peter Fritz - 2016 - In Lev Beklemishev, Stéphane Demri & András Máté (eds.), Advances in Modal Logic, Volume 11. CSLI Publications. pp. 288-301.
    Well-known results due to David Makinson show that there are exactly two Post complete normal modal logics, that in both of them, the modal operator is truth-functional, and that every consistent normal modal logic can be extended to at least one of them. Lloyd Humberstone has recently shown that a natural analog of this result in congruential modal logics fails, by showing that not every congruential modal logic can be extended to one in which the modal operator is truth-functional. As (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • A perspective on modal sequent logic.Stephen Blamey & Lloyd Humberstone - 1991 - Publications of the Research Institute for Mathematical Sciences 27 (5):763-782.
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • On the Axiomatisation of Elgesem's Logic of Agency and Ability.Guido Governatori & Antonino Rotolo - 2005 - Journal of Philosophical Logic 34 (4):403-431.
    In this paper we show that the Hilbert system of agency and ability presented by Dag Elgesem is incomplete with respect to the intended semantics. We argue that completeness result may be easily regained. Finally, we shortly discuss some issues related to the philosophical intuition behind his approach. This is done by examining Elgesem's modal logic of agency and ability using semantics with different flavours.
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • (1 other version)Strict Implication in A Sequence of Extensions of S4.Dolph Ulrich - 1981 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 27 (13-14):201-212.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Modal Formulas True at Some Point in Every Model.Lloyd Humberstone - 2008 - Australasian Journal of Logic 6:70-82.
    In a paper on the logical work of the Jains, Graham Priest considers a consequence relation, semantically characterized, which has a natural analogue in modal logic. Here we give a syntactic/axiomatic description of the modal formulas which are consequences of the empty set by this relation, which is to say: those formulas which are, for every model, true at some point in that model.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • The polytopologies of transfinite provability logic.David Fernández-Duque - 2014 - Archive for Mathematical Logic 53 (3-4):385-431.
    Provability logics are modal or polymodal systems designed for modeling the behavior of Gödel’s provability predicate and its natural extensions. If Λ is any ordinal, the Gödel-Löb calculus GLPΛ contains one modality [λ] for each λ < Λ, representing provability predicates of increasing strength. GLPω has no non-trivial Kripke frames, but it is sound and complete for its topological semantics, as was shown by Icard for the variable-free fragment and more recently by Beklemishev and Gabelaia for the full logic. In (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Evidence and plausibility in neighborhood structures.Johan van Benthem, David Fernández-Duque & Eric Pacuit - 2014 - Annals of Pure and Applied Logic 165 (1):106-133.
    The intuitive notion of evidence has both semantic and syntactic features. In this paper, we develop an evidence logic for epistemic agents faced with possibly contradictory evidence from different sources. The logic is based on a neighborhood semantics, where a neighborhood N indicates that the agent has reason to believe that the true state of the world lies in N. Further notions of relative plausibility between worlds and beliefs based on the latter ordering are then defined in terms of this (...)
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  • On the interpolation property of some intuitionistic modal logics.C. Luppi - 1996 - Archive for Mathematical Logic 35 (3):173-189.
    LetL be one of the intuitionistic modal logics considered in [7] (or one of its extensions) and letM L be the “algebraic semantics” ofL. In this paper we will extend toL the equivalence, proved in the classical case (see [6]), among he weak Craig interpolation theorem, the Robinson theorem and the amalgamation property of varietyM L. We will also prove the equivalence between the Craig interpolation theorem and the super-amalgamation property of varietyM L. Then we obtain the Craig interpolation theorem (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Identity, Leibniz’s Law and Non-Transitive Reasoning.Pablo Cobreros, Paul Egré, David Ripley & Robert van Rooij - 2013 - Metaphysica 14 (2):253-264.
    Arguments based on Leibniz's Law seem to show that there is no room for either indefinite or contingent identity. The arguments seem to prove too much, but their conclusion is hard to resist if we want to keep Leibniz's Law. We present a novel approach to this issue, based on an appropriate modification of the notion of logical consequence.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Vagueness: Subvaluationism.Pablo Cobreros - 2013 - Philosophy Compass 8 (5):472-485.
    Supervaluationism is a well known theory of vagueness. Subvaluationism is a less well known theory of vagueness. But these theories cannot be taken apart, for they are in a relation of duality that can be made precise. This paper provides an introduction to the subvaluationist theory of vagueness in connection to its dual, supervaluationism. A survey on the supervaluationist theory can be found in the Compass paper of Keefe (2008); our presentation of the theory in this paper will be short (...)
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • Zolin and Pizzi: Defining Necessity from Noncontingency.Lloyd Humberstone - 2013 - Erkenntnis 78 (6):1275-1302.
    The point of the present paper is to draw attention to some interesting similarities, as well as differences, between the approaches to the logic of noncontingency of Evgeni Zolin and of Claudio Pizzi. Though neither of them refers to the work of the other, each is concerned with the definability of a (normally behaving, though not in general truth-implying) notion of necessity in terms of noncontingency, standard boolean connectives and additional but non-modal expressive resources. The notion of definability involved is (...)
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • What is the correct logic of necessity, actuality and apriority?Peter Fritz - 2014 - Review of Symbolic Logic 7 (3):385-414.
    This paper is concerned with a propositional modal logic with operators for necessity, actuality and apriority. The logic is characterized by a class of relational structures defined according to ideas of epistemic two-dimensional semantics, and can therefore be seen as formalizing the relations between necessity, actuality and apriority according to epistemic two-dimensional semantics. We can ask whether this logic is correct, in the sense that its theorems are all and only the informally valid formulas. This paper gives outlines of two (...)
    Download  
     
    Export citation  
     
    Bookmark   18 citations  
  • Everything Else Being Equal: A Modal Logic for Ceteris Paribus Preferences.Johan Van Benthem, Patrick Girard & Olivier Roy - 2009 - Journal of Philosophical Logic 38 (1):83 - 125.
    This paper presents a new modal logic for ceteris paribus preferences understood in the sense of "all other things being equal". This reading goes back to the seminal work of Von Wright in the early 1960's and has returned in computer science in the 1990' s and in more abstract "dependency logics" today. We show how it differs from ceteris paribus as "all other things being normal", which is used in contexts with preference defeaters. We provide a semantic analysis and (...)
    Download  
     
    Export citation  
     
    Bookmark   36 citations  
  • An ascending chain of S4 logics.Kit Fine - 1974 - Theoria 40 (2):110-116.
    Download  
     
    Export citation  
     
    Bookmark   57 citations  
  • Two simple incomplete modal logics.J. F. A. K. Benthem - 1978 - Theoria 44 (1):25-37.
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • (1 other version)B(S4.3, S4) unveiled.G. E. Hughes - 1975 - Theoria 41 (2):85-88.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Arithmetical necessity, provability and intuitionistic logic.Rob Goldblatt - 1978 - Theoria 44 (1):38-46.
    Download  
     
    Export citation  
     
    Bookmark   21 citations  
  • On logics with coimplication.Frank Wolter - 1998 - Journal of Philosophical Logic 27 (4):353-387.
    This paper investigates (modal) extensions of Heyting-Brouwer logic, i.e., the logic which results when the dual of implication (alias coimplication) is added to the language of intuitionistic logic. We first develop matrix as well as Kripke style semantics for those logics. Then, by extending the Gö;del-embedding of intuitionistic logic into S4, it is shown that all (modal) extensions of Heyting-Brouwer logic can be embedded into tense logics (with additional modal operators). An extension of the Blok-Esakia-Theorem is proved for this embedding.
    Download  
     
    Export citation  
     
    Bookmark   25 citations  
  • Independent propositional modal logics.S. K. Thomason - 1980 - Studia Logica 39 (2-3):143 - 144.
    We show that the join of two classical [respectively, regular, normal] modal logics employing distinct modal operators is a conservative extension of each of them.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Modal counterparts of Medvedev logic of finite problems are not finitely axiomatizable.Valentin Shehtman - 1990 - Studia Logica 49 (3):365 - 385.
    We consider modal logics whose intermediate fragments lie between the logic of infinite problems [20] and the Medvedev logic of finite problems [15]. There is continuum of such logics [19]. We prove that none of them is finitely axiomatizable. The proof is based on methods from [12] and makes use of some graph-theoretic constructions (operations on coverings, and colourings).
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Discrete tense logic with infinitary inference rules and systematic frame constants: A Hilbert-style axiomatization. [REVIEW]Lennart Åqvist - 1996 - Journal of Philosophical Logic 25 (1):45 - 100.
    The paper deals with the problem of axiomatizing a system T1 of discrete tense logic, where one thinks of time as the set Z of all the integers together with the operations +1 ("immediate successor") and-1 ("immediate predecessor"). T1 is like the Segerberg-Sundholm system WI in working with so-called infinitary inference ruldes; on the other hand, it differs from W I with respect to (i) proof-theoretical setting, (ii) presence of past tense operators and a "now" operator, and, most importantly, with (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Completeness and decidability results for some propositional modal logics containing “actually” operators.Dominic Gregory - 2001 - Journal of Philosophical Logic 30 (1):57-78.
    The addition of "actually" operators to modal languages allows us to capture important inferential behaviours which cannot be adequately captured in logics formulated in simpler languages. Previous work on modal logics containing "actually" operators has concentrated entirely upon extensions of KT5 and has employed a particular modeltheoretic treatment of them. This paper proves completeness and decidability results for a range of normal and nonnormal but quasi-normal propositional modal logics containing "actually" operators, the weakest of which are conservative extensions of K, (...)
    Download  
     
    Export citation  
     
    Bookmark   18 citations  
  • Refutation systems in modal logic.Valentin Goranko - 1994 - Studia Logica 53 (2):299 - 324.
    Complete deductive systems are constructed for the non-valid (refutable) formulae and sequents of some propositional modal logics. Thus, complete syntactic characterizations in the sense of Lukasiewicz are established for these logics and, in particular, purely syntactic decision procedures for them are obtained. The paper also contains some historical remarks and a general discussion on refutation systems.
    Download  
     
    Export citation  
     
    Bookmark   28 citations  
  • Cut-free sequent and tableau systems for propositional diodorean modal logics.Rajeev Goré - 1994 - Studia Logica 53 (3):433 - 457.
    We present sound, (weakly) complete and cut-free tableau systems for the propositional normal modal logicsS4.3, S4.3.1 andS4.14. When the modality is given a temporal interpretation, these logics respectively model time as a linear dense sequence of points; as a linear discrete sequence of points; and as a branching tree where each branch is a linear discrete sequence of points.Although cut-free, the last two systems do not possess the subformula property. But for any given finite set of formulaeX the superformulae involved (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Neighborhoods for entailment.Lou Goble - 2003 - Journal of Philosophical Logic 32 (5):483-529.
    This paper presents a neighborhood semantics for logics of entailment. It begins with a minimal system Min that expresses the most fundamental assumptions about the entailment relation, and continues by examining various extensions that reflect further assumptions that might be made about entailment. This leads first to the logic B that is the basic relevant logic, and then to more powerful systems. All of these logics are proved to be sound and strongly complete. With B the neighborhood semantics meets the (...)
    Download  
     
    Export citation  
     
    Bookmark   6 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  
  • Subformula results in some propositional modal logics.Melvin Fitting - 1978 - Studia Logica 37 (4):387 - 391.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • (1 other version)Forms of Luminosity: Epistemic Modality and Hyperintensionality in Mathematics.David Elohim - 2017
    This book concerns the foundations of epistemic modality and hyperintensionality and their applications to the philosophy of mathematics. David Elohim examines the nature of epistemic modality, when the modal operator is interpreted as concerning both apriority and conceivability, as well as states of knowledge and belief. The book demonstrates how epistemic modality and hyperintensionality relate to the computational theory of mind; metaphysical modality and hyperintensionality; the types of mathematical modality and hyperintensionality; to the epistemic status of large cardinal axioms, undecidable (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Variable-Sharing as Relevance.Shawn Standefer - forthcoming - In Andrew Tedder, Shawn Standefer & Igor Sedlar (eds.), New Directions in Relevant Logic. Springer.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Essays in Formal Metaphysics.Daniel Rubio - 2019 - Dissertation, Rutgers - New Brunswick
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Neighbourhood Semantics for Modal Relevant Logics.Nicholas Ferenz & Andrew Tedder - 2023 - Journal of Philosophical Logic 52 (1):145-181.
    In this paper, we investigate neighbourhood semantics for modal extensions of relevant logics. In particular, we combine the neighbourhood interpretation of the relevant implication (and related connectives) with a neighbourhood interpretation of modal operators. We prove completeness for a range of systems and investigate the relations between neighbourhood models and relational models, setting out a range of augmentation conditions for the various relations and operations.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Model Theoretical Aspects of Weakly Aggregative Modal Logic.Jixin Liu, Yifeng Ding & Yanjing Wang - 2022 - Journal of Logic, Language and Information 31 (2):261-286.
    Weakly Aggregative Modal Logic ) is a collection of disguised polyadic modal logics with n-ary modalities whose arguments are all the same. \ has interesting applications on epistemic logic, deontic logic, and the logic of belief. In this paper, we study some basic model theoretical aspects of \. Specifically, we first give a van Benthem–Rosen characterization theorem of \ based on an intuitive notion of bisimulation. Then, in contrast to many well known normal or non-normal modal logics, we show that (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Pooling Modalities and Pointwise Intersection: Semantics, Expressivity, and Dynamics.Frederik Van De Putte & Dominik Klein - 2022 - Journal of Philosophical Logic 51 (3):485-523.
    We study classical modal logics with pooling modalities, i.e. unary modal operators that allow one to express properties of sets obtained by the pointwise intersection of neighbourhoods. We discuss salient properties of these modalities, situate the logics in the broader area of modal logics, establish key properties concerning their expressive power, discuss dynamic extensions of these logics and provide reduction axioms for the latter.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Logic, Reasoning, and Rationality.Erik Weber, Joke Meheus & Dietlinde Wouters (eds.) - 2014 - Dordrecht, Netherland: Springer.
    This book contains a selection of the papers presented at the Logic, Reasoning and Rationality 2010 conference in Ghent. The conference aimed at stimulating the use of formal frameworks to explicate concrete cases of human reasoning, and conversely, to challenge scholars in formal studies by presenting them with interesting new cases of actual reasoning. According to the members of the Wiener Kreis, there was a strong connection between logic, reasoning, and rationality and that human reasoning is rational in so far (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Neighborhood Semantics for Modal Logic.Eric Pacuit - 2017 - Cham, Switzerland: Springer.
    This book offers a state-of-the-art introduction to the basic techniques and results of neighborhood semantics for modal logic. In addition to presenting the relevant technical background, it highlights both the pitfalls and potential uses of neighborhood models – an interesting class of mathematical structures that were originally introduced to provide a semantics for weak systems of modal logic. In addition, the book discusses a broad range of topics, including standard modal logic results ; bisimulations for neighborhood models and other model-theoretic (...)
    Download  
     
    Export citation  
     
    Bookmark   36 citations  
  • Leo Esakia on Duality in Modal and Intuitionistic Logics.Guram Bezhanishvili (ed.) - 2014 - Dordrecht, Netherland: Springer.
    This volume is dedicated to Leo Esakia's contributions to the theory of modal and intuitionistic systems. Consisting of 10 chapters, written by leading experts, this volume discusses Esakia’s original contributions and consequent developments that have helped to shape duality theory for modal and intuitionistic logics and to utilize it to obtain some major results in the area. Beginning with a chapter which explores Esakia duality for S4-algebras, the volume goes on to explore Esakia duality for Heyting algebras and its generalizations (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Modal and Hyperintensional Cognitivism and Modal and Hyperintensional Expressivism.David Elohim - manuscript
    This paper aims to provide a mathematically tractable background against which to model both modal and hyperintensional cognitivism and modal and hyperintensional expressivism. I argue that epistemic modal algebras, endowed with a hyperintensional, topic-sensitive epistemic two-dimensional truthmaker semantics, comprise a materially adequate fragment of the language of thought. I demonstrate, then, how modal expressivism can be regimented by modal coalgebraic automata, to which the above epistemic modal algebras are categorically dual. I examine five methods for modeling the dynamics of conceptual (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Standard State Space Models of Unawareness.Peter Fritz & Harvey Lederman - 2015 - Theoretical Aspects of Rationality and Knowledge 15.
    The impossibility theorem of Dekel, Lipman and Rustichini has been thought to demonstrate that standard state-space models cannot be used to represent unawareness. We first show that Dekel, Lipman and Rustichini do not establish this claim. We then distinguish three notions of awareness, and argue that although one of them may not be adequately modeled using standard state spaces, there is no reason to think that standard state spaces cannot provide models of the other two notions. In fact, standard space (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Modern Origins of Modal Logic.Roberta Ballarin - 2010 - Stanford Encyclopedia of Philosophy.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Canonical Filtrations and Local Tabularity.Valentin Shehtman - 2014 - In Rajeev Goré, Barteld Kooi & Agi Kurucz (eds.), Advances in Modal Logic, Volume 10: Papers From the Tenth Aiml Conference, Held in Groningen, the Netherlands, August 2014. London, England: CSLI Publications. pp. 498-512.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • (1 other version)Forms of Luminosity: Epistemic Modality and Hyperintensionality in Mathematics.David Elohim - 2017 - Dissertation, Arché, University of St Andrews
    This book concerns the foundations of epistemic modality and hyperintensionality and their applications to the philosophy of mathematics. David Elohim examines the nature of epistemic modality, when the modal operator is interpreted as concerning both apriority and conceivability, as well as states of knowledge and belief. The book demonstrates how epistemic modality and hyperintensionality relate to the computational theory of mind; metaphysical modality and hyperintensionality; the types of mathematical modality and hyperintensionality; to the epistemic status of large cardinal axioms, undecidable (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Hyperintensional Foundations of Mathematical Platonism.David Elohim - manuscript
    This paper aims to provide hyperintensional foundations for mathematical platonism. I examine Hale and Wright's (2009) objections to the merits and need, in the defense of mathematical platonism and its epistemology, of the thesis of Necessitism. In response to Hale and Wright's objections to the role of epistemic and metaphysical modalities in providing justification for both the truth of abstraction principles and the success of mathematical predicate reference, I examine the Necessitist commitments of the abundant conception of properties endorsed by (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • A Computational Learning Semantics for Inductive Empirical Knowledge.Kevin T. Kelly - 2014 - In Alexandru Baltag & Sonja Smets (eds.), Johan van Benthem on Logic and Information Dynamics. Cham, Switzerland: Springer International Publishing. pp. 289-337.
    This chapter presents a new semantics for inductive empirical knowledge. The epistemic agent is represented concretely as a learner who processes new inputs through time and who forms new beliefs from those inputs by means of a concrete, computable learning program. The agent’s belief state is represented hyper-intensionally as a set of time-indexed sentences. Knowledge is interpreted as avoidance of error in the limit and as having converged to true belief from the present time onward. Familiar topics are re-examined within (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Willem Blok and Modal Logic.W. Rautenberg, M. Zakharyaschev & F. Wolter - 2006 - Studia Logica 83 (1):15-30.
    We present our personal view on W.J. Blok's contribution to modal logic.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Some Results on Modal Axiomatization and Definability for Topological Spaces.Guram Bezhanishvili, Leo Esakia & David Gabelaia - 2005 - Studia Logica 81 (3):325-355.
    We consider two topological interpretations of the modal diamond—as the closure operator (C-semantics) and as the derived set operator (d-semantics). We call the logics arising from these interpretations C-logics and d-logics, respectively. We axiomatize a number of subclasses of the class of nodec spaces with respect to both semantics, and characterize exactly which of these classes are modally definable. It is demonstrated that the d-semantics is more expressive than the C-semantics. In particular, we show that the d-logics of the six (...)
    Download  
     
    Export citation  
     
    Bookmark   30 citations  
  • (1 other version)Grothendieck Topology as Geometric Modality.Robert I. Goldblatt - 1981 - Mathematical Logic Quarterly 27 (31‐35):495-529.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • (1 other version)Bounded Properties in Modal Logic.George F. Schumm - 1981 - Mathematical Logic Quarterly 27 (13‐14):197-200.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • The logical consequence relation of propositional tense logic.S. K. Thomason - 1975 - Mathematical Logic Quarterly 21 (1):29-40.
    Download  
     
    Export citation  
     
    Bookmark   5 citations