| 10071 | Second Incompleteness: nice theories can't prove their own consistency [Gödel, by Smith,P] |
| Full Idea: Second Incompleteness Theorem: roughly, nice theories that include enough basic arithmetic can't prove their own consistency. | |
| From: report of Kurt Gödel (On Formally Undecidable Propositions [1931]) by Peter Smith - Intro to Gödel's Theorems 1.5 | |
| A reaction: On the face of it, this sounds less surprising than the First Theorem. Philosophers have often noticed that it seems unlikely that you could use reason to prove reason, as when Descartes just relies on 'clear and distinct ideas'. |
| 13341 | Using the definition of truth, we can prove theories consistent within sound logics [Tarski] |
| Full Idea: Using the definition of truth we are in a position to carry out the proof of consistency for deductive theories in which only (materially) true sentences are (formally) provable. | |
| From: Alfred Tarski (The Establishment of Scientific Semantics [1936], p.407) | |
| A reaction: This is evidently what Tarski saw as the most important first fruit of his new semantic theory of truth. |
| 13540 | A set of formulae is 'inconsistent' when there is no interpretation which can make them all true [Bostock] |
| Full Idea: 'Γ |=' means 'Γ is a set of closed formulae, and there is no (standard) interpretation in which all of the formulae in Γ are true'. We abbreviate this last to 'Γ is inconsistent'. | |
| From: David Bostock (Intermediate Logic [1997], 4.5) | |
| A reaction: This is a semantic approach to inconsistency, in terms of truth, as opposed to saying that we cannot prove both p and ¬p. I take this to be closer to the true concept, since you need never have heard of 'proof' to understand 'inconsistent'. |
| 13542 | A proof-system is 'absolutely consistent' iff we don't have |-(S)φ for every formula [Bostock] |
| Full Idea: Any system of proof S is said to be 'absolutely consistent' iff it is not the case that for every formula we have |-(S)φ. | |
| From: David Bostock (Intermediate Logic [1997], 4.5) | |
| A reaction: Bostock notes that a sound system will be both 'negation-consistent' (Idea 13541) and absolutely consistent. 'Tonk' systems can be shown to be unsound because the two come apart. |
| 13541 | For 'negation-consistent', there is never |-(S)φ and |-(S)¬φ [Bostock] |
| Full Idea: Any system of proof S is said to be 'negation-consistent' iff there is no formula such that |-(S)φ and |-(S)¬φ. | |
| From: David Bostock (Intermediate Logic [1997], 4.5) | |
| A reaction: Compare Idea 13542. This version seems to be a 'strong' version, as it demands a higher standard than 'absolute consistency'. Both halves of the condition would have to be established. |
| 12656 | P-and-Q gets its truth from the truth of P and truth of Q, but consistency isn't like that [Fodor] |
| Full Idea: The truth of P-and-Q is (roughly) a function of the truth of P and the truth of Q; but the consistency of P&Q isn't a function of the consistency of P and the consistency of Q. | |
| From: Jerry A. Fodor (LOT 2 [2008], Ch.4.5 n33) | |
| A reaction: This is a nice deep issue. Fodor is interested in artificial intelligence at this point, but I am interested in the notion of coherence, as found in good justifications. Even consistency isn't elementary logic, never mind coherence. |
| 9552 | Sentences are consistent if they can all be true; for Frege it is that no contradiction can be deduced [Chihara] |
| Full Idea: In first-order logic a set of sentences is 'consistent' iff there is an interpretation (or structure) in which the set of sentences is true. ..For Frege, though, a set of sentences is consistent if it is not possible to deduce a contradiction from it. | |
| From: Charles Chihara (A Structural Account of Mathematics [2004], 02.1) | |
| A reaction: The first approach seems positive, the second negative. Frege seems to have a higher standard, which is appealing, but the first one seems intuitively right. There is a possible world where this could work. |
| 18785 | Consistency is semantic, but non-contradiction is syntactic [Mares] |
| Full Idea: The difference between the principle of consistency and the principle of non-contradiction is that the former must be stated in a semantic metalanguage, whereas the latter is a thesis of logical systems. | |
| From: Edwin D. Mares (Negation [2014], 2.2) |
| 10119 | Consistency is a purely syntactic property, unlike the semantic property of soundness [George/Velleman] |
| Full Idea: Consistency is a purely syntactic property, unlike the semantic property of soundness. | |
| From: A.George / D.J.Velleman (Philosophies of Mathematics [2002], Ch.6) |
| 10126 | A 'consistent' theory cannot contain both a sentence and its negation [George/Velleman] |
| Full Idea: If there is a sentence such that both the sentence and its negation are theorems of a theory, then the theory is 'inconsistent'. Otherwise it is 'consistent'. | |
| From: A.George / D.J.Velleman (Philosophies of Mathematics [2002], Ch.7) |