Saltar al contenido principal

ETHNOS_APP

Inicio • Búsqueda • Revistas • Lista 0

Everything is Knowable – How to Get to Know Whether a Proposition is True

Datos Bibliográficos

ID20143092
AutoresHans van Ditmarsch (0000-0003-4526-8687, Universidad de Sevilla), Wiebe Van Der Hoek (0000-0002-5257-8512, University of Liverpool), PETAR ILIEV (University of Liverpool)
Año2012
Volumen78
Número2
Páginas93-114
Fecha de publicación2012-05-01
Peer ReviewedSí
Open AccessSí
TipoARTICLE
RevistaTheoria (JOURNAL)
Identificadores de la revistaISSN: 0040-5825 • E-ISSN: 1755-2567
EditorialWiley (PUBLISHER • GB)
DOI10.1111/j.1755-2567.2011.01119.x
OpenAlexW1587154603
IdiomaEN
Citas recibidas5
Referencias citadas20

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 KD 45, respectively). If we interpret ‘successful’ as ‘known after its announcement’ and ‘knowable’ as ‘known after some announcement’, successful implies knowable. Knowable does not imply successful: there is a proposition φ that is not known after its announcement but there is another announcement after which φ is known. We show that all propositions are knowable in the more general sense that for each proposition, it can become known or its negation can become known. We can get to know whether it is true: ◊( Kφ ∨ K ¬ φ ). This result comes at a price. We cannot get to know whether the proposition was true. This restricts the philosophical relevance of interpreting ‘knowable’ as ‘known after an announcement’

Cognitive science · Epistemology · Linguistics · Negation · Political science · Proposition · Relevance (law) · Epistemology, Ethics, and Metaphysics · Law · Logic, Reasoning, and Knowledge · Multi-Agent Systems and Negotiation · Philosophy · Psychology

  • The dynamic approach to knowability

    Open Access•Joke Heylen•Synthese•2025

  • Everything is learnable, once it is settled

    Open Access•Kevin Xu•Synthese•2021

  • Information dynamics and uniform substitution

    Open Access•Wesley H Holliday, Tomohiro Hoshi et al.•Synthese•2013

  • Disagreement-based uncertainty for decision making

    Open Access•Malvina Ongaro•Synthese•2025

  • Dynamic Epistemic Logic II

    Open Access•Eric Pacuit•Philosophy Compass•2013

  • Dynamic Epistemic Logic

    Open Access•Hans van Ditmarsch, Wiebe Van Der Hoek et al.•Dynamic Epistemic Logic•2008

  • A logical analysis of some value concepts

    Open Access•Frederic B Fitch•The Journal of Symbolic Logic•1963

  • Language, Truth and Logic

    Open Access•Taha Ezzati G•Nature•1936

  • The Logic of Theory Change

    Open Access•André Fuhrmann, Michael Morreau•Logic of Theory Change, Workshop…•1991

  • The Secret of My Success

    Open Access•Hans van Ditmarsch, Hans Ditmarsch et al.•Synthese•2006

  • Realism

    Open Access•Michael Dummett•Synthese•1982

  • The Secret of My Success

    Open Access•Hans van Ditmarsch, Barteld Kooi•Synthese•2006

  • Logics of public communications

    Open Access•Jan Plaza, Jan A Plaza•Synthese•2007

  • The Surprise Examination in Dynamic Epistemic Logic

    Open Access•Jelle Gerbrandy•Synthese•2007

  • Language, Truth, and Logic

    Marvin Farber, Alfred J Ayer•The Philosophical Review•1938

Obras citantes distintas5
Citas por año0,38
Intervalo de citas2013 - 2025 (13)
Velocidad de citaciónrecent
Altamente citadoNo
Tipos de citaNeutras: 5
Ethnos_APP • Proyecto Open Source • Licencia MIT • Frontend v2.0.0 • Privacidad y Cookies • Documentación de la API: api.ethnos.app/docs • Código de la API: GitHub • DOI: 10.5281/zenodo.17049435 • Código del Frontend: GitHub • DOI: 10.5281/zenodo.17050053 • cruz.rio.br • Expectantes Misericordiae