Switch to: Citations

Add references

You must login to add references.
  1. (1 other version)Knowledge and Grounds: A Comment on Mr. Gettier's Paper.M. Clark - 1963 - Analysis 24 (2):46-48.
    Download  
     
    Export citation  
     
    Bookmark   54 citations  
  • On Logics of Knowledge and Belief.Robert Stalnaker - 2006 - Philosophical Studies 128 (1):169-199.
    Download  
     
    Export citation  
     
    Bookmark   140 citations  
  • (1 other version)Knowledge and Grounds: A Comment on Mr. Gettier's Paper.Michael Clark - 1963 - (Repr. In Bobbs-Merrill Reprint Series; Gendin and Hoffman, Eds., Introduction to Philosophy, 1973; Lucey, Ed., On Knowing and the Known, 1996; Huemer, Ed., The Epistemology Reader, 2002) Analysis 24 (2):46 - 48.
    Download  
     
    Export citation  
     
    Bookmark   50 citations  
  • (1 other version)Knowledge: Undefeated justified true belief.Keith Lehrer & Thomas Paxson - 1969 - Journal of Philosophy 66 (8):225-237.
    The recently offered, Purported counter-Examples to justified, True belief analyses of knowledge are looked at with some care and all found to be either incoherent or inconclusive. It is argued that justified, True belief analyses are based on sound insight into the concept of knowledge. The distinction between having been justified in claiming to know something and actually having known it is used in an effort to get the discussion of knowledge back on the right track.
    Download  
     
    Export citation  
     
    Bookmark   155 citations  
  • A proposed definition of propositional knowledge.Peter D. Klein - 1971 - Journal of Philosophy 68 (16):471-482.
    Download  
     
    Export citation  
     
    Bookmark   73 citations  
  • Two modellings for theory change.Adam Grove - 1988 - Journal of Philosophical Logic 17 (2):157-170.
    Download  
     
    Export citation  
     
    Bookmark   313 citations  
  • (1 other version)A logical analysis of some value concepts.Frederic Fitch - 1963 - Journal of Symbolic Logic 28 (2):135-142.
    Download  
     
    Export citation  
     
    Bookmark   236 citations  
  • Everything is Knowable – How to Get to Know Whether a Proposition is True.Hans van Ditmarsch, Wiebe van der Hoek & Petar Iliev - 2012 - Theoria 78 (2):93-114.
    Fitch showed that not every true proposition can be known in due time; in other words, that not every proposition is knowable. Moore showed that certain propositions cannot be consistently believed. A more recent dynamic phrasing of Moore-sentences is that not all propositions are known after their announcement, i.e., not every proposition is successful. Fitch's and Moore's results are related, as they equally apply to standard notions of knowledge and belief (S 5 and KD45, respectively). If we interpret ‘successful’ as (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Stability, strength and sensitivity: Converting belief into knowledge.Hans Rott - 2004 - Erkenntnis 61 (2-3):469-493.
    In this paper I discuss the relation between various properties that have been regarded as important for determining whether or not a belief constitutes a piece of knowledge: its stability, strength and sensitivity to truth, as well as the strength of the epistemic position in which the subject is with respect to this belief. Attempts to explicate the relevant concepts more formally with the help of systems of spheres of possible worlds (à la Lewis and Grove) must take care to (...)
    Download  
     
    Export citation  
     
    Bookmark   18 citations  
  • A Topological Approach to Full Belief.Alexandru Baltag, Nick Bezhanishvili, Aybüke Özgün & Sonja Smets - 2019 - Journal of Philosophical Logic 48 (2):205-244.
    Stalnaker, 169–199 2006) introduced a combined epistemic-doxastic logic that can formally express a strong concept of belief, a concept of belief as ‘subjective certainty’. In this paper, we provide a topological semantics for belief, in particular, for Stalnaker’s notion of belief defined as ‘epistemic possibility of knowledge’, in terms of the closure of the interior operator on extremally disconnected spaces. This semantics extends the standard topological interpretation of knowledge with a new topological semantics for belief. We prove that the belief (...)
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • Knowledge and its Limits. [REVIEW]L. Horsten - 2000 - Tijdschrift Voor Filosofie 64 (1):200-201.
    Download  
     
    Export citation  
     
    Bookmark   2393 citations  
  • (1 other version)Recent work in epistemic logic.Wolfgang Lenzen - 1978 - Acta Philosophica Fennica 30:1-219.
    Download  
     
    Export citation  
     
    Bookmark   61 citations  
  • Dynamic logic for belief revision.Johan van Benthem - 2007 - Journal of Applied Non-Classical Logics 17 (2):129-155.
    We show how belief revision can be treated systematically in the format of dynamicepistemic logic, when operators of conditional belief are added. The core engine consists of definable update rules for changing plausibility relations between worlds, which have been proposed independently in the dynamic-epistemic literature on preference change. Our analysis yields two new types of modal result. First, we obtain complete logics for concrete mechanisms of belief revision, based on compositional reduction axioms. Next, we show how various abstract postulates for (...)
    Download  
     
    Export citation  
     
    Bookmark   177 citations  
  • (1 other version)Dynamic Epistemic Logic.Hans van Ditmarsch, Wiebe van Der Hoek & Barteld Kooi - 2008 - Studia Logica 89 (3):441-445.
    Download  
     
    Export citation  
     
    Bookmark   211 citations  
  • Knowability as potential knowledge.André Fuhrmann - 2014 - Synthese 191 (7):1627-1648.
    The thesis that every truth is knowable is usually glossed by decomposing knowability into possibility and knowledge. Under elementary assumptions about possibility and knowledge, considered as modal operators, the thesis collapses the distinction between truth and knowledge (as shown by the so-called Fitch-argument). We show that there is a more plausible interpretation of knowability—one that does not decompose the notion in the usual way—to which the Fitch-argument does not apply. We call this the potential knowledge-interpretation of knowability. We compare our (...)
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Announcement as effort on topological spaces.Hans van Ditmarsch, Sophia Knight & Aybüke Özgün - 2019 - Synthese 196 (7):2927-2969.
    We propose a multi-agent logic of knowledge, public announcements and arbitrary announcements, interpreted on topological spaces in the style of subset space semantics. The arbitrary announcement modality functions similarly to the effort modality in subset space logics, however, it comes with intuitive and semantic differences. We provide axiomatizations for three logics based on this setting, with S5 knowledge modality, and demonstrate their completeness. We moreover consider the weaker axiomatizations of three logics with S4 type of knowledge and prove soundness and (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • (1 other version)Prolegomena to dynamic logic for belief revision.Hans P. Van Ditmarsch - 2005 - Synthese 147 (2):229-275.
    In ‘belief revision’ a theory is revised with a formula φ resulting in a revised theory . Typically, is in , one has to give up belief in by a process of retraction, and φ is in . We propose to model belief revision in a dynamic epistemic logic. In this setting, we typically have an information state (pointed Kripke model) for the theory wherein the agent believes the negation of the revision formula, i.e., wherein is true. The revision with (...)
    Download  
     
    Export citation  
     
    Bookmark   61 citations  
  • Topological reasoning and the logic of knowledge.Andrew Dabrowski, Lawrence S. Moss & Rohit Parikh - 1996 - Annals of Pure and Applied Logic 78 (1-3):73-110.
    We present a bimodal logic suitable for formalizing reasoning about points and sets, and also states of the world and views about them. The most natural interpretation of the logic is in subset spaces , and we obtain complete axiomatizations for the sentences which hold in these interpretations. In addition, we axiomatize the validities of the smaller class of topological spaces in a system we call topologic . We also prove decidability for these two systems. Our results on topologic relate (...)
    Download  
     
    Export citation  
     
    Bookmark   47 citations  
  • Logics for multi-subset spaces.Bernhard Heinemann - 2010 - Journal of Applied Non-Classical Logics 20 (3):219-240.
    We generalize Moss and Parikh's logic of knowledge, effort, and topological reasoning, in two ways. We develop both a multi-agent and a multi-method setting for it. In each of these cases, we prove a corresponding soundness and completeness theorem, and we show that the new logics are decidable. Our methods of proof rely on those for the original system. This might have been expected, since that system is conservatively extended for the given situation. Several technical details are different nevertheless here.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • (1 other version)Prolegomena to Dynamic Logic for Belief Revision.Hans P. Van Ditmarsch - 2005 - Synthese 147 (2):229-275.
    In ‘belief revision’ a theory\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\cal K}$$\end{document} is revised with a formula φ resulting in a revised theory \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\cal K}\ast\varphi$$\end{document}. Typically, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\neg\varphi$$\end{document} is in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\cal K}$$\end{document}, one has to give up belief in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\neg\varphi$$\end{document} by a process (...)
    Download  
     
    Export citation  
     
    Bookmark   33 citations  
  • What one may come to know.J. van Benthem - 2004 - Analysis 64 (2):95-105.
    Download  
     
    Export citation  
     
    Bookmark   51 citations  
  • Topological Subset Space Models for Public Announcements.Adam Bjorndahl - 2018 - In Hans van Ditmarsch & Gabriel Sandu (eds.), Jaakko Hintikka on Knowledge and Game Theoretical Semantics. Cham, Switzerland: Springer. pp. 165-186.
    We reformulate a key definition given by Wáng and Ågotnes to provide semantics for public announcements in subset spaces. More precisely, we interpret the precondition for a public announcement of ???? to be the “local truth” of ????, semantically rendered via an interior operator. This is closely related to the notion of ???? being “knowable”. We argue that these revised semantics improve on the original and offer several motivating examples to this effect. A key insight that emerges is the crucial (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Announcement as effort on topological spaces.Aybüke Özgün, Sophia Knight & Hans Ditmarsch - 2019 - Synthese 196 (7):2927-2969.
    We propose a multi-agent logic of knowledge, public announcements and arbitrary announcements, interpreted on topological spaces in the style of subset space semantics. The arbitrary announcement modality functions similarly to the effort modality in subset space logics, however, it comes with intuitive and semantic differences. We provide axiomatizations for three logics based on this setting, with S5 knowledge modality, and demonstrate their completeness. We moreover consider the weaker axiomatizations of three logics with S4 type of knowledge and prove soundness and (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations