more on this theme     |     more from this thinker


Single Idea 19123

[filed under theme 5. Theory of Logic / K. Features of Logics / 3. Soundness ]

Full Idea

Gödel showed PA cannot be proved consistent from with PA. But 'reflection principles' can be added, which are axioms partially expressing the soundness of PA, by asserting what is provable. A Global Reflection Principle asserts full soundness.

Gist of Idea

If soundness can't be proved internally, 'reflection principles' can be added to assert soundness

Source

report of Kurt Gödel (On Formally Undecidable Propositions [1931]) by Halbach,V/Leigh,G.E. - Axiomatic Theories of Truth (2013 ver) 1.2

Book Ref

'Stanford Online Encyclopaedia of Philosophy', ed/tr. Stanford University [plato.stanford.edu], p.3


A Reaction

The authors point out that this needs a truth predicate within the language, so disquotational truth won't do, and there is a motivation for an axiomatic theory of truth.

Related Idea

Idea 19124 A natural theory of truth plays the role of reflection principles, establishing arithmetic's soundness [Halbach/Leigh]


The 18 ideas from 'On Formally Undecidable Propositions'

Prior to Gödel we thought truth in mathematics consisted in provability [Gödel, by Quine]
Gödel show that the incompleteness of set theory was a necessity [Gödel, by Hallett,M]
The limitations of axiomatisation were revealed by the incompleteness theorems [Gödel, by Koellner]
Second Incompleteness: nice theories can't prove their own consistency [Gödel, by Smith,P]
If soundness can't be proved internally, 'reflection principles' can be added to assert soundness [Gödel, by Halbach/Leigh]
The undecidable sentence can be decided at a 'higher' level in the system [Gödel]
Gödel's First Theorem sabotages logicism, and the Second sabotages Hilbert's Programme [Smith,P on Gödel]
There can be no single consistent theory from which all mathematical truths can be derived [Gödel, by George/Velleman]
First Incompleteness: arithmetic must always be incomplete [Gödel, by Smith,P]
Gödel showed that arithmetic is either incomplete or inconsistent [Gödel, by Rey]
Arithmetical truth cannot be fully and formally derived from axioms and inference rules [Gödel, by Nagel/Newman]
Gödel's Second says that semantic consequence outruns provability [Gödel, by Hanna]
First Incompleteness: a decent consistent system is syntactically incomplete [Gödel, by George/Velleman]
Second Incompleteness: a decent consistent system can't prove its own consistency [Gödel, by George/Velleman]
There is a sentence which a theory can show is true iff it is unprovable [Gödel, by Smith,P]
'This system can't prove this statement' makes it unprovable either way [Gödel, by Clegg]
Realists are happy with impredicative definitions, which describe entities in terms of other existing entities [Gödel, by Shapiro]
Basic logic can be done by syntax, with no semantics [Gödel, by Rey]