23 ideas
6851 | We overvalue whether arguments are valid, and undervalue whether they are interesting [Monk] |
Full Idea: We encourage students to be concerned with whether an argument is valid or not, and we don't encourage them much to consider the question of whether the argument is interesting or not. | |
From: Ray Monk (Interview with Baggini and Stangroom [2001], p.16) | |
A reaction: What do you make of arguments which are very interesting, but (unfortunately) totally invalid? That said, this is a nice comment. A philosopher cannot contemplate too long or too deeply on the question of what is really 'interesting'. |
10476 | The idea that groups of concepts could be 'implicitly defined' was abandoned [Hodges,W] |
Full Idea: Late nineteenth century mathematicians said that, although plus, minus and 0 could not be precisely defined, they could be partially 'implicitly defined' as a group. This nonsense was rejected by Frege and others, as expressed in Russell 1903. | |
From: Wilfrid Hodges (Model Theory [2005], 2) | |
A reaction: [compressed] This is helpful in understanding what is going on in Frege's 'Grundlagen'. I won't challenge Hodges's claim that such definitions are nonsense, but there is a case for understanding groups of concepts together. |
10282 | 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. |
10478 | Since first-order languages are complete, |= and |- have the same meaning [Hodges,W] |
Full Idea: In first-order languages the completeness theorem tells us that T |= φ holds if and only if there is a proof of φ from T (T |- φ). Since the two symbols express the same relationship, theorist often just use |- (but only for first-order!). | |
From: Wilfrid Hodges (Model Theory [2005], 3) | |
A reaction: [actually no spaces in the symbols] If you are going to study this kind of theory of logic, the first thing you need to do is sort out these symbols, which isn't easy! |
10477 | |= in model-theory means 'logical consequence' - it holds in all models [Hodges,W] |
Full Idea: If every structure which is a model of a set of sentences T is also a model of one of its sentences φ, then this is known as the model-theoretic consequence relation, and is written T |= φ. Not to be confused with |= meaning 'satisfies'. | |
From: Wilfrid Hodges (Model Theory [2005], 3) | |
A reaction: See also Idea 10474, which gives the other meaning of |=, as 'satisfies'. The symbol is ALSO used in propositional logical, to mean 'tautologically implies'! Sort your act out, logicians. |
10283 | 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) |
10284 | 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. |
10285 | 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). |
10474 | |= should be read as 'is a model for' or 'satisfies' [Hodges,W] |
Full Idea: The symbol in 'I |= S' reads that if the interpretation I (about word meaning) happens to make the sentence S state something true, then I 'is a model for' S, or I 'satisfies' S. | |
From: Wilfrid Hodges (Model Theory [2005], 1) | |
A reaction: Unfortunately this is not the only reading of the symbol |= [no space between | and =!], so care and familiarity are needed, but this is how to read it when dealing with models. See also Idea 10477. |
10473 | Model theory studies formal or natural language-interpretation using set-theory [Hodges,W] |
Full Idea: Model theory is the study of the interpretation of any language, formal or natural, by means of set-theoretic structures, with Tarski's truth definition as a paradigm. | |
From: Wilfrid Hodges (Model Theory [2005], Intro) | |
A reaction: My attention is caught by the fact that natural languages are included. Might we say that science is model theory for English? That sounds like Quine's persistent message. |
10475 | A 'structure' is an interpretation specifying objects and classes of quantification [Hodges,W] |
Full Idea: A 'structure' in model theory is an interpretation which explains what objects some expressions refer to, and what classes some quantifiers range over. | |
From: Wilfrid Hodges (Model Theory [2005], 1) | |
A reaction: He cites as examples 'first-order structures' used in mathematical model theory, and 'Kripke structures' used in model theory for modal logic. A structure is also called a 'universe'. |
10481 | Models in model theory are structures, not sets of descriptions [Hodges,W] |
Full Idea: The models in model-theory are structures, but there is also a common use of 'model' to mean a formal theory which describes and explains a phenomenon, or plans to build it. | |
From: Wilfrid Hodges (Model Theory [2005], 5) | |
A reaction: Hodges is not at all clear here, but the idea seems to be that model-theory offers a set of objects and rules, where the common usage offers a set of descriptions. Model-theory needs homomorphisms to connect models to things, |
10288 | 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) |
10289 | 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) |
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. |
10480 | First-order logic can't discriminate between one infinite cardinal and another [Hodges,W] |
Full Idea: First-order logic is hopeless for discriminating between one infinite cardinal and another. | |
From: Wilfrid Hodges (Model Theory [2005], 4) | |
A reaction: This seems rather significant, since mathematics largely relies on first-order logic for its metatheory. Personally I'm tempted to Ockham's Razor out all these super-infinities, but mathematicians seem to make use of them. |
10286 | 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) |
16062 | A necessary relation between fact-levels seems to be a further irreducible fact [Lynch/Glasgow] |
Full Idea: It seems unavoidable that the facts about logically necessary relations between levels of facts are themselves logically distinct further facts, irreducible to the microphysical facts. | |
From: Lynch,MP/Glasgow,JM (The Impossibility of Superdupervenience [2003], C) | |
A reaction: I'm beginning to think that rejecting every theory of reality that is proposed by carefully exposing some infinite regress hidden in it is a rather lazy way to do philosophy. Almost as bad as rejecting anything if it can't be defined. |
16061 | If some facts 'logically supervene' on some others, they just redescribe them, adding nothing [Lynch/Glasgow] |
Full Idea: Logical supervenience, restricted to individuals, seems to imply strong reduction. It is said that where the B-facts logically supervene on the A-facts, the B-facts simply re-describe what the A-facts describe, and the B-facts come along 'for free'. | |
From: Lynch,MP/Glasgow,JM (The Impossibility of Superdupervenience [2003], C) | |
A reaction: This seems to be taking 'logically' to mean 'analytically'. Presumably an entailment is logically supervenient on its premisses, and may therefore be very revealing, even if some people think such things are analytic. |
16060 | Nonreductive materialism says upper 'levels' depend on lower, but don't 'reduce' [Lynch/Glasgow] |
Full Idea: The root intuition behind nonreductive materialism is that reality is composed of ontologically distinct layers or levels. …The upper levels depend on the physical without reducing to it. | |
From: Lynch,MP/Glasgow,JM (The Impossibility of Superdupervenience [2003], B) | |
A reaction: A nice clear statement of a view which I take to be false. This relationship is the sort of thing that drives people fishing for an account of it to use the word 'supervenience', which just says two things seem to hang out together. Fluffy materialism. |
16064 | The hallmark of physicalism is that each causal power has a base causal power under it [Lynch/Glasgow] |
Full Idea: Jessica Wilson (1999) says what makes physicalist accounts different from emergentism etc. is that each individual causal power associated with a supervenient property is numerically identical with a causal power associated with its base property. | |
From: Lynch,MP/Glasgow,JM (The Impossibility of Superdupervenience [2003], n 11) | |
A reaction: Hence the key thought in so-called (serious, rather than self-evident) 'emergentism' is so-called 'downward causation', which I take to be an idle daydream. |
7535 | If all beliefs are propositional, then belief and judgement are the same thing [Monk] |
Full Idea: Whether the words 'belief' and 'judgement' mean the same thing is a moot point. Traditionally, a judgement is the assent of mind to a proposition. If one thinks that all beliefs are propositional, then beliefs and judgements are the same thing. | |
From: Ray Monk (Bertrand Russell: Spirit of Solitude [1996], Ch.19 n6) | |
A reaction: If I think I have put a bit too much toothpaste on my brush, that strikes me as a non-propositional judgement, even though it could be spelled out as a proposition. But it also strikes me as a belief. |
6850 | Wittgenstein pared his life down in his search for decency [Monk] |
Full Idea: One of the most conspicuous things about Wittgenstein is that, on the ethics side, he pared his life down to the minimum, so as to make as central as possible his search for decency, the drive to be a decent person. | |
From: Ray Monk (Interview with Baggini and Stangroom [2001], p.14) | |
A reaction: It rather looks as if decency was quite an effort for him, as he had a rather waspish temperament, and people found it hard to get close to him. On the whole, though, he sounds like good company, as do nearly all the great philosophers. |