Results for ' S5'

398 found
Order:
  1.  15
    Conceivability, Kripkean Identity, and S5: A Reply to Jonathon VandenHombergh.Peter Marton - forthcoming - Erkenntnis:1-10.
    This paper is mostly about the role of modal system S5 in conceivability arguments against, as well as in the defense of, different versions of physicalism. Jonathon VandenHombergh argued in a recent article that “[s]o far as the modal epistemology of reduction is concerned, therefore, it pays to go intrinsic.” His reasoning is that while the weaker, extrinsic version of reductive physicalism is vulnerable to conceivability arguments, the stronger, intrinsic, version is uniquely resistant to this type of challenge. To get (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  2.  25
    Infinitary S5‐Epistemic Logic.Aviad Heifetz - 1997 - Mathematical Logic Quarterly 43 (3):333-342.
    It is known that a theory in S5‐epistemic logic with several agents may have numerous models. This is because each such model specifies also what an agent knows about infinite intersections of events, while the expressive power of the logic is limited to finite conjunctions of formulas. We show that this asymmetry between syntax and semantics persists also when infinite conjunctions (up to some given cardinality) are permitted in the language. We develop a strengthened S5‐axiomatic system for such infinitary logics, (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  3. Can Hardcore Actualism Validate S5?Samuel Kimpton-Nye - 2021 - Philosophy and Phenomenological Research 102 (2):342-358.
    Hardcore actualism (HA) grounds all modal truths in the concrete constituents of the actual world (see, e.g., Borghini and Williams (2008), Jacobs (2010), Vetter (2015)). I bolster HA, and elucidate the very nature of possibility (and necessity) according to HA, by considering if it can validate S5 modal logic. Interestingly, different considerations pull in different directions on this issue. To resolve the tension, we are forced to think hard about the nature of the hardcore actualist's modal reality and how radically (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  4. Proofnets for S5: sequents and circuits for modal logic.Greg Restall - 2007 - In C. Dimitracopoulos, L. Newelski & D. Normann (eds.), Logic Colloquium 2005: Proceedings of the Annual European Summer Meeting of the Association for Symbolic Logic, Held in Athens, Greece, July 28-August 3, 2005. Cambridge: Cambridge University Press. pp. 151-172.
    In this paper I introduce a sequent system for the propositional modal logic S5. Derivations of valid sequents in the system are shown to correspond to proofs in a novel natural deduction system of circuit proofs (reminiscient of proofnets in linear logic, or multiple-conclusion calculi for classical logic). -/- The sequent derivations and proofnets are both simple extensions of sequents and proofnets for classical propositional logic, in which the new machinery—to take account of the modal vocabulary—is directly motivated in terms (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   18 citations  
  5. S5 Solution to the Red Hat Puzzle.Robert C. Robinson - 2007 - Disputatio 2 (22):1 - 7.
    Abstract: I argue that the solution to the Red Hat Problem, a puzzle derived from interactive epistemic logic, requires S5. Interactive epis- temic logic is set out in formal terms, and an attempt to solve the red hat puzzle is made in K, K, and K, each of which fails, showing that a stronger system, K is required.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
  6.  20
    S5 knowledge without partitions.Dov Samet - 2010 - Synthese 172 (1):145-155.
    We study set algebras with an operator (SAO) that satisfy the axioms of S5 knowledge. A necessary and sufficient condition is given for such SAOs that the knowledge operator is defined by a partition of the state space. SAOs are constructed for which the condition fails to hold. We conclude that no logic singles out the partitional SAOs among all SAOs.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  7. Varieties of Relevant S5.Shawn Standefer - 2023 - Logic and Logical Philosophy 32 (1):53–80.
    In classically based modal logic, there are three common conceptions of necessity, the universal conception, the equivalence relation conception, and the axiomatic conception. They provide distinct presentations of the modal logic S5, all of which coincide in the basic modal language. We explore these different conceptions in the context of the relevant logic R, demonstrating where they come apart. This reveals that there are many options for being an S5-ish extension of R. It further reveals a divide between the universal (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  8. Propositional Quantification in Bimodal S5.Peter Fritz - 2020 - Erkenntnis 85 (2):455-465.
    Propositional quantifiers are added to a propositional modal language with two modal operators. The resulting language is interpreted over so-called products of Kripke frames whose accessibility relations are equivalence relations, letting propositional quantifiers range over the powerset of the set of worlds of the frame. It is first shown that full second-order logic can be recursively embedded in the resulting logic, which entails that the two logics are recursively isomorphic. The embedding is then extended to all sublogics containing the logic (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  9.  50
    S5-denying Approach to Relativized Metaphysical Modality.Fernando Furtado - 2020 - Manuscrito 43 (1):1-40.
    This paper is organised as follows: first, I present Salmon’s theory of modality and compare it with the standard interpretation of modality: ‘the nonrelativized S5-friendly interpretation of metaphysical modality’. Second, I explain Murray and Wilson’s ‘two-dimensional S5-friendly interpretation of relativized metaphysical modality’. In the third and last part, I put forward a few arguments against Murray and Wilson’s attempt to provide an essentialist S5-friendly theory for modality. In general, this paper argues that if one wants to hold an essentialist theory (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  10. S5 knowledge without partitions.Dov Samet - 2010 - Synthese 172 (1):145 - 155.
    We study set algebras with an operator (SAO) that satisfy the axioms of S5 knowledge. A necessary and sufficient condition is given for such SAOs that the knowledge operator is defined by a partition of the state space. SAOs are constructed for which the condition fails to hold. We conclude that no logic singles out the partitional SAOs among all SAOs.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  11.  20
    Доказательство ł-разрешимости системы s5 льюиса.Е Слупецки & Г Брыль - 1973 - Studia Logica 32 (1):107-107.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  12.  92
    S5 for Aristotelian Actualists.Benjamin Mitchell-Yellin & Michael Nelson - 2016 - Philosophical Studies 173 (6):1537-1569.
    Aristotelian Actualism is the conjunction of the theses that absolutely everything is actual, that individuals are neither reducible to nor dependent on independently identified properties, and that some individuals are genuine contingent existents. Robert Adams and Gregory Fitch, two prominent proponents of Aristotelian Actualism, have argued that this view has a consequence that any modal logic stronger than M, and so any modal logic in which symmetry and reflexivity are frame conditions, is inadequate. We argue that this is incorrect.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  13. Against S5: Impossible Worlds in the Logic of What Might Have Been.Nathan Salmon - manuscript
    The dogma that the propositional logic of metaphysical modality is S5 is rebutted in related installments (previously published and unpublished essays).
    Direct download  
     
    Export citation  
     
    Bookmark  
  14.  55
    Full classical S5 in natural deduction with weak normalization.Ana Teresa Martins & Lilia Ramalho Martins - 2008 - Annals of Pure and Applied Logic 152 (1):132-147.
    Natural deduction systems for classical, intuitionistic and modal logics were deeply investigated by Prawitz [D. Prawitz, Natural Deduction: A Proof-theoretical Study, in: Stockholm Studies in Philosophy, vol. 3, Almqvist and Wiksell, Stockholm, 1965. Reprinted at: Dover Publications, Dover Books on Mathematics, 2006] from a proof-theoretical perspective. Prawitz proved weak normalization for classical logic only for a language without logical or, there exists and with a restricted application of reduction ad absurdum. Reduction steps related to logical or, there exists and classical (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  15.  32
    Children's5-HTTLPRgenotype moderates the link between maternal criticism and attentional biases specifically for facial displays of anger.Brandon E. Gibb, Ashley L. Johnson, Jessica S. Benas, Dorothy J. Uhrlass, Valerie S. Knopik & John E. McGeary - 2011 - Cognition and Emotion 25 (6):1104-1120.
  16.  33
    Epistemologische betrachtungen zu [S4, S5].Wolfgang Lenzen - 1979 - Erkenntnis 14 (1):33-56.
    The numerous modal systems between S4 and S5 are investigated from an epistemological point of view by interpreting necessity either as knowledge or as (strong) belief. It is shown that-granted some assumptions about epistemic logic for which the author has argued elsewhere-the system S4.4 may be interpreted as the logic of true belief, while S4.3.2 and S4.2 may be taken to represent epistemic logic systems for individuals who accept the scheme knowledge = true belief only for certain special instances. There (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   24 citations  
  17.  66
    Dynamic topological S5.Philip Kremer - 2009 - Annals of Pure and Applied Logic 160 (1):96-116.
    The topological semantics for modal logic interprets a standard modal propositional language in topological spaces rather than Kripke frames: the most general logic of topological spaces becomes S4. But other modal logics can be given a topological semantics by restricting attention to subclasses of topological spaces: in particular, S5 is logic of the class of almost discrete topological spaces, and also of trivial topological spaces. Dynamic Topological Logic interprets a modal language enriched with two unary temporal connectives, next and henceforth. (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  18.  41
    Modal Combinatorialism is Consistent with S5.Henry Taylor - 2019 - Thought: A Journal of Philosophy 8 (1):23-32.
    The combinatorial theory of modality has long been dogged by the supposed problem that it entails that S5 is not the correct logic for metaphysical modality. In this paper, I suggest a modification to combinatorialism, to eliminate this tension with S5. I argue that the resulting view is more in the spirit of combinatorialism than the original position.
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  19.  7
    S5 with CBF.Robert P. McArthur - 1975 - Notre Dame Journal of Formal Logic 16:528.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  20.  52
    Interpolation for first order S5.Melvin Fitting - 2002 - Journal of Symbolic Logic 67 (2):621-634.
    An interpolation theorem holds for many standard modal logics, but first order $S5$ is a prominent example of a logic for which it fails. In this paper it is shown that a first order $S5$ interpolation theorem can be proved provided the logic is extended to contain propositional quantifiers. A proper statement of the result involves some subtleties, but this is the essence of it.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  21. An S5 diodorean modal system.M. J. White - 1979 - Logique Et Analyse 22 (88):477.
     
    Export citation  
     
    Bookmark   1 citation  
  22.  14
    S5 without modal axioms.John Williamson - 1979 - Notre Dame Journal of Formal Logic 20:593.
  23. The realization theorem for s5 a simple, constructive proof.Melvin Fitting - unknown
    Justification logics are logics of knowledge in which explicit reasons are formally represented. Standard logics of knowledge have justification logic analogs. Connecting justification logics and logics of knowledge are Realization Theorems. In this paper we give a new, constructive proof of the Realization Theorem connecting S5 and its justification analog, JS5. This proof is, I believe, the simplest in the literature.
     
    Export citation  
     
    Bookmark   4 citations  
  24.  38
    Plantinga’s S5 Modal Argument, Obvious Entailment, and Circularity.Colin P. Ruloff - 2004 - Philo 7 (1):71-78.
    In the second chapter of his Modality, Probability and Rationality, James Sennett argues that Plantinga’s famed S5 Modal Argument (hereafter “MA”) for the existence of an unsurpassably great being is objectionably circular since it’s impossible for one to understand the premises of Plantinga’s MA without understanding these premises to logically entail its conclusion. That is to say, Sennett’s charge is that Plantinga’s MA is circular since there is no understanding of the premises of Plantinga’s MA that is independent of its (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  25.  16
    Simple Decision Procedure for S5 in Standard Cut-Free Sequent Calculus.Andrzej Indrzejczak - 2016 - Bulletin of the Section of Logic 45 (2).
    In the paper a decision procedure for S5 is presented which uses a cut-free sequent calculus with additional rules allowing a reduction to normal modal forms. It utilizes the fact that in S5 every formula is equivalent to some 1-degree formula, i.e. a modally-flat formula with modal functors having only boolean formulas in its scope. In contrast to many sequent calculi for S5 the presented system does not introduce any extra devices. Thus it is a standard version of SC but (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  26.  7
    Independent Axiom Schemata for S5.Alan Ross Anderson - 1957 - Journal of Symbolic Logic 22 (3):327-327.
    Direct download  
     
    Export citation  
     
    Bookmark  
  27.  63
    First-order expressivity for s5-models: Modal vs. two-sorted languages.Holger Sturm & Frank Wolter - 2001 - Journal of Philosophical Logic 30 (6):571-591.
    Standard models for model predicate logic consist of a Kripke frame whose worlds come equipped with relational structures. Both modal and two-sorted predicate logic are natural languages for speaking about such models. In this paper we compare their expressivity. We determine a fragment of the two-sorted language for which the modal language is expressively complete on S5-models. Decidable criteria for modal definability are presented.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  28. On Interpreting the S5 Propositional Calculus: an essay in philosophical logic.Michael J. Carroll - 1976 - Dissertation, University of Iowa
    Discusses alternative interpretations of the modal operators, for the modal propositional logic S5.
     
    Export citation  
     
    Bookmark  
  29.  10
    An Algebraic Study of S5-Modal Gödel Logic.Diego Castaño, Cecilia Cimadamore, José Patricio Díaz Varela & Laura Rueda - 2021 - Studia Logica 109 (5):937-967.
    In this paper we continue the study of the variety \ of monadic Gödel algebras. These algebras are the equivalent algebraic semantics of the S5-modal expansion of Gödel logic, which is equivalent to the one-variable monadic fragment of first-order Gödel logic. We show three families of locally finite subvarieties of \ and give their equational bases. We also introduce a topological duality for monadic Gödel algebras and, as an application of this representation theorem, we characterize congruences and give characterizations of (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  30.  96
    Potentialism and S5.Jonas Werner - 2022 - Canadian Journal of Philosophy 52 (6):622-635.
    Modal potentialism as proposed by Barbara Vetter (2015) is the view that every possibility is grounded in something having a potentiality. Drawing from work by Jessica Leech (2017), Samuel Kimpton-Nye (2021) argues that potentialists can have an S5 modal logic. I present a novel argument to the conclusion that the most straightforward way of spelling out modal potentialism cannot validate an S5 modal logic. Then I will propose a slightly tweaked version of modal potentialism that can validate an S5 modal (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  31. S5 x S5 x S5 Lacks the Finite Model Property.Agnes Kurucz - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 321-327.
    No categories
     
    Export citation  
     
    Bookmark  
  32.  10
    $S5$ with the CBF.Robert P. McArthur - 1975 - Notre Dame Journal of Formal Logic 16 (4):528-530.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  33.  30
    Системы s4 и s5 льюиса а связка тождества.Р Сушко & В Жандаровска - 1971 - Studia Logica 29 (1):178-179.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  34.  92
    Modality and quantification in S5.A. N. Prior - 1956 - Journal of Symbolic Logic 21 (1):60-62.
  35.  24
    Investigations into implicational s5.C. A. Meredith & A. N. Prior - 1964 - Mathematical Logic Quarterly 10 (13‐17):203-220.
  36.  50
    Denotational Semantics for Modal Systems S3–S5 Extended by Axioms for Propositional Quantifiers and Identity.Steffen Lewitzka - 2015 - Studia Logica 103 (3):507-544.
    There are logics where necessity is defined by means of a given identity connective: \ is a tautology). On the other hand, in many standard modal logics the concept of propositional identity \ can be defined by strict equivalence \}\). All these approaches to modality involve a principle that we call the Collapse Axiom : “There is only one necessary proposition.” In this paper, we consider a notion of PI which relies on the identity axioms of Suszko’s non-Fregean logic SCI. (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  37.  16
    A Loop-Free Decision Procedure for Modal Propositional Logics K4, S4 and S5.Dorota Leszczyńska-Jasion - 2009 - Journal of Philosophical Logic 38 (2):151-177.
    The aim of this paper is to present a loop-free decision procedure for modal propositional logics K4, S4 and S5. We prove that the procedure terminates and that it is sound and complete. The procedure is based on the method of Socratic proofs for modal logics, which is grounded in the logic of questions IEL.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  38.  27
    A new representation of $S5$.Steven K. Thomason - 1973 - Notre Dame Journal of Formal Logic 14 (2):281-284.
  39.  10
    Unifiability and Structural Completeness in Relation Algebras and in Products of Modal Logic S5.Wojciech Dzik & Beniamin Wróbel - 2015 - Bulletin of the Section of Logic 44 (1/2):1-14.
    Unifiability of terms (and formulas) and structural completeness in the variety of relation algebras RA and in the products of modal logic S5 is investigated. Nonunifiable terms (formulas) which are satisfiable in varieties (in logics) are exhibited. Consequently, RA and products of S5 as well as representable diagonal-free n-dimensional cylindric algebras, RDfn, are almost structurally complete but not structurally complete. In case of S5n a basis for admissible rules and the form of all passive rules are provided.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  40.  32
    Investigations Into Implicational S5.C. A. Meredith & A. N. Prior - 1964 - Mathematical Logic Quarterly 10 (13-17):203-220.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  41.  33
    Systemy S4 I S5 Lewisa a spójnik identyczności.Roman Suszko & Wiesława Żandarowska - 1971 - Studia Logica 29 (1):169-177.
  42.  50
    A Deep Inference System for the Modal Logic S5.Phiniki Stouppa - 2007 - Studia Logica 85 (2):199-214.
    We present a cut-admissible system for the modal logic S5 in a formalism that makes explicit and intensive use of deep inference. Deep inference is induced by the methods applied so far in conceptually pure systems for this logic. The system enjoys systematicity and modularity, two important properties that should be satisfied by modal systems. Furthermore, it enjoys a simple and direct design: the rules are few and the modal rules are in exact correspondence to the modal axioms.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  43.  19
    Rooted Hypersequent Calculus for Modal Logic S5.Hamzeh Mohammadi & Mojtaba Aghaei - 2023 - Logica Universalis 17 (3):269-295.
    We present a rooted hypersequent calculus for modal propositional logic S5. We show that all rules of this calculus are invertible and that the rules of weakening, contraction, and cut are admissible. Soundness and completeness are established as well.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  44.  41
    Hypersequent Calculi for S5: The Methods of Cut Elimination.Kaja Bednarska & Andrzej Indrzejczak - 2015 - Logic and Logical Philosophy 24 (3):277–311.
  45. A Note on S5.Hector-Neri Castaneda - 1966 - Journal of Symbolic Logic 31 (2):275-275.
    Direct download  
     
    Export citation  
     
    Bookmark  
  46.  2
    A note on S5.Hector-Neri Castaneda - 1964 - Journal of Symbolic Logic 29 (4):191-192.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  47. Logika deontyczna W systemie s5.Edward Nieznanski - 2007 - Studia Philosophiae Christianae 43 (2):5-20.
    No categories
     
    Export citation  
     
    Bookmark  
  48.  23
    A matrix adequate for s5 with mp and rn.Jacek Hawranek - 1980 - Bulletin of the Section of Logic 9 (3):122-123.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  49.  68
    A Note on Algebraic Semantics for S5 with Propositional Quantifiers.Wesley H. Holliday - 2019 - Notre Dame Journal of Formal Logic 60 (2):311-332.
    In two of the earliest papers on extending modal logic with propositional quantifiers, R. A. Bull and K. Fine studied a modal logic S5Π extending S5 with axioms and rules for propositional quantification. Surprisingly, there seems to have been no proof in the literature of the completeness of S5Π with respect to its most natural algebraic semantics, with propositional quantifiers interpreted by meets and joins over all elements in a complete Boolean algebra. In this note, we give such a proof. (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  50.  13
    On the extensions of $S5$.Peter Gärdenfors - 1973 - Notre Dame Journal of Formal Logic 14 (2):277-280.
1 — 50 / 398