Formal Axiomatic Systems

Serafim Batzoglou
Additional contact information
Serafim Batzoglou: Seer Inc.

Chapter Chapter 1 in Introduction to Incompleteness, 2024, pp 3-13 from Springer

Abstract: Abstract Every mathematical proof can be formalized; otherwise, it is not a proof. The mathematical assumptions on which the proof stands and the logical rules by which each step of the proof follows from previous steps can be made explicit and precise. Mathematicians don’t usually do this; instead, they take shortcuts—quoting previous theorems, using English, skipping derivation steps, and often making the unfortunate use of the dreaded “clearly”. Nevertheless, every valid proof can be expanded and turned into a fully formal one.

Date: 2024
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-031-64217-3_1

Ordering information: This item can be ordered from
http://www.springer.com/9783031642173

DOI: 10.1007/978-3-031-64217-3_1

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().