This category needs an editor. We encourage you to help if you are qualified.
Volunteer, or read more about what this involves.
Related categories
Subcategories:
849 found
Search inside:
(import / add options)   Sort by:
1 — 50 / 849
Material to categorize
  1. Ernest W. Adams (1977). A Note on Comparing Probabilistic and Modal Logics of Conditionals. Theoria 43 (3):186-194.
  2. J. W. Addison (ed.) (1965). The Theory of Models. Amsterdam, North-Holland Pub. Co..
    Remove from this list |
     
    My bibliography  
     
    Export citation  
  3. Thomas Ågotnes, Wiebe van der Hoek & Michael Wooldridge (2008). Quantified Coalition Logic. Synthese 165 (2):269 - 294.
    We add a limited but useful form of quantification to Coalition Logic, a popular formalism for reasoning about cooperation in game-like multi-agent systems. The basic constructs of Quantified Coalition Logic (QCL) allow us to express such properties as “every coalition satisfying property P can achieve φ” and “there exists a coalition C satisfying property P such that C can achieve φ”. We give an axiomatisation of QCL, and show that while it is no more expressive than Coalition Logic, it is (...)
    Remove from this list | Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  4. Logique A. Analyse (1999). Combination Semantics for Intensional Logics Part I Makings and Their Use in Making Combination Semantics Jerzy Perzanowski. Logique Et Analyse 42:181.
    Remove from this list |
     
    My bibliography  
     
    Export citation  
  5. Alan Ross Anderson (1958). A Reduction of Deontic Logic to Alethic Modal Logic. Mind 67 (265):100-103.
  6. G. Aldo Antonelli & Richmond H. Thomason (2002). Representability in Second-Order Propositional Poly-Modal Logic. Journal of Symbolic Logic 67 (3):1039-1054.
    A propositional system of modal logic is second-order if it contains quantifiers ∀p and ∃p, which, in the standard interpretation, are construed as ranging over sets of possible worlds (propositions). Most second-order systems of modal logic are highly intractable; for instance, when augmented with propositional quantifiers, K, B, T, K4 and S4 all become effectively equivalent to full second-order logic. An exception is S5, which, being interpretable in monadic second-order logic, is decidable.
    Remove from this list | Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  7. Peter Apostoli (1997). On the Completeness of First Degree Weakly Aggregative Modal Logics. Journal of Philosophical Logic 26 (2):169-180.
    This paper extends David Lewis' result that all first degree modal logics are complete to weakly aggregative modal logic by providing a filtration-theoretic version of the canonical model construction of Apostoli and Brown. The completeness and decidability of all first-degree weakly aggregative modal logics is obtained, with Lewis's result for Kripkean logics recovered in the case k = 1.
    Remove from this list | Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  8. Peter Apostoli & Bryson Brown (1995). A Solution to the Completeness Problem for Weakly Aggregative Modal Logic. Journal of Symbolic Logic 60 (3):832-842.
    Remove from this list | Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  9. Lennart Åqvist (2010). Grades of Probability Modality in the Law of Evidence. Studia Logica 94 (3):307 - 330.
    The paper presents an infinite hierarchy PR m [ m = 1, 2, . . . ] of sound and complete axiomatic systems for modal logic with graded probabilistic modalities , which are to reflect what I have elsewhere called the Bolding-Ekelöf degrees of evidential strength as applied to the establishment of matters of fact in law-courts. Our present approach is seen to differ from earlier work by the author in that it treats the logic of these graded modalities not (...)
    Remove from this list | Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  10. Lennart Åqvist (2002). Old Foundations for the Logic of Agency and Action. Studia Logica 72 (3):313-338.
    The paper presents an infinite hierarchy of sound and complete axiomatic systems for Two-Dimensional Modal Tense Logic with Historical Necessity, Agents and Acts. A main novelty of these logics is their capacity to represent formally (i) basic action-sentences asserting that such and such an act is performed/omitted by an agent, as well as (ii) causative action-sentences asserting that by performing/omitting a certain act, an agent causes that such and such a state-of-affairs is realized (e.g. comes about/ceases/remains/remains absent). We illustrate how (...)
    Remove from this list | Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  11. Lennart Åqvist (1996). Discrete Tense Logic with Infinitary Inference Rules and Systematic Frame Constants: A Hilbert-Style Axiomatization. [REVIEW] 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 (...)
    Remove from this list | Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  12. Lennart Åqvist (1971). The Completeness of Some Modal Logics with Circumstantials, Subjunctive Conditionals, Transworld Identity and Dispositional Predicates. [Uppsala,Uppsala Universitet].
    Remove from this list |
     
    My bibliography  
     
    Export citation  
  13. Francesco Arzillo (2011). Il Fondamento Del Giudizio: Una Proposta Teoretica a Partire Dalla Filosofia Del Senso Comune di Antonio Livi. Casa Editrice Leonardo da Vinci.
    Remove from this list |
    Translate to English
    |
     
    My bibliography  
     
    Export citation  
  14. Arnon Avron, Furio Honsell, Marino Miculan & Cristian Paravano (1998). Encoding Modal Logics in Logical Frameworks. Studia Logica 60 (1):161-208.
    We present and discuss various formalizations of Modal Logics in Logical Frameworks based on Type Theories. We consider both Hilbert- and Natural Deduction-style proof systems for representing both truth (local) and validity (global) consequence relations for various Modal Logics. We introduce several techniques for encoding the structural peculiarities of necessitation rules, in the typed -calculus metalanguage of the Logical Frameworks. These formalizations yield readily proof-editors for Modal Logics when implemented in Proof Development Environments, such as Coq or LEGO.
    Remove from this list | Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  15. Steve Awodey, Lars Birkedal & Dana Scott, Local Realizability Toposes and a Modal Logic for Computability.
    This work is a step toward the development of a logic for types and computation that includes not only the usual spaces of mathematics and constructions, but also spaces from logic and domain theory. Using realizability, we investigate a configuration of three toposes that we regard as describing a notion of relative computability. Attention is focussed on a certain local map of toposes, which we first study axiomatically, and then by deriving a modal calculus as its internal logic. The resulting (...)
    Remove from this list | Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  16. Franz Baader & Silvio Ghilardi (2007). Connecting Many-Sorted Theories. Journal of Symbolic Logic 72 (2):535 - 583.
    Basically, the connection of two many-sorted theories is obtained by taking their disjoint union, and then connecting the two parts through connection functions that must behave like homomorphisms on the shared signature. We determine conditions under which decidability of the validity of universal formulae in the component theories transfers to their connection. In addition, we consider variants of the basic connection scheme. Our results can be seen as a generalization of the so-called E-connection approach for combining modal logics to an (...)
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  17. John Bacon (1988). Four Modal Modelings. Journal of Philosophical Logic 17 (2):91 - 114.
    Remove from this list | Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  18. John Robert Baker (1978). Essentialism and the Modal Semantics of J. Hintikka. Notre Dame Journal of Formal Logic 19 (1):81-91.
  19. John Robert Baker (1978). Some Remarks on Quine's Arguments Against Modal Logic. Notre Dame Journal of Formal Logic 19 (4):663-673.
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  20. Roberta Ballarin (2005). Validity and Necessity. Journal of Philosophical Logic 34 (3):275 - 303.
    In this paper I argue against the commonly received view that Kripke's formal Possible World Semantics (PWS) reflects the adoption of a metaphysical interpretation of the modal operators. I consider in detail Kripke's three main innovations vis-à-vis Carnap's PWS: a new view of the worlds, variable domains of quantification, and the adoption of a notion of universal validity. I argue that all these changes are driven by the natural technical development of the model theory and its related notion of validity: (...)
    Remove from this list | Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  21. Alexandru Baltag & Lawrence S. Moss (2004). Logics for Epistemic Programs. Synthese 139 (2):165 - 224.
    We construct logical languages which allow one to represent a variety of possible types of changes affecting the information states of agents in a multi-agent setting. We formalize these changes by defining a notion of epistemic program. The languages are two-sorted sets that contain not only sentences but also actions or programs. This is as in dynamic logic, and indeed our languages are not significantly more complicated than dynamic logics. But the semantics is more complicated. In general, the semantics of (...)
    Remove from this list | Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  22. Juan Barba Escriba (1991). A Multidimensional Modal Translation for a Formal System Motivated by Situation Semantics. Notre Dame Journal of Formal Logic 32 (4):598-608.
    Remove from this list | Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  23. Juan Barba Escriba (1991). Two Formal Systems for Situation Semantics. Notre Dame Journal of Formal Logic 33 (1):70-88.
    Remove from this list | Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  24. Juan Barba Escriba (1991). A Multidimensional Modal Translation for a Formal System Motivated by Situation Semantics. Notre Dame Journal of Formal Logic 32 (4):598-608.
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  25. Juan Barba Escriba (1991). Two Formal Systems for Situation Semantics. Notre Dame Journal of Formal Logic 33 (1):70-88.
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  26. Richard L. Barber (1954). Two Logics of Modality. Tulane Studies in Philosophy 3:41-54.
    Remove from this list | Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  27. Ruth Barcan Marcus (2011). C. I. Lewis on Intensional Predicate Logic: A Letter Dated May 11, 1960. History and Philosophy of Logic 32 (2):103 - 106.
    History and Philosophy of Logic, Volume 32, Issue 2, Page 103-106, May 2011.
    Remove from this list | Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  28. Jon Barwise & Lawrence S. Moss (1998). Modal Correspondence for Models. Journal of Philosophical Logic 27 (3):275-294.
    This paper considers the correspondence theory from modal logic and obtains correspondence results for models as opposed to frames. The key ideas are to consider infinitary modal logic, to phrase correspondence results in terms of substitution instances of a given modal formula, and to identify bisimilar model-world pairs.
    Remove from this list | Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  29. J. C. Beall (2003). Possibilities and Paradox: An Introduction to Modal and Many-Valued Logic. Oxford University Press.
    Extensively classroom-tested, Possibilities and Paradox provides an accessible and carefully structured introduction to modal and many-valued logic. The authors cover the basic formal frameworks, enlivening the discussion of these different systems of logic by considering their philosophical motivations and implications. Easily accessible to students with no background in the subject, the text features innovative learning aids in each chapter, including exercises that provide hands-on experience, examples that demonstrate the application of concepts, and guides to further reading.
    Remove from this list |
     
    My bibliography  
     
    Export citation  
  30. Jc Beall (2007). Review of J. W. Garson, Modal Logic for Philosophers. [REVIEW] Notre Dame Philosophical Reviews 2007 (6).
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  31. Jc Beall (2003). Algebraic Methods in Philosophical Logic. Australasian Journal of Philosophy 81 (3):442 – 444.
    Book Information Algebraic Methods in Philosophical Logic. By J. Michael Dunn and Gary Hardegree. Clarendon Press. Oxford. 2001. Pp. xv + 470. 60.50.
    Remove from this list | Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  32. Fabio Bellissima & Saverio Cittadini (1999). Minimal P-Morphic Images, Axiomatizations and Coverings in the Modal Logic K. Studia Logica 62 (3):371-398.
    We define the concepts of minimal p-morphic image and basic p-morphism for transitive Kripke frames. These concepts are used to determine effectively the least number of variables necessary to axiomatize a tabular extension of K4, and to describe the covers and co-covers of such a logic in the lattice of the extensions of K4.
    Remove from this list | Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  33. Nuel Belnap (1991). Backwards and Forwards in the Modal Logic of Agency. Philosophy and Phenomenological Research 51 (4):777-807.
    Remove from this list | Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  34. J. F. A. K. Benthem (1978). Two Simple Incomplete Modal Logics. Theoria 44 (1):25-37.
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  35. Johan Van Benthem, Patrick Girard & Olivier Roy (2009). Everything Else Being Equal: A Modal Logic for Ceteris Paribus Preferences. 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 (...)
    Remove from this list | Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  36. Guram Bezhanishvili, Leo Esakia & David Gabelaia (2010). The Modal Logic of Stone Spaces: Diamond as Derivative. Review of Symbolic Logic 3 (1):26-40.
    We show that if we interpret modal diamond as the derived set operator of a topological space, then the modal logic of Stone spaces is K4 and the modal logic of weakly scattered Stone spaces is K4G. As a corollary, we obtain that K4 is also the modal logic of compact Hausdorff spaces and K4G is the modal logic of weakly scattered compact Hausdorff spaces.
    Remove from this list | Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  37. Jean-Yves Béziau (2011). A New Four-Valued Approach to Modal Logic. Logique Et Analyse 54 (213):109.
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  38. Patrick Blackburn, Johan van Benthem & Frank Wolter (eds.) (2007). Handbook of Modal Logic. Elsevier.
    The Handbook of Modal Logic contains 20 articles, which collectively introduce contemporary modal logic, survey current research, and indicate the way in which the field is developing. The articles survey the field from a wide variety of perspectives: the underling theory is explored in depth, modern computational approaches are treated, and six major applications areas of modal logic (in Mathematics, Computer Science, Artificial Intelligence, Linguistics, Game Theory, and Philosophy) are surveyed. The book contains both well-written expository articles, suitable for beginners (...)
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  39. Robert Blanché (1952). Quantity, Modality, and Other Kindred Systems of Categories. Mind 61 (243):369-375.
    Remove from this list | Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  40. Andreas Blass (1990). Infinitary Combinatorics and Modal Logic. Journal of Symbolic Logic 55 (2):761-778.
    We show that the modal propositional logic G, originally introduced to describe the modality "it is provable that", is also sound for various interpretations using filters on ordinal numbers, for example the end-segment filters, the club filters, or the ineffable filters. We also prove that G is complete for the interpretation using end-segment filters. In the case of club filters, we show that G is complete if Jensen's principle □ κ holds for all $\kappa ; on the other hand, it (...)
    Remove from this list | Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  41. Jerzy J. Blaszczuk & Wieslaw Dziobiak (1977). Modal Logics Connected with Systems S4n of Sobociński. Studia Logica 36 (3):151 - 164.
    Remove from this list | Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  42. W. J. Blok (1980). The Lattice of Modal Logics: An Algebraic Investigation. Journal of Symbolic Logic 45 (2):221-236.
    Modal logics are studied in their algebraic disguise of varieties of so-called modal algebras. This enables us to apply strong results of a universal algebraic nature, notably those obtained by B. Jonsson. It is shown that the degree of incompleteness with respect to Kripke semantics of any modal logic containing the axiom □ p → p or containing an axiom of the form $\square^mp \leftrightarrow\square^{m + 1}p$ for some natural number m is 2 ℵ 0 . Furthermore, we show that (...)
    Remove from this list | Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  43. W. J. Blok & P. Köhler (1983). Algebraic Semantics for Quasi-Classical Modal Logics. Journal of Symbolic Logic 48 (4):941-964.
    Remove from this list | Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  44. Giacomo Bonanno (2005). A Simple Modal Logic for Belief Revision. Synthese 147 (2):193 - 228.
    We propose a modal logic based on three operators, representing intial beliefs, information and revised beliefs. Three simple axioms are used to provide a sound and complete axiomatization of the qualitative part of Bayes’ rule. Some theorems of this logic are derived concerning the interaction between current beliefs and future beliefs. Information flows and iterated revision are also discussed.
    Remove from this list | Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  45. Aldo Bressan (1972). A General Interpreted Modal Calculus. New Haven,Yale University Press.
    Remove from this list |
     
    My bibliography  
     
    Export citation  
  46. Mark A. Brown (1982). Generalized ${\Rm S}2$-Like Systems of Propositional Modal Logic. Notre Dame Journal of Formal Logic 23 (1):53-61.
    Remove from this list | Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  47. R. A. Bull (1969). On Modal Logic with Propositional Quantifiers. Journal of Symbolic Logic 34 (2):257-263.
    Remove from this list | Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  48. Howard Burdick (1993). Non-Essentialistic Modal Logic or Meaning and Necessity Revisited. Philosophia 22 (1-2):87-93.
    Using the method of ordered pairs proposed in my 'A Logical Form for the Propositional Attitudes', a non-essentialistic modal logic is possible which avoids these oddities.
    Remove from this list | Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  49. John P. Burgess (1999). Which Modal Logic Is the Right One? Notre Dame Journal of Formal Logic 40 (1):81-93.
    The question, "Which modal logic is the right one for logical necessity?," divides into two questions, one about model-theoretic validity, the other about proof-theoretic demonstrability. The arguments of Halldén and others that the right validity argument is S5, and the right demonstrability logic includes S4, are reviewed, and certain common objections are argued to be fallacious. A new argument, based on work of Supecki and Bryll, is presented for the claim that the right demonstrability logic must be contained in S5, (...)
    Remove from this list | Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  50. Xavier Caicedo & Ricardo O. Rodriguez (2010). Standard Gödel Modal Logics. Studia Logica 94 (2):189 - 214.
    We prove strong completeness of the □-version and the ◊-version of a Gödel modal logic based on Kripke models where propositions at each world and the accessibility relation are both infinitely valued in the standard Gödel algebra [0,1]. Some asymmetries are revealed: validity in the first logic is reducible to the class of frames having two-valued accessibility relation and this logic does not enjoy the finite model property, while validity in the second logic requires truly fuzzy accessibility relations and this (...)
    Remove from this list | Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
1 — 50 / 849