Combining Texts
Ideas for
'What is Logic?st1=Ian Hacking', 'Replies on 'Limits of Abstraction'' and 'later work'
expand these ideas
|
start again
|
choose
another area for these texts
display all the ideas for this combination of texts
5 ideas
4. Formal Logic / B. Propositional Logic PL / 2. Tools of Propositional Logic / d. Basic theorems of PL
13833
|
'Thinning' ('dilution') is the key difference between deduction (which allows it) and induction [Hacking]
|
13834
|
Gentzen's Cut Rule (or transitivity of deduction) is 'If A |- B and B |- C, then A |- C' [Hacking]
|
13835
|
Only Cut reduces complexity, so logic is constructive without it, and it can be dispensed with [Hacking]
|
4. Formal Logic / F. Set Theory ST / 5. Conceptions of Set / e. Iterative sets
10565
|
There is no stage at which we can take all the sets to have been generated [Fine,K]
|
4. Formal Logic / G. Formal Mereology / 3. Axioms of Mereology
10564
|
We might combine the axioms of set theory with the axioms of mereology [Fine,K]
|