Skip to main content

The Intensional Structure of Epistemic Convictions

  • Conference paper
  • First Online:
Software Engineering and Formal Methods. SEFM 2020 Collocated Workshops (SEFM 2020)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 12524))

Included in the following conference series:

Abstract

We discuss an axiomatic setup as an appropriate account to the intensional structure of epistemic convictions. This includes a resolution of the problem of logical omniscience as well as the individual rendering of knowledge by different persons.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Our approach reassembles ideas which one also finds in Doyle’s Truth Maintenance Systems (TMSs), [5]. As TMSs were developed in the context of expert systems in Computer Science, they soon fell victim to complexity issues. For us it is, however, just the qualitative setup which matters from a philosophical point of view. The quantitative aspect may go out of control when one tries to explain and store every single step of a derivation.

  2. 2.

    For a fruitful discussion amoung different people it is, however, desirable that one can agree on the same starting points.

  3. 3.

    See the reference to “Vorhalle der Geometrie” for work of Moritz Pasch, one of the founding fathers of modern axiomatics, in [24, p. 80].

  4. 4.

    See [18] for a detailed discussion of AGM in our perspective.

  5. 5.

    Also cited in [1, p. 261].

  6. 6.

    The paragraph on logical omniscience in the article on Epistemic Logic in the Stanford Encyclopedia of Philosophy exposes here a certain helplessness [22, § 4].

  7. 7.

    Of course, one may study an idealized notion of knowability which should be closed under logical omniscience. But, in our view, this form of idealization goes to far to provide a tool to take up challenges concerned with knowledge of a person. Thus, we are explicitely at odds with the first part of the justification of this idealization by Gabbay and Woods [7, p. 158]:

    A logic is an idealization of certain sorts of real-life phenomena. By their very nature, idealizations misdescribe the behavior of actual agents. This is to be tolerated when two conditions are met. One is that the actual behavior of actual agents can defensibly be made out to approximate to the behavior of the ideal agents of the logician’s idealization. The other is the idealization’s facilitation of the logician’s discovery and demonstration of deep laws.

    .

  8. 8.

    There are other criticisms of the alternative approaches, like, for example, the “ontological overkill” of possible worlds [14], which we cannot discuss here. All these criticisms, of course, do not mean that those approaches do not have their merits; we just like to point to the conceptional difference with our account.

  9. 9.

    Ryle’s distinction of knowing how and knowing that [23] points into another direction. But we share with him, at least, the opposition to a raw knowing that. We like to complement it by knowing why.

  10. 10.

    This sketches the qualitative aspect of our account only; in the presence of a plausibility order of beliefs, for instance, one may revise first the basic convictions with lowest plausibility.

  11. 11.

    The question how different derivations should compared with each other was rised by Hilbert in his 24th problem. This problem was not included in his famous problems lecture at the International Congress of Mathematicians in 1900 in Paris but remained unpublished in his notebook before it was discovered in 2000. Since then, it triggered a lot of a research, including the question of identity of proofs [10]. Our approch is not intended to contribute to a solution of Hilbert’s 24th problem, but rather the other way around: a satisfactory concept for identity of proofs may allow to abstract from the concrete derivations we are relying on.

  12. 12.

    More moderately expressed: unpredictable. The situation is not too different from the question whether you can compute the roulette results of the Monte Carlo casino. Of course, you can do it for those outcomes which already took place in a finite time period; but you will not be able to compute it in advance.

  13. 13.

    For knowledge, we tactically assume here logical reasoning, only. The case of inductive reasoning is—in the case of knowledge—more delicate as it questions the status of knowledge in general.

  14. 14.

    When we subscribe the No False Lemmas condition, it goes without saying that also the “axioms” presupposed for the knowledge need to be true; this is not the case for the example discussed in [11, § 4].

  15. 15.

    Although inductive reasoning, used to justify a universal statement which is supposed to be taken as an axiom, might enter here, rather than as part of the internal aspect of knowledge.

  16. 16.

    Here, we like to express serious doubts that justifications, in terms of derivations, can be “learned” just statistically, in the same way, as it is unlikely that AI could statistically generate a C++ compiler.

References

  1. Aaronson, S.: Why philosophers should care about computational complexity. In: Copeland, B.J., Posy, C.J., Shagrir, O. (eds.) Computability, pp. 261–327. MIT Press (2013)

    Google Scholar 

  2. Alchourrón, C., Gärdenfors, P., Makinson, D.: On the logic of theory change: partial meet functions for contraction and revision. J. Symbolic Logic 50(2), 510–530 (1985)

    Article  MathSciNet  Google Scholar 

  3. Barwise, J., Perry, J.: Situations and Attitudes. MIT Press, Bronx (1983)

    MATH  Google Scholar 

  4. D’Agostino, M.: Tractable depth-bounded logics and the problem of logical omniscience. In: Hosni, H., Montagna, F., (eds.) Probability, Uncertainty and Rationality, pp. 245–275. Edizioni Scuola Normale Superiore, Springer (2010)

    Google Scholar 

  5. Doyle, J.: A truth maintenance system. Artif. Intell. 12, 231–272 (1979)

    Article  MathSciNet  Google Scholar 

  6. Fagin, R., Halpern, J.Y.: Belief, awareness, and limited reasoning. Artif. Intell. 34, 39–76 (1988)

    Article  MathSciNet  Google Scholar 

  7. Gabbay, D.M., Woods, J.: The new logic. Logic J. IGPL 9(2), 141–174 (2001)

    Article  MathSciNet  Google Scholar 

  8. Hilbert, D.: Neubegründung der Mathematik. Abhandlungen aus dem Mathematischen Seminar der Hamburgischen Universität 1, 157–177 (1922)

    Article  Google Scholar 

  9. Hintikka, J.: Impossible possible worlds vindicated. J. Philos. Logic 4(4), 475–484 (1975)

    Article  MathSciNet  Google Scholar 

  10. Hipolito, I., Kahle, R.: Theme issue on “The notion of simple proof - Hilbert’s 24th problem". Philosophical Transactions of the Royal Society A, 377 (2019)

    Google Scholar 

  11. Ichikawa, J.J., Steup, M.: The analysis of knowledge. In: Zalta, E.N. (eds.), The Stanford Encyclopedia of Philosophy. Metaphysics Research Lab, Stanford University, summer 2018 edition (2018)

    Google Scholar 

  12. Kahle, R.: Structured belief bases. Logic Logical Philos. 10, 49–62 (2002)

    MathSciNet  MATH  Google Scholar 

  13. Kahle, R.: A proof-theoretic view of necessity. Synthese 148(3), 659–673 (2006)

    Article  MathSciNet  Google Scholar 

  14. Kahle, R.: Against possible worlds. In: Degremont, C., Keiff, L., Rückert, H. (eds.), Dialogues, Logics and Other Strange Things. Essays in Honour of Shahid Rahman, vol. 7 of Tributes, pp. 235–253. College Publications (2008)

    Google Scholar 

  15. Kahle, R.: Modalities without worlds. In: Rahman, S., Primiero, G., Marion, M. (eds.), The Realism-Antirealism Debate in the Age of Alternative Logics, vol. 23 of Logic, Epistemology and the Unity of Science, pp. 101–118. Springer, Dordrecht (2012) https://doi.org/10.1007/978-94-007-1923-1_6

  16. Kahle, R.: Towards a proof-theoretic semantics of equalities. In: Piecha, T., Schroeder-Heister, P. (eds.) Advances in Proof-Theoretic Semantics. TL, vol. 43, pp. 153–160. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-22686-6_9

    Chapter  Google Scholar 

  17. Kahle, R.: The Logical Cone. If CoLog J. Logics their Appl. 4(4), 1087–1101 (2017). Special Issue Dedicated to the Memory of Grigori Mints. Dov Gabbay and Oleg Prosorov (Guest Editors)

    Google Scholar 

  18. Kahle, R.: Belief Revision Revisited. In: Pombo, O., Pato, A., Redmond, J. (eds.), Epistemologia, Lógica e Linguagem, vol. 11 of Colecção Documenta. Centro de Filosofia das Ciências da Universidade de Lisboa (2019)

    Google Scholar 

  19. Kukin, V D.: Heisenberg representation. Encyclopedia of Mathematics. http://encyclopediaofmath.org/index.php?title=Heisenberg_representation&oldid=44704

  20. Kukin, V.D.: Schrödinger representation. Encyclopedia of Mathematics. http://encyclopediaofmath.org/index.php?title=Schr

  21. Küchlin, W.: Symbolische KI für die Produktkonfiguration in der Automobilindustrie. In: Mainzer, K. (eds.), Philosophisches Handbuch Künstliche Intelligenz. Springer, New York (2021) https://doi.org/10.1007/978-3-658-23715-8_53-1

  22. Rendsvig, R., Symons, J.: Epistemic logic. In: Zalta, E.N. (ed.), The Stanford Encyclopedia of Philosophy. Metaphysics Research Lab, Stanford University, summer 2019 edition (2019)

    Google Scholar 

  23. Ryle, G.: Konwing how and knowing that. Proc. Aristotelian Soc. 46, 1–16 (1945–46)

    Google Scholar 

  24. Tamari, D.: Moritz Pasch (1843–1930). Shaker Verlag (2007)

    Google Scholar 

  25. Turing, A.: Computing machinery and intelligence. Mind 59, 433–460 (1950)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgement

Research supported by the Udo Keller Foundation and by the Portuguese Science Foundation, FCT, through the project UIDB/00297/2020 (Centro de Matemática e Aplicações).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Reinhard Kahle .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Kahle, R. (2021). The Intensional Structure of Epistemic Convictions. In: Cleophas, L., Massink, M. (eds) Software Engineering and Formal Methods. SEFM 2020 Collocated Workshops. SEFM 2020. Lecture Notes in Computer Science(), vol 12524. Springer, Cham. https://doi.org/10.1007/978-3-030-67220-1_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-67220-1_15

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-67219-5

  • Online ISBN: 978-3-030-67220-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics