BEGIN:VCALENDAR
PRODID:-//Grails iCalendar plugin//NONSGML Grails iCalendar plugin//EN
VERSION:2.0
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VEVENT
DTSTAMP:20260604T175948Z
DTSTART;TZID=Australia/Melbourne:20210316T113000
DTEND;TZID=Australia/Melbourne:20210316T130000
SUMMARY:A Cumulative Case Argument for Infallibilism
UID:20260606T155645Z-iCalPlugin-Grails@philevents-web-bd7db559-gt5qm
TZID:Australia/Melbourne
LOCATION:Zoom\, Melbourne\, Australia\, Australia
DESCRIPTION:<p><strong>Dr Nevin Climenhaga (ACU)</strong></p>\n<p>&ldquo\;A Cumulative Case Argument for Infallibilism.&rdquo\;</p>\n<p>&nbsp\;I present a cumulative case for an infallibilist theory of knowledge\, according to which we know all and only those propositions that are certain for us. I argue that this theory can easily explain the truth of eight plausible claims about knowledge:</p>\n<p>(1)&nbsp\;&nbsp\; There is a qualitative difference between knowledge and non-knowledge.</p>\n<p>(2)&nbsp\;&nbsp\; Knowledge is valuable in a way that non-knowledge is not.</p>\n<p>(3)&nbsp\;&nbsp\; Subjects in Gettier cases do not have knowledge.</p>\n<p>(4)&nbsp\;&nbsp\; If S knows that P\, P is part of S&rsquo\;s evidence.</p>\n<p>(5)&nbsp\;&nbsp\; If S knows that P\, ~P is epistemically impossible for S.</p>\n<p>(6)&nbsp\;&nbsp\; If S knows that P\, S can rationally act as if P.</p>\n<p>(7)&nbsp\;&nbsp\; If S knows that P\, S can rationally stop inquiring whether P.</p>\n<p>(8)&nbsp\;&nbsp\; If S knows each of {P1\, P2\, &hellip\; P<em>n</em>}\, and competently deduces Q from these propositions\, S knows that Q.</p>\n<p>I then argue that the skeptical costs of this theory are outweighed by its explanatory power.</p>\n<p>Join Zoom Meeting</p>\n<p><a href="https://deakin.zoom.us/j/95658673906">https://deakin.zoom.us/j/95658673906</a></p>
ORGANIZER;CN=George Duke:
METHOD:PUBLISH
END:VEVENT
END:VCALENDAR
