The Impossibility of Consistent Extension for Peano Arithmetic: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

24 December 2023

  • curprev 04:2204:22, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 1,643 bytes +110‎ No edit summary undo
  • curprev 04:2104:21, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 1,533 bytes +1,533‎ Created page with "Title: The Impossibility of Consistent Extension for Peano Arithmetic Abstract: This research article explores the possibility of extending Peano Arithmetic (PA) to a complete theory. PA is a system of mathematics that consists of logical and algebraic axioms, along with an infinite family of Induction Axioms. The main question posed by David Hilbert was whether it is possible to extend PA to a recursively enumerable (r.e.) set of axioms. Gödel provided a negative answ..."
Retrieved from "https://simplesci.org/wiki/The_Impossibility_of_Consistent_Extension_for_Peano_Arithmetic"