1

Are there any recent books or papers regarding (and focused on) this subject? I am very interested in learning as much as I can about undecidable theorems and methods/theory for testing if a math statement is undecidable. For context, I became interested by reading a passage in an old "Logic and Combinatorics" book from 1987 showing that in a certain formal system that you could not prove a modified finite ramsey theorem without referencing infinite sets. I'm not sure where to even place this as part of a subject when I search for it (and I have searched for it, most of the stuff I find is from a couple of decades ago). Is this considered purely part of logic or proof theory? Or is it just something that "pops up" when something you are trying to prove doesn't behave with your axioms?

  • 1
    generally, this falls within the realms of model theory. – Rushabh Mehta Aug 06 '21 at 00:47
  • 2
    The "stuff" you find from a couple of decades ago has not stopped being valid. To get as much learning as you can, start with the basics. Understand the definitions of formal logic and axiomatic theories developed in the first half of the last century before venturing beyond. – hardmath Aug 06 '21 at 01:00

1 Answers1

4

A great source for this is Harvey Friedman's extensive body of work. Check out his website, Harvey's Foundational Adventures.

There's also the excellent book by Stephen Simpson:

Stephen G. Simpson, Subsystems of second order arithmetic, Perspectives in Logic. Cambridge: Cambridge University Press; Urbana, IL: Association for Symbolic Logic (ASL) (ISBN 978-0-521-15014-9/pbk). xvi, 444 p. (2010). ZBL1205.03002.

For other material, a good search phrase is "reverse mathematics". The Wikipedia article Reverse Mathematics provides additional information and sources.

Mitchell Spector
  • 9,917
  • 3
  • 16
  • 34