Switch to: Citations

Add references

You must login to add references.
  1. Reference and Reflexivity.John Perry - 2001 - Stanford, Calif.: Center for the Study of Language and Inf.
    Following his recently expanded _The Problem of the Essential Indexical and Other Essays,_ John Perry develops a reflexive-referential' account of indexicals, demonstratives and proper names. On these issues the philosophy of language in the twentieth century was shaped by two competing traditions, descriptivist and referentialist. Oddly, the classic referentialist texts of the 1970s by Kripke, Donnellan, Kaplan and others were seemingly refuted almost a century earlier by co-reference and no-reference problems raised by Russell and Frege. Perry's theory, borrowing ideas from (...)
    Download  
     
    Export citation  
     
    Bookmark   209 citations  
  • Blindspots.Roy A. Sorensen - 1988 - New York: Oxford University Press.
    Sorensen here offers a unified solution to a large family of philosophical puzzles and paradoxes through a study of "blindspots": consistent propositions that cannot be rationally accepted by certain individuals even though they might by true.
    Download  
     
    Export citation  
     
    Bookmark   254 citations  
  • What one may come to know.van Benthem Johan - 2004 - Analysis 64 (2):95–105.
    The general verificationist thesis says that What is true can be known or formally: φ → ◊Kφ VT Fitch's argument trivializes this principle. It uses a weak modal epistemic logic to show that VT collapses truth and knowledge, by taking a clever substitution instance for φ: P ∧ ¬KP → ◊ K(P ∧ ¬KP) Then we have the following chain of three conditionals (a) ◊ K(P ∧ ¬KP) → ◊ (KP ∧ K¬KP) in the minimal modal logic for the knowledge (...)
    Download  
     
    Export citation  
     
    Bookmark   26 citations  
  • Recalcitrant variations of the prediction paradox.Roy A. Sorensen - 1982 - Australasian Journal of Philosophy 60 (4):355 – 362.
    Download  
     
    Export citation  
     
    Bookmark   18 citations  
  • Naming and Necessity: Lectures Given to the Princeton University Philosophy Colloquium.Saul A. Kripke - 1980 - Cambridge, MA: Harvard University Press. Edited by Darragh Byrne & Max Kölbel.
    A transcript of three lectures, given at Princeton University in 1970, which deals with (inter alia) debates concerning proper names in the philosophy of language.
    Download  
     
    Export citation  
     
    Bookmark   1527 citations  
  • What one may come to know.J. van Benthem - 2004 - Analysis 64 (2):95-105.
    Download  
     
    Export citation  
     
    Bookmark   51 citations  
  • (4 other versions)Naming and Necessity.S. Kripke - 1972 - Tijdschrift Voor Filosofie 45 (4):665-666.
    Download  
     
    Export citation  
     
    Bookmark   2750 citations  
  • The Surprise Examination in Dynamic Epistemic Logic.J. Gerbrandy - 2007 - Synthese 155 (1):21-33.
    We examine the paradox of the surprise examination using dynamic epistemic logic. This logic contains means of expressing epistemic facts as well as the effects of learning new facts, and is therefore a natural framework for representing the puzzle. We discuss a number of different interpretations of the puzzle in this context, and show how the failure of principle of success, that states that sentences, when learned, remain to be true and come to be believed, plays a central role in (...)
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Information dynamics and uniform substitution.Wesley H. Holliday, Tomohiro Hoshi & Thomas F. Icard Iii - 2013 - Synthese 190 (1):31-55.
    The picture of information acquisition as the elimination of possibilities has proven fruitful in many domains, serving as a foundation for formal models in philosophy, linguistics, computer science, and economics. While the picture appears simple, its formalization in dynamic epistemic logic reveals subtleties: given a valid principle of information dynamics in the language of dynamic epistemic logic, substituting complex epistemic sentences for its atomic sentences may result in an invalid principle. In this article, we explore such failures of uniform substitution. (...)
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • The Secret of My Success.Hans Van Ditmarsch & Barteld Kooi - 2006 - Synthese 151 (2):201-232.
    In an information state where various agents have both factual knowledge and knowledge about each other, announcements can be made that change the state of information. Such informative announcements can have the curious property that they become false because they are announced. The most typical example of that is 'fact p is true and you don't know that', after which you know that p, which entails the negation of the announcement formula. The announcement of such a formula in a given (...)
    Download  
     
    Export citation  
     
    Bookmark   43 citations  
  • (1 other version)The Secret of My Success.Hans Ditmarsch & Barteld Kooi - 2006 - Synthese 151 (2):201-232.
    In an information state where various agents have both factual knowledge and knowledge about each other, announcements can be made that change the state of information. Such informative announcements can have the curious property that they become false because they are announced. The most typical example of that is ‘fact p is true and you don’t know that’, after which you know that p, which entails the negation of the announcement formula. The announcement of such a formula in a given (...)
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • Moorean Phenomena in Epistemic Logic.Wesley H. Holliday & Thomas F. Icard - 2010 - In Lev Dmitrievich Beklemishev, Valentin Goranko & Valentin Shehtman (eds.), Advances in Modal Logic 8. London, England: College Publications. pp. 178-199.
    A well-known open problem in epistemic logic is to give a syntactic characterization of the successful formulas. Semantically, a formula is successful if and only if for any pointed model where it is true, it remains true after deleting all points where the formula was false. The classic example of a formula that is not successful in this sense is the “Moore sentence” p ∧ ¬BOXp, read as “p is true but you do not know p.” Not only is the (...)
    Download  
     
    Export citation  
     
    Bookmark   31 citations