Back to first pageBack to first page Centre for Artificial Intelligence of UNL
Browse our site
You are here:

Publication details

Go back
Publication details
Main information
Checking proofs
2013
alama2013checking
Contemprary argumentation theory tends to steer away from traditional formal logic. In the case of argumentation theory applied to mathematics, though, it is proper for argumentation theory to revisit formal logic owing to one the in-principle formalizability of mathematical arguments. Compltely formal proofs of substantial mathematical arguments suffer from well-known problems. But practical formalizations of substantial mathematical results are now available, thanks to the help provided by modern automated reasoning systems. In-principle formalizability has become in-practice formalizability. Such efforts are a resource for argumentation theory applied to mathematics because topics that might be thought to be essentially informal reappear in the computer-assisted, formal setting, prompting a fresh appraisal.
Book chapter
Jesse Alama, Reinhard Kahle
Andrew Aberdein, Ian Dove and
The Argument of Mathematics
Logic, Epistemology, and the Unity of Science
Springer
-
30
147-170
-
-
-
http://link.springer.com/chapter/10.1007/978-94-007-6534-4_9
Export formats
Jesse Alama and Reinhard Kahle, Checking proofs, in: Andrew Aberdein and Ian Dove and (eds), The Argument of Mathematics, Logic, Epistemology, and the Unity of Science, Springer, Vol. 30, Pag. 147-170, (http://link.springer.com/chapter/10.1007/978-94-007-6534-4_9), 2013.
<a href="/people/members/view.php?code=d18f2a73808637adda0742073904f056" class="author">Jesse Alama</a> and <a href="/people/members/view.php?code=2b403db3c66380c011a92d8f7831e542" class="author">Reinhard Kahle</a>, <b>Checking proofs</b>, in: Andrew Aberdein and Ian Dove and (eds), <u>The Argument of Mathematics</u>, Logic, Epistemology, and the Unity of Science, <a href="http://www.springer.com" title="Link to external entity..." target="_blank" class="publisher">Springer</a>, Vol. 30, Pag. 147-170, (<a href="http://link.springer.com/chapter/10.1007/978-94-007-6534-4_9" target="_blank">url</a>), 2013.
@incollection {alama2013checking, author = {Jesse Alama and Reinhard Kahle}, editor = {Andrew Aberdein and Ian Dove and}, title = {Checking proofs}, booktitle = {The Argument of Mathematics}, series = {Logic, Epistemology, and the Unity of Science}, publisher = {Springer}, volume = {30}, pages = {147-170}, url = {http://link.springer.com/chapter/10.1007/978-94-007-6534-4_9}, abstract = {Contemprary argumentation theory tends to steer away from traditional formal logic. In the case of argumentation theory applied to mathematics, though, it is proper for argumentation theory to revisit formal logic owing to one the in-principle formalizability of mathematical arguments. Compltely formal proofs of substantial mathematical arguments suffer from well-known problems. But practical formalizations of substantial mathematical results are now available, thanks to the help provided by modern automated reasoning systems. In-principle formalizability has become in-practice formalizability. Such efforts are a resource for argumentation theory applied to mathematics because topics that might be thought to be essentially informal reappear in the computer-assisted, formal setting, prompting a fresh appraisal.}, year = {2013}, }
Publication's urls
/publications/view.php?code=caf23c1b468959e65f82945e5c0f06e6
/publications/view.php?code=alama2013checking
Go back
Centre for Artificial Intelligence of UNL
Departamento de Informática, FCT/UNL
Quinta da Torre 2829-516 CAPARICA - Portugal
Tel. (+351) 21 294 8536 FAX (+351) 21 294 8541

Fundacao_FCT