On Mathematical Proving

Journal of Artificial General Intelligence 6 (1):130–149 (2015)
  Copy   BIBTEX

Abstract

This paper outlines a logical representation of certain aspects of the process of mathematical proving that are important from the point of view of Artificial Intelligence. Our starting point is the concept of proof-event or proving, introduced by Goguen, instead of the traditional concept of mathematical proof. The reason behind this choice is that in contrast to the traditional static concept of mathematical proof, proof-events are understood as processes, which enables their use in Artificial Intelligence in such contexts in which problem-solving procedures and strategies are studied. We represent proof-events as problem-centred spatio-temporal processes by means of the language of the calculus of events, which adequately captures certain temporal aspects of proof-events (i.e. that they have history and form sequences of proof-events evolving in time). Further, we suggest a “loose” semantics for the proof events by means of Kolmogorov’s calculus of problems. Finally, we expose the intented interpretations for our logical model from the fields of automated theorem-proving and Web-based collective proving.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,907

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Deleuze Challenges Kolmogorov on a Calculus of Problems.Jean-Claude Dumoncel - 2013 - Deleuze and Guatarri Studies 7 (2):169-193.
The cost of a cycle is a square.A. Carbone - 2002 - Journal of Symbolic Logic 67 (1):35-60.
Proof-events: transgressing traditional concepts of mathematical proof.Ioannis Vandoulakis - 2020 - In Barbara Pieronkiewicz (ed.), Different perspectives on transgressions in mathematics and its education. Wydawnictwo Naukowe Uniwersytetu Pedagogicznego Kraków. pp. 93-104.
Finite Models of Some Substructural Logics.Wojciech Buszkowski - 2002 - Mathematical Logic Quarterly 48 (1):63-72.
The Calculus of Natural Calculation.René Gazzari - 2021 - Studia Logica 109 (6):1375-1411.
Integrating TPS and OMEGA.Christoph Benzmüller, Matt Bishop & Volker Sorge - 1999 - Journal of Universal Computer Science 5 (3):188-207.
Kolmogorov Complexity and Noncomputability.George Davie - 2002 - Mathematical Logic Quarterly 48 (4):574-581.
Cut-elimination and proof-search for bi-intuitionistic logic using nested sequents.Rajeev Goré, Linda Postniece & Alwen Tiu - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 43-66.
Socratic proofs.Andrzej Wiśniewski - 2004 - Journal of Philosophical Logic 33 (3):299-326.

Analytics

Added to PP
2023-05-30

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Author's Profile

Ioannis Vandoulakis
Open University of Cyprus

References found in this work

No references found.

Add more references