| 9995 | Proof in finite subsets is sufficient for proof in an infinite set [Enderton] |
| Full Idea: If a wff is tautologically implied by a set of wff's, it is implied by a finite subset of them; and if every finite subset is satisfiable, then so is the whole set of wff's. | |
| From: Herbert B. Enderton (A Mathematical Introduction to Logic (2nd) [2001], 2.5) | |
| A reaction: [Enderton's account is more symbolic] He adds that this also applies to models. It is a 'theorem' because it can be proved. It is a major theorem in logic, because it brings the infinite under control, and who doesn't want that? |
| 10771 | Compactness is important for major theories which have infinitely many axioms [Tharp] |
| Full Idea: It is strange that compactness is often ignored in discussions of philosophy of logic, since the most important theories have infinitely many axioms. | |
| From: Leslie H. Tharp (Which Logic is the Right Logic? [1975], §2) | |
| A reaction: An example of infinite axioms is the induction schema in first-order Peano Arithmetic. |
| 10772 | Compactness blocks infinite expansion, and admits non-standard models [Tharp] |
| Full Idea: The compactness condition seems to state some weakness of the logic (as if it were futile to add infinitely many hypotheses). To look at it another way, formalizations of (say) arithmetic will admit of non-standard models. | |
| From: Leslie H. Tharp (Which Logic is the Right Logic? [1975], §2) |
| 13544 | Inconsistency or entailment just from functors and quantifiers is finitely based, if compact [Bostock] |
| Full Idea: Being 'compact' means that if we have an inconsistency or an entailment which holds just because of the truth-functors and quantifiers involved, then it is always due to a finite number of the propositions in question. | |
| From: David Bostock (Intermediate Logic [1997], 4.8) | |
| A reaction: Bostock says this is surprising, given the examples 'a is not a parent of a parent of b...' etc, where an infinity seems to establish 'a is not an ancestor of b'. The point, though, is that this truth doesn't just depend on truth-functors and quantifiers. |
| 13618 | Compactness means an infinity of sequents on the left will add nothing new [Bostock] |
| Full Idea: The logic of truth-functions is compact, which means that sequents with infinitely many formulae on the left introduce nothing new. Hence we can confine our attention to finite sequents. | |
| From: David Bostock (Intermediate Logic [1997], 5.5) | |
| A reaction: This makes it clear why compactness is a limitation in logic. If you want the logic to be unlimited in scope, it isn't; it only proves things from finite numbers of sequents. This makes it easier to prove completeness for the system. |
| 13841 | Why should compactness be definitive of logic? [Boolos, by Hacking] |
| Full Idea: Boolos asks why on earth compactness, whatever its virtues, should be definitive of logic itself. | |
| From: report of George Boolos (On Second-Order Logic [1975]) by Ian Hacking - What is Logic? §13 |
| 10287 | If a first-order theory entails a sentence, there is a finite subset of the theory which entails it [Hodges,W] |
| Full Idea: Compactness Theorem: suppose T is a first-order theory, ψ is a first-order sentence, and T entails ψ. Then there is a finite subset U of T such that U entails ψ. | |
| From: Wilfrid Hodges (First-Order Logic [2001], 1.10) | |
| A reaction: If entailment is possible, it can be done finitely. |
| 13496 | First-order logic is 'compact': consequences of a set are consequences of a finite subset [Hart,WD] |
| Full Idea: First-order logic is 'compact', which means that any logical consequence of a set (finite or infinite) of first-order sentences is a logical consequence of a finite subset of those sentences. | |
| From: William D. Hart (The Evolution of Logic [2010], 3) |
| 17789 | No logic which can axiomatise arithmetic can be compact or complete [Mayberry] |
| Full Idea: No logic which can axiomatise arithmetic can be compact or complete. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.412-1) | |
| A reaction: I take this to be because there are new truths in the transfinite level (as well as the problem of incompleteness). |
| 13630 | Non-compactness is a strength of second-order logic, enabling characterisation of infinite structures [Shapiro] |
| Full Idea: It is sometimes said that non-compactness is a defect of second-order logic, but it is a consequence of a crucial strength - its ability to give categorical characterisations of infinite structures. | |
| From: Stewart Shapiro (Foundations without Foundationalism [1991], Pref) | |
| A reaction: The dispute between fans of first- and second-order may hinge on their attitude to the infinite. I note that Skolem, who was not keen on the infinite, stuck to first-order. Should we launch a new Skolemite Crusade? |
| 13646 | Compactness is derived from soundness and completeness [Shapiro] |
| Full Idea: Compactness is a corollary of soundness and completeness. If Γ is not satisfiable, then, by completeness, Γ is not consistent. But the deductions contain only finite premises. So a finite subset shows the inconsistency. | |
| From: Stewart Shapiro (Foundations without Foundationalism [1991], 4.1) | |
| A reaction: [this is abbreviated, but a proof of compactness] Since all worthwhile logics are sound, this effectively means that completeness entails compactness. |
| 13699 | Compactness surprisingly says that no contradictions can emerge when the set goes infinite [Sider] |
| Full Idea: Compactness is intuitively surprising, ..because one might have thought there could be some contradiction latent within some infinite set, preventing it from being satisfiable, only discovered when you consider the whole set. But this can't happen. | |
| From: Theodore Sider (Logic for Philosophy [2010], 4.5) |
| 10974 | Compactness is when any consequence of infinite propositions is the consequence of a finite subset [Read] |
| Full Idea: Classical logical consequence is compact, which means that any consequence of an infinite set of propositions (such as a theory) is a consequence of some finite subset of them. | |
| From: Stephen Read (Thinking About Logic [1995], Ch.2) |
| 10977 | Compactness blocks the proof of 'for every n, A(n)' (as the proof would be infinite) [Read] |
| Full Idea: Compact consequence undergenerates - there are intuitively valid consequences which it marks as invalid, such as the ω-rule, that if A holds of the natural numbers, then 'for every n, A(n)', but the proof of that would be infinite, for each number. | |
| From: Stephen Read (Thinking About Logic [1995], Ch.2) |
| 10976 | Compactness makes consequence manageable, but restricts expressive power [Read] |
| Full Idea: Compactness is a virtue - it makes the consequence relation more manageable; but it is also a limitation - it limits the expressive power of the logic. | |
| From: Stephen Read (Thinking About Logic [1995], Ch.2) | |
| A reaction: The major limitation is that wholly infinite proofs are not permitted, as in Idea 10977. |
| 10975 | Compactness does not deny that an inference can have infinitely many premisses [Read] |
| Full Idea: Compactness does not deny that an inference can have infinitely many premisses. It can; but classically, it is valid if and only if the conclusion follows from a finite subset of them. | |
| From: Stephen Read (Thinking About Logic [1995], Ch.2) |
| 17867 | If a concept is not compact, it will not be presentable to finite minds [Almog] |
| Full Idea: If the notion of 'logically following' in your language is not compact, it will not be locally presentable to finite minds. | |
| From: Joseph Almog (Nature Without Essence [2010], 02) |