Epistemic Closure and Epistemic Logic I: Relevant Alternatives and Subjunctivism
| LEADER | caa a22 4500 | ||
|---|---|---|---|
| 001 | 605539006 | ||
| 003 | CHVBK | ||
| 005 | 20210128100904.0 | ||
| 007 | cr unu---uuuuu | ||
| 008 | 210128e20150201xx s 000 0 eng | ||
| 024 | 7 | 0 | |a 10.1007/s10992-013-9306-2 |2 doi |
| 035 | |a (NATIONALLICENCE)springer-10.1007/s10992-013-9306-2 | ||
| 100 | 1 | |a Holliday |D Wesley |u Department of Philosophy, University of California, 314 Moses Hall #2390, 94720-2390, Berkeley, CA, USA |4 aut | |
| 245 | 1 | 0 | |a Epistemic Closure and Epistemic Logic I: Relevant Alternatives and Subjunctivism |h [Elektronische Daten] |c [Wesley Holliday] |
| 520 | 3 | |a Epistemic closure has been a central issue in epistemology over the last forty years. According to versions of the relevant alternatives and subjunctivist theories of knowledge, epistemic closure can fail: an agent who knows some propositions can fail to know a logical consequence of those propositions, even if the agent explicitly believes the consequence (having "competently deduced” it from the known propositions). In this sense, the claim that epistemic closure can fail must be distinguished from the fact that agents do not always believe, let alone know, the consequences of what they know—a fact that raises the "problem of logical omniscience” that has been central in epistemic logic. This paper, part I of II, is a study of epistemic closure from the perspective of epistemic logic. First, I introduce models for epistemic logic, based on Lewis's models for counterfactuals, that correspond closely to the pictures of the relevant alternatives and subjunctivist theories of knowledge in epistemology. Second, I give an exact characterization of the closure properties of knowledge according to these theories, as formalized. Finally, I consider the relation between closure and higher-order knowledge. The philosophical repercussions of these results and results from part II, which prompt a reassessment of the issue of closure in epistemology, are discussed further in companion papers. As a contribution to modal logic, this paper demonstrates an alternative approach to proving modal completeness theorems, without the standard canonical model construction. By "modal decomposition” I obtain completeness and other results for two non-normal modal logics with respect to new semantics. One of these logics, dubbed the logic of ranked relevant alternatives, appears not to have been previously identified in the modal logic literature. More broadly, the paper presents epistemology as a rich area for logical study. | |
| 540 | |a The Author(s), 2014 | ||
| 690 | 7 | |a Epistemic closure |2 nationallicence | |
| 690 | 7 | |a Epistemic logic |2 nationallicence | |
| 690 | 7 | |a Epistemology |2 nationallicence | |
| 690 | 7 | |a Modal logic |2 nationallicence | |
| 690 | 7 | |a Relevant alternatives |2 nationallicence | |
| 690 | 7 | |a Safety |2 nationallicence | |
| 690 | 7 | |a Sensitivity |2 nationallicence | |
| 690 | 7 | |a Subjunctivism |2 nationallicence | |
| 690 | 7 | |a Tracking |2 nationallicence | |
| 773 | 0 | |t Journal of Philosophical Logic |d Springer Netherlands |g 44/1(2015-02-01), 1-62 |x 0022-3611 |q 44:1<1 |1 2015 |2 44 |o 10992 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/s10992-013-9306-2 |q text/html |z Onlinezugriff via DOI |
| 898 | |a BK010053 |b XK010053 |c XK010000 | ||
| 900 | 7 | |a Metadata rights reserved |b Springer special CC-BY-NC licence |2 nationallicence | |
| 908 | |D 1 |a research-article |2 jats | ||
| 949 | |B NATIONALLICENCE |F NATIONALLICENCE |b NL-springer | ||
| 950 | |B NATIONALLICENCE |P 856 |E 40 |u https://doi.org/10.1007/s10992-013-9306-2 |q text/html |z Onlinezugriff via DOI | ||
| 950 | |B NATIONALLICENCE |P 100 |E 1- |a Holliday |D Wesley |u Department of Philosophy, University of California, 314 Moses Hall #2390, 94720-2390, Berkeley, CA, USA |4 aut | ||
| 950 | |B NATIONALLICENCE |P 773 |E 0- |t Journal of Philosophical Logic |d Springer Netherlands |g 44/1(2015-02-01), 1-62 |x 0022-3611 |q 44:1<1 |1 2015 |2 44 |o 10992 | ||