Combining Texts

All the ideas for 'What is Logic?st1=Ian Hacking', 'A Defense of Presentism' and 'Introduction to the Theory of Logic'

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


42 ideas

1. Philosophy / G. Scientific Philosophy / 3. Scientism
People who use science to make philosophical points don't realise how philosophical science is [Markosian]
2. Reason / D. Definition / 3. Types of Definition
A decent modern definition should always imply a semantics [Hacking]
3. Truth / B. Truthmakers / 9. Making Past Truths
Presentism has the problem that if Socrates ceases to exist, so do propositions about him [Markosian]
4. Formal Logic / B. Propositional Logic PL / 2. Tools of Propositional Logic / d. Basic theorems of PL
Gentzen's Cut Rule (or transitivity of deduction) is 'If A |- B and B |- C, then A |- C' [Hacking]
Only Cut reduces complexity, so logic is constructive without it, and it can be dispensed with [Hacking]
'Thinning' ('dilution') is the key difference between deduction (which allows it) and induction [Hacking]
4. Formal Logic / F. Set Theory ST / 1. Set Theory
Sets can be defined by 'enumeration', or by 'abstraction' (based on a property) [Zalabardo]
4. Formal Logic / F. Set Theory ST / 2. Mechanics of Set Theory / b. Terminology of ST
The 'Cartesian Product' of two sets relates them by pairing every element with every element [Zalabardo]
A 'partial ordering' is reflexive, antisymmetric and transitive [Zalabardo]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / a. Axioms for sets
Determinacy: an object is either in a set, or it isn't [Zalabardo]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / l. Axiom of Specification
Specification: Determinate totals of objects always make a set [Zalabardo]
5. Theory of Logic / A. Overview of Logic / 4. Pure Logic
The various logics are abstractions made from terms like 'if...then' in English [Hacking]
5. Theory of Logic / A. Overview of Logic / 5. First-Order Logic
First-order logic is the strongest complete compact theory with Löwenheim-Skolem [Hacking]
A limitation of first-order logic is that it cannot handle branching quantifiers [Hacking]
A first-order 'sentence' is a formula with no free variables [Zalabardo]
5. Theory of Logic / A. Overview of Logic / 7. Second-Order Logic
Second-order completeness seems to need intensional entities and possible worlds [Hacking]
5. Theory of Logic / B. Logical Consequence / 4. Semantic Consequence |=
Γ |= φ for sentences if φ is true when all of Γ is true [Zalabardo]
Γ |= φ if φ is true when all of Γ is true, for all structures and interpretations [Zalabardo]
5. Theory of Logic / E. Structures of Logic / 2. Logical Connectives / a. Logical connectives
With a pure notion of truth and consequence, the meanings of connectives are fixed syntactically [Hacking]
5. Theory of Logic / E. Structures of Logic / 2. Logical Connectives / b. Basic connectives
Propositional logic just needs ¬, and one of ∧, ∨ and → [Zalabardo]
5. Theory of Logic / E. Structures of Logic / 4. Variables in Logic
Perhaps variables could be dispensed with, by arrows joining places in the scope of quantifiers [Hacking]
5. Theory of Logic / I. Semantics of Logic / 1. Semantics of Logic
The semantics shows how truth values depend on instantiations of properties and relations [Zalabardo]
We can do semantics by looking at given propositions, or by building new ones [Zalabardo]
5. Theory of Logic / I. Semantics of Logic / 2. Formal Truth
We make a truth assignment to T and F, which may be true and false, but merely differ from one another [Zalabardo]
5. Theory of Logic / I. Semantics of Logic / 3. Logical Truth
'Logically true' (|= φ) is true for every truth-assignment [Zalabardo]
Logically true sentences are true in all structures [Zalabardo]
5. Theory of Logic / I. Semantics of Logic / 4. Satisfaction
Some formulas are 'satisfiable' if there is a structure and interpretation that makes them true [Zalabardo]
A sentence-set is 'satisfiable' if at least one truth-assignment makes them all true [Zalabardo]
5. Theory of Logic / J. Model Theory in Logic / 1. Logical Models
A structure models a sentence if it is true in the model, and a set of sentences if they are all true in the model [Zalabardo]
5. Theory of Logic / J. Model Theory in Logic / 3. Löwenheim-Skolem Theorems
If it is a logic, the Löwenheim-Skolem theorem holds for it [Hacking]
6. Mathematics / B. Foundations for Mathematics / 4. Axioms for Number / f. Mathematical induction
If a set is defined by induction, then proof by induction can be applied to it [Zalabardo]
10. Modality / E. Possible worlds / 2. Nature of Possible Worlds / a. Nature of possible worlds
Possible worlds must be abstract, because two qualitatively identical worlds are just one world [Markosian]
19. Language / A. Nature of Meaning / 4. Meaning as Truth-Conditions
'Grabby' truth conditions first select their object, unlike 'searchy' truth conditions [Markosian]
27. Natural Reality / D. Time / 1. Nature of Time / h. Presentism
Presentism is the view that only present objects exist [Markosian]
Presentism says if objects don't exist now, we can't have attitudes to them or relations with them [Markosian]
Presentism seems to entail that we cannot talk about other times [Markosian]
Serious Presentism says things must exist to have relations and properties; Unrestricted version denies this [Markosian]
Maybe Presentists can refer to the haecceity of a thing, after the thing itself disappears [Markosian]
Maybe Presentists can paraphrase singular propositions about the past [Markosian]
Special Relativity denies the absolute present which Presentism needs [Markosian]
27. Natural Reality / D. Time / 2. Passage of Time / k. Temporal truths
Objects in the past, like Socrates, are more like imaginary objects than like remote spatial objects [Markosian]
People are mistaken when they think 'Socrates was a philosopher' says something [Markosian]