Combining Texts

All the ideas for 'Dthat', 'Spinoza's Ethics' and 'First-Order Logic'

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


11 ideas

1. Philosophy / B. History of Ideas / 5. Later European Thought
Only in the 1780s did it become acceptable to read Spinoza [Lord]
     Full Idea: It was not until the 1780s that it became acceptable to read the works of Spinoza, and even then it was not without a frisson of danger.
     From: Beth Lord (Spinoza's Ethics [2010], Intro 'Who?')
     A reaction: Hence we hear of Wordsworth and Coleridge reading him with excitement. So did Kant read him?
5. Theory of Logic / A. Overview of Logic / 1. Overview of Logic
Logic is the study of sound argument, or of certain artificial languages (or applying the latter to the former) [Hodges,W]
     Full Idea: A logic is a collection of closely related artificial languages, and its older meaning is the study of the rules of sound argument. The languages can be used as a framework for studying rules of argument.
     From: Wilfrid Hodges (First-Order Logic [2001], 1.1)
     A reaction: [Hodges then says he will stick to the languages] The suspicion is that one might confine the subject to the artificial languages simply because it is easier, and avoids the tricky philosophical questions. That approximates to computer programming.
5. Theory of Logic / I. Semantics of Logic / 1. Semantics of Logic
A formula needs an 'interpretation' of its constants, and a 'valuation' of its variables [Hodges,W]
     Full Idea: To have a truth-value, a first-order formula needs an 'interpretation' (I) of its constants, and a 'valuation' (ν) of its variables. Something in the world is attached to the constants; objects are attached to variables.
     From: Wilfrid Hodges (First-Order Logic [2001], 1.3)
There are three different standard presentations of semantics [Hodges,W]
     Full Idea: Semantic rules can be presented in 'Tarski style', where the interpretation-plus-valuation is reduced to the same question for simpler formulas, or the 'Henkin-Hintikka style' in terms of games, or the 'Barwise-Etchemendy style' for computers.
     From: Wilfrid Hodges (First-Order Logic [2001], 1.3)
     A reaction: I haven't yet got the hang of the latter two, but I note them to map the territory.
I |= φ means that the formula φ is true in the interpretation I [Hodges,W]
     Full Idea: I |= φ means that the formula φ is true in the interpretation I.
     From: Wilfrid Hodges (First-Order Logic [2001], 1.5)
     A reaction: [There should be no space between the vertical and the two horizontals!] This contrasts with |-, which means 'is proved in'. That is a syntactic or proof-theoretic symbol, whereas |= is a semantic symbol (involving truth).
5. Theory of Logic / J. Model Theory in Logic / 3. Löwenheim-Skolem Theorems
Down Löwenheim-Skolem: if a countable language has a consistent theory, that has a countable model [Hodges,W]
     Full Idea: Downward Löwenheim-Skolem (the weakest form): If L is a first-order language with at most countably many formulas, and T is a consistent theory in L. Then T has a model with at most countably many elements.
     From: Wilfrid Hodges (First-Order Logic [2001], 1.10)
Up Löwenheim-Skolem: if infinite models, then arbitrarily large models [Hodges,W]
     Full Idea: Upward Löwenheim-Skolem: every first-order theory with infinite models has arbitrarily large models.
     From: Wilfrid Hodges (First-Order Logic [2001], 1.10)
5. Theory of Logic / K. Features of Logics / 6. Compactness
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.
6. Mathematics / B. Foundations for Mathematics / 6. Mathematics as Set Theory / a. Mathematics is set theory
A 'set' is a mathematically well-behaved class [Hodges,W]
     Full Idea: A 'set' is a mathematically well-behaved class.
     From: Wilfrid Hodges (First-Order Logic [2001], 1.6)
15. Nature of Minds / C. Capacities of Minds / 10. Conatus/Striving
Hobbes and Spinoza use 'conatus' to denote all endeavour for advantage in nature [Lord]
     Full Idea: 'Conatus' [translated as 'striving' by Curley] is used by early modern philosophers, including Thomas Hobbes (a major influence of Spinoza), to express the notion of a thing's endeavour for what is advantageous to it. It drives all things in nature.
     From: Beth Lord (Spinoza's Ethics [2010], p.88)
     A reaction: I think it is important to connect conatus to Nietzsche's talk of a plurality of 'drives', which are an expression of the universal will to power (which is seen even in the interactions of chemistry). Conatus is also in Leibniz.
19. Language / B. Reference / 3. Direct Reference / b. Causal reference
Are causal descriptions part of the causal theory of reference, or are they just metasemantic? [Kaplan, by Schaffer,J]
     Full Idea: Kaplan notes that the causal theory of reference can be understood in two quite different ways, as part of the semantics (involving descriptions of causal processes), or as metasemantics, explaining why a term has the referent it does.
     From: report of David Kaplan (Dthat [1970]) by Jonathan Schaffer - Deflationary Metaontology of Thomasson 1
     A reaction: [Kaplan 'Afterthought' 1989] The theory tends to be labelled as 'direct' rather than as 'causal' these days, but causal chains are still at the heart of the story (even if more diffused socially). Nice question. Kaplan takes the meta- version as orthodox.