Switch to: References

Citations of:

Formal problems about knowledge

In Paul K. Moser (ed.), The Oxford handbook of epistemology. New York: Oxford University Press. pp. 539 (2002)

Add citations

You must login to add citations.
  1. Closed without boundaries.Elia Zardini - 2020 - Synthese 199 (Suppl 3):641-679.
    The paper critically discusses two prominent arguments against closure principles for knowledge. The first one is the “argument from aggregation”, claiming that closure under conjunction has the consequence that, if one individually knows i premises, one also knows their i-fold conjunction—yet, every one of the premises might exhibit interesting positive epistemic properties while the i-fold conjunction might fail to do so. The second one is the “argument from concatenation”, claiming that closure under entailment has the consequence that, if one knows (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Dynamic Epistemic Logic I: Modeling Knowledge and Belief.Eric Pacuit - 2013 - Philosophy Compass 8 (9):798-814.
    Dynamic epistemic logic, broadly conceived, is the study of logics of information change. This is the first paper in a two-part series introducing this research area. In this paper, I introduce the basic logical systems for reasoning about the knowledge and beliefs of a group of agents.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Truthmaker Gaps and the No-No Paradox.Patrick Greenough - 2011 - Philosophy and Phenomenological Research 82 (3):547 - 563.
    Consider the following sentences: The neighbouring sentence is not true. The neighbouring sentence is not true. Call these the no-no sentences. Symmetry considerations dictate that the no-no sentences must both possess the same truth-value. Suppose they are both true. Given Tarski’s truth-schema—if a sentence S says that p then S is true iff p—and given what they say, they are both not true. Contradiction! Conclude: they are not both true. Suppose they are both false. Given Tarski’s falsity-schema—if a sentence S (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations