Combining Texts

All the ideas for '', 'Some Puzzles of Ground' and 'An Axiomatization of Set Theory'

unexpand these ideas     |    start again     |     specify just one area for these texts


8 ideas

4. Formal Logic / E. Nonclassical Logics / 3. Many-Valued Logic
Strong Kleene disjunction just needs one true disjunct; Weak needs the other to have some value [Fine,K]
     Full Idea: Under strong Kleene tables, a disjunction will be true if one of the disjuncts is true, regardless of whether or not the other disjunct has a truth-value; under the weak table it is required that the other disjunct also have a value. So for other cases.
     From: Kit Fine (Some Puzzles of Ground [2010], n7)
     A reaction: [see also p.111 of Fine's article] The Kleene tables seem to be the established form of modern three-valued logic, with the third value being indeterminate.
4. Formal Logic / F. Set Theory ST / 5. Conceptions of Set / f. Limitation of Size
Limitation of Size is not self-evident, and seems too strong [Lavine on Neumann]
     Full Idea: Von Neumann's Limitation of Size axiom is not self-evident, and he himself admitted that it seemed too strong.
     From: comment on John von Neumann (An Axiomatization of Set Theory [1925]) by Shaughan Lavine - Understanding the Infinite VII.1
5. Theory of Logic / A. Overview of Logic / 1. Overview of Logic
If a sound conclusion comes from two errors that cancel out, the path of the argument must matter [Rumfitt]
     Full Idea: If a designated conclusion follows from the premisses, but the argument involves two howlers which cancel each other out, then the moral is that the path an argument takes from premisses to conclusion does matter to its logical evaluation.
     From: Ian Rumfitt ("Yes" and "No" [2000], II)
     A reaction: The drift of this is that our view of logic should be a little closer to the reasoning of ordinary language, and we should rely a little less on purely formal accounts.
5. Theory of Logic / E. Structures of Logic / 2. Logical Connectives / a. Logical connectives
Standardly 'and' and 'but' are held to have the same sense by having the same truth table [Rumfitt]
     Full Idea: If 'and' and 'but' really are alike in sense, in what might that likeness consist? Some philosophers of classical logic will reply that they share a sense by virtue of sharing a truth table.
     From: Ian Rumfitt ("Yes" and "No" [2000])
     A reaction: This is the standard view which Rumfitt sets out to challenge.
The sense of a connective comes from primitively obvious rules of inference [Rumfitt]
     Full Idea: A connective will possess the sense that it has by virtue of its competent users' finding certain rules of inference involving it to be primitively obvious.
     From: Ian Rumfitt ("Yes" and "No" [2000], III)
     A reaction: Rumfitt cites Peacocke as endorsing this view, which characterises the logical connectives by their rules of usage rather than by their pure semantic value.
6. Mathematics / B. Foundations for Mathematics / 6. Mathematics as Set Theory / a. Mathematics is set theory
All the axioms for mathematics presuppose set theory [Neumann]
     Full Idea: There is no axiom system for mathematics, geometry, and so forth that does not presuppose set theory.
     From: John von Neumann (An Axiomatization of Set Theory [1925]), quoted by Stewart Shapiro - Foundations without Foundationalism 8.2
     A reaction: Von Neumann was doubting whether set theory could have axioms, and hence the whole project is doomed, and we face relativism about such things. His ally was Skolem in this.
7. Existence / C. Structure of Existence / 1. Grounding / a. Nature of grounding
Formal grounding needs transitivity of grounding, no self-grounding, and the existence of both parties [Fine,K]
     Full Idea: The general formal principles of grounding are Transitivity (A«B, B«C/A«C: if A helps ground B and B helps C, then A helps C), Irreflexivity (A«A/absurd: A can't ground itself) and Factivity (A«B/A; A«/B: for grounding both A and B must be the case).
     From: Kit Fine (Some Puzzles of Ground [2010], 4)
19. Language / F. Communication / 3. Denial
We learn 'not' along with affirmation, by learning to either affirm or deny a sentence [Rumfitt]
     Full Idea: The standard view is that affirming not-A is more complex than affirming the atomic sentence A itself, with the latter determining its sense. But we could learn 'not' directly, by learning at once how to either affirm A or reject A.
     From: Ian Rumfitt ("Yes" and "No" [2000], IV)
     A reaction: [compressed] This seems fairly anti-Fregean in spirit, because it looks at the psychology of how we learn 'not' as a way of clarifying what we mean by it, rather than just looking at its logical behaviour (and thus giving it a secondary role).