40 ideas
| 13338 | '"It is snowing" is true if and only if it is snowing' is a partial definition of the concept of truth [Tarski] |
| Full Idea: Statements of the form '"it is snowing" is true if and only if it is snowing' and '"the world war will begin in 1963" is true if and only if the world war will being in 1963' can be regarded as partial definitions of the concept of truth. | |
| From: Alfred Tarski (The Establishment of Scientific Semantics [1936], p.404) | |
| A reaction: The key word here is 'partial'. Truth is defined, presumably, when every such translation from the object language has been articulated, which is presumably impossible, given the infinity of concatenated phrases possible in a sentence. |
| 8472 | Sentential logic is consistent (no contradictions) and complete (entirely provable) [Orenstein] |
| Full Idea: Sentential logic has been proved consistent and complete; its consistency means that no contradictions can be derived, and its completeness assures us that every one of the logical truths can be proved. | |
| From: Alex Orenstein (W.V. Quine [2002], Ch.5) | |
| A reaction: The situation for quantificational logic is not quite so clear (Orenstein p.98). I do not presume that being consistent and complete makes it necessarily better as a tool in the real world. |
| 13520 | A 'tautology' must include connectives [Wolf,RS] |
| Full Idea: 'For every number x, x = x' is not a tautology, because it includes no connectives. | |
| From: Robert S. Wolf (A Tour through Mathematical Logic [2005], 1.2) |
| 13524 | Deduction Theorem: T∪{P}|-Q, then T|-(P→Q), which justifies Conditional Proof [Wolf,RS] |
| Full Idea: Deduction Theorem: If T ∪ {P} |- Q, then T |- (P → Q). This is the formal justification of the method of conditional proof (CPP). Its converse holds, and is essentially modus ponens. | |
| From: Robert S. Wolf (A Tour through Mathematical Logic [2005], 1.3) |
| 8476 | Axiomatization simply picks from among the true sentences a few to play a special role [Orenstein] |
| Full Idea: In axiomatizing, we are merely sorting out among the truths of a science those which will play a special role, namely, serve as axioms from which we derive the others. The sentences are already true in a non-conventional or ordinary sense. | |
| From: Alex Orenstein (W.V. Quine [2002], Ch.5) | |
| A reaction: If you were starting from scratch, as Euclidean geometers may have felt they were doing, you might want to decide which are the simplest truths. Axiomatizing an established system is a more advanced activity. |
| 13522 | Universal Generalization: If we prove P(x) with no special assumptions, we can conclude ∀xP(x) [Wolf,RS] |
| Full Idea: Universal Generalization: If we can prove P(x), only assuming what sort of object x is, we may conclude ∀xP(x) for the same x. | |
| From: Robert S. Wolf (A Tour through Mathematical Logic [2005], 1.3) | |
| A reaction: This principle needs watching closely. If you pick one person in London, with no presuppositions, and it happens to be a woman, can you conclude that all the people in London are women? Fine in logic and mathematics, suspect in life. |
| 13521 | Universal Specification: ∀xP(x) implies P(t). True for all? Then true for an instance [Wolf,RS] |
| Full Idea: Universal Specification: from ∀xP(x) we may conclude P(t), where t is an appropriate term. If something is true for all members of a domain, then it is true for some particular one that we specify. | |
| From: Robert S. Wolf (A Tour through Mathematical Logic [2005], 1.3) |
| 13523 | Existential Generalization (or 'proof by example'): if we can say P(t), then we can say something is P [Wolf,RS] |
| Full Idea: Existential Generalization (or 'proof by example'): From P(t), where t is an appropriate term, we may conclude ∃xP(x). | |
| From: Robert S. Wolf (A Tour through Mathematical Logic [2005], 1.3) | |
| A reaction: It is amazing how often this vacuous-sounding principles finds itself being employed in discussions of ontology, but I don't quite understand why. |
| 8480 | S4: 'poss that poss that p' implies 'poss that p'; S5: 'poss that nec that p' implies 'nec that p' [Orenstein] |
| Full Idea: The five systems of propositional modal logic contain successively stronger conceptions of necessity. In S4 'it is poss that it is poss that p' implies 'it is poss that p'. In S5, 'it is poss that it is nec that p' implies 'it is nec that p'. | |
| From: Alex Orenstein (W.V. Quine [2002], Ch.7) | |
| A reaction: C.I. Lewis originated this stuff. Any serious student of modality is probably going to have to pick a system. E.g. Nathan Salmon says that the correct modal logic is even weaker than S4. |
| 8474 | Unlike elementary logic, set theory is not complete [Orenstein] |
| Full Idea: The incompleteness of set theory contrasts sharply with the completeness of elementary logic. | |
| From: Alex Orenstein (W.V. Quine [2002], Ch.5) | |
| A reaction: This seems to be Quine's reason for abandoning the Frege-Russell logicist programme (quite apart from the problems raised by Gödel. |
| 13529 | Empty Set: ∃x∀y ¬(y∈x). The unique empty set exists [Wolf,RS] |
| Full Idea: Empty Set Axiom: ∃x ∀y ¬ (y ∈ x). There is a set x which has no members (no y's). The empty set exists. There is a set with no members, and by extensionality this set is unique. | |
| From: Robert S. Wolf (A Tour through Mathematical Logic [2005], 2.3) | |
| A reaction: A bit bewildering for novices. It says there is a box with nothing in it, or a pair of curly brackets with nothing between them. It seems to be the key idea in set theory, because it asserts the idea of a set over and above any possible members. |
| 13526 | Comprehension Axiom: if a collection is clearly specified, it is a set [Wolf,RS] |
| Full Idea: The comprehension axiom says that any collection of objects that can be clearly specified can be considered to be a set. | |
| From: Robert S. Wolf (A Tour through Mathematical Logic [2005], 2.2) | |
| A reaction: This is virtually tautological, since I presume that 'clearly specified' means pinning down exact which items are the members, which is what a set is (by extensionality). The naïve version is, of course, not so hot. |
| 8465 | Mereology has been exploited by some nominalists to achieve the effects of set theory [Orenstein] |
| Full Idea: The theory of mereology has had a history of being exploited by nominalists to achieve some of the effects of set theory. | |
| From: Alex Orenstein (W.V. Quine [2002], Ch.3) | |
| A reaction: Some writers refer to mereology as a 'theory', and others as an area of study. This appears to be an interesting line of investigation. Orenstein says Quine and Goodman showed its limitations. |
| 13534 | In first-order logic syntactic and semantic consequence (|- and |=) nicely coincide [Wolf,RS] |
| Full Idea: One of the most appealing features of first-order logic is that the two 'turnstiles' (the syntactic single |-, and the semantic double |=), which are the two reasonable notions of logical consequence, actually coincide. | |
| From: Robert S. Wolf (A Tour through Mathematical Logic [2005], 5.3) | |
| A reaction: In the excitement about the possibility of second-order logic, plural quantification etc., it seems easy to forget the virtues of the basic system that is the target of the rebellion. The issue is how much can be 'expressed' in first-order logic. |
| 13535 | First-order logic is weakly complete (valid sentences are provable); we can't prove every sentence or its negation [Wolf,RS] |
| Full Idea: The 'completeness' of first order-logic does not mean that every sentence or its negation is provable in first-order logic. We have instead the weaker result that every valid sentence is provable. | |
| From: Robert S. Wolf (A Tour through Mathematical Logic [2005], 5.3) | |
| A reaction: Peter Smith calls the stronger version 'negation completeness'. |
| 13337 | A language: primitive terms, then definition rules, then sentences, then axioms, and finally inference rules [Tarski] |
| Full Idea: For a language, we must enumerate the primitive terms, and the rules of definition for new terms. Then we must distinguish the sentences, and separate out the axioms from amng them, and finally add rules of inference. | |
| From: Alfred Tarski (The Establishment of Scientific Semantics [1936], p.402) | |
| A reaction: [compressed] This lays down the standard modern procedure for defining a logical language. Once all of this is in place, we then add a semantics and we are in business. Natural deduction tries to do without the axioms. |
| 8452 | Traditionally, universal sentences had existential import, but were later treated as conditional claims [Orenstein] |
| Full Idea: In traditional logic from Aristotle to Kant, universal sentences have existential import, but Brentano and Boole construed them as universal conditionals (such as 'for anything, if it is a man, then it is mortal'). | |
| From: Alex Orenstein (W.V. Quine [2002], Ch.2) | |
| A reaction: I am sympathetic to the idea that even the 'existential' quantifier should be treated as conditional, or fictional. Modern Christians may well routinely quantify over angels, without actually being committed to them. |
| 8475 | The substitution view of quantification says a sentence is true when there is a substitution instance [Orenstein] |
| Full Idea: The substitution view of quantification explains 'there-is-an-x-such-that x is a man' as true when it has a true substitution instance, as in the case of 'Socrates is a man', so the quantifier can be read as 'it is sometimes true that'. | |
| From: Alex Orenstein (W.V. Quine [2002], Ch.5) | |
| A reaction: The word 'true' crops up twice here. The alternative (existential-referential) view cites objects, so the substitution view is a more linguistic approach. |
| 13335 | Semantics is the concepts of connections of language to reality, such as denotation, definition and truth [Tarski] |
| Full Idea: Semantics is the totality of considerations concerning concepts which express connections between expressions of a language and objects and states of affairs referred to by these expressions. Examples are denotation, satisfaction, definition and truth. | |
| From: Alfred Tarski (The Establishment of Scientific Semantics [1936], p.401) | |
| A reaction: Interestingly, he notes that it 'is not commonly recognised' that truth is part of semantics. Nowadays truth seems to be the central concept in most semantics. |
| 13336 | A language containing its own semantics is inconsistent - but we can use a second language [Tarski] |
| Full Idea: People have not been aware that the language about which we speak need by no means coincide with the language in which we speak. ..But the language which contains its own semantics must inevitably be inconsistent. | |
| From: Alfred Tarski (The Establishment of Scientific Semantics [1936], p.402) | |
| A reaction: It seems that Tarski was driven to propose the metalanguage approach mainly by the Liar Paradox. |
| 13339 | A sentence is satisfied when we can assert the sentence when the variables are assigned [Tarski] |
| Full Idea: Here is a partial definition of the concept of satisfaction: John and Peter satisfy the sentential function 'X and Y are brothers' if and only if John and Peter are brothers. | |
| From: Alfred Tarski (The Establishment of Scientific Semantics [1936], p.405) | |
| A reaction: Satisfaction applies to open sentences and truth to closed sentences (with named objects). He uses the notion of total satisfaction to define truth. The example is a partial definition, not just an illustration. |
| 13340 | Satisfaction is the easiest semantical concept to define, and the others will reduce to it [Tarski] |
| Full Idea: It has been found useful in defining semantical concepts to deal first with the concept of satisfaction; both because the definition of this concept presents relatively few difficulties, and because the other semantical concepts are easily reduced to it. | |
| From: Alfred Tarski (The Establishment of Scientific Semantics [1936], p.406) | |
| A reaction: See Idea 13339 for his explanation of satisfaction. We just say that a open sentence is 'acceptable' or 'assertible' (or even 'true') when particular values are assigned to the variables. Then sentence is then 'satisfied'. |
| 13519 | Model theory uses sets to show that mathematical deduction fits mathematical truth [Wolf,RS] |
| Full Idea: Model theory uses set theory to show that the theorem-proving power of the usual methods of deduction in mathematics corresponds perfectly to what must be true in actual mathematical structures. | |
| From: Robert S. Wolf (A Tour through Mathematical Logic [2005], Pref) | |
| A reaction: That more or less says that model theory demonstrates the 'soundness' of mathematics (though normal arithmetic is famously not 'complete'). Of course, he says they 'correspond' to the truths, rather than entailing them. |
| 13533 | First-order model theory rests on completeness, compactness, and the Löwenheim-Skolem-Tarski theorem [Wolf,RS] |
| Full Idea: The three foundations of first-order model theory are the Completeness theorem, the Compactness theorem, and the Löwenheim-Skolem-Tarski theorem. | |
| From: Robert S. Wolf (A Tour through Mathematical Logic [2005], 5.3) | |
| A reaction: On p.180 he notes that Compactness and LST make no mention of |- and are purely semantic, where Completeness shows the equivalence of |- and |=. All three fail for second-order logic (p.223). |
| 13532 | Model theory 'structures' have a 'universe', some 'relations', some 'functions', and some 'constants' [Wolf,RS] |
| Full Idea: A 'structure' in model theory has a non-empty set, the 'universe', as domain of variables, a subset for each 'relation', some 'functions', and 'constants'. | |
| From: Robert S. Wolf (A Tour through Mathematical Logic [2005], 5.2) |
| 13531 | Model theory reveals the structures of mathematics [Wolf,RS] |
| Full Idea: Model theory helps one to understand what it takes to specify a mathematical structure uniquely. | |
| From: Robert S. Wolf (A Tour through Mathematical Logic [2005], 5.1) | |
| A reaction: Thus it is the development of model theory which has led to the 'structuralist' view of mathematics. |
| 13537 | An 'isomorphism' is a bijection that preserves all structural components [Wolf,RS] |
| Full Idea: An 'isomorphism' is a bijection between two sets that preserves all structural components. The interpretations of each constant symbol are mapped across, and functions map the relation and function symbols. | |
| From: Robert S. Wolf (A Tour through Mathematical Logic [2005], 5.4) |
| 13539 | The LST Theorem is a serious limitation of first-order logic [Wolf,RS] |
| Full Idea: The Löwenheim-Skolem-Tarski theorem demonstrates a serious limitation of first-order logic, and is one of primary reasons for considering stronger logics. | |
| From: Robert S. Wolf (A Tour through Mathematical Logic [2005], 5.7) |
| 13341 | Using the definition of truth, we can prove theories consistent within sound logics [Tarski] |
| Full Idea: Using the definition of truth we are in a position to carry out the proof of consistency for deductive theories in which only (materially) true sentences are (formally) provable. | |
| From: Alfred Tarski (The Establishment of Scientific Semantics [1936], p.407) | |
| A reaction: This is evidently what Tarski saw as the most important first fruit of his new semantic theory of truth. |
| 13538 | If a theory is complete, only a more powerful language can strengthen it [Wolf,RS] |
| Full Idea: It is valuable to know that a theory is complete, because then we know it cannot be strengthened without passing to a more powerful language. | |
| From: Robert S. Wolf (A Tour through Mathematical Logic [2005], 5.5) |
| 13525 | Most deductive logic (unlike ordinary reasoning) is 'monotonic' - we don't retract after new givens [Wolf,RS] |
| Full Idea: Deductive logic, including first-order logic and other types of logic used in mathematics, is 'monotonic'. This means that we never retract a theorem on the basis of new givens. If T|-φ and T⊆SW, then S|-φ. Ordinary reasoning is nonmonotonic. | |
| From: Robert S. Wolf (A Tour through Mathematical Logic [2005], 1.7) | |
| A reaction: The classic example of nonmonotonic reasoning is the induction that 'all birds can fly', which is retracted when the bird turns out to be a penguin. He says nonmonotonic logic is a rich field in computer science. |
| 8454 | The whole numbers are 'natural'; 'rational' numbers include fractions; the 'reals' include root-2 etc. [Orenstein] |
| Full Idea: The 'natural' numbers are the whole numbers 1, 2, 3 and so on. The 'rational' numbers consist of the natural numbers plus the fractions. The 'real' numbers include the others, plus numbers such a pi and root-2, which cannot be expressed as fractions. | |
| From: Alex Orenstein (W.V. Quine [2002], Ch.2) | |
| A reaction: The 'irrational' numbers involved entities such as root-minus-1. Philosophical discussions in ontology tend to focus on the existence of the real numbers. |
| 13530 | An ordinal is an equivalence class of well-orderings, or a transitive set whose members are transitive [Wolf,RS] |
| Full Idea: Less theoretically, an ordinal is an equivalence class of well-orderings. Formally, we say a set is 'transitive' if every member of it is a subset of it, and an ordinal is a transitive set, all of whose members are transitive. | |
| From: Robert S. Wolf (A Tour through Mathematical Logic [2005], 2.4) | |
| A reaction: He glosses 'transitive' as 'every member of a member of it is a member of it'. So it's membership all the way down. This is the von Neumann rather than the Zermelo approach (which is based on singletons). |
| 13518 | Modern mathematics has unified all of its objects within set theory [Wolf,RS] |
| Full Idea: One of the great achievements of modern mathematics has been the unification of its many types of objects. It began with showing geometric objects numerically or algebraically, and culminated with set theory representing all the normal objects. | |
| From: Robert S. Wolf (A Tour through Mathematical Logic [2005], Pref) | |
| A reaction: His use of the word 'object' begs all sorts of questions, if you are arriving from the street, where an object is something which can cause a bruise - but get used to it, because the word 'object' has been borrowed for new uses. |
| 8473 | The logicists held that is-a-member-of is a logical constant, making set theory part of logic [Orenstein] |
| Full Idea: The question to be posed is whether is-a-member-of should be considered a logical constant, that is, does logic include set theory. Frege, Russell and Whitehead held that it did. | |
| From: Alex Orenstein (W.V. Quine [2002], Ch.5) | |
| A reaction: This is obviously the key element in the logicist programme. The objection seems to be that while first-order logic is consistent and complete, set theory is not at all like that, and so is part of a different world. |
| 8458 | Just individuals in Nominalism; add sets for Extensionalism; add properties, concepts etc for Intensionalism [Orenstein] |
| Full Idea: Modest ontologies are Nominalism (Goodman), admitting only concrete individuals; and Extensionalism (Quine/Davidson) which admits individuals and sets; but Intensionalists (Frege/Carnap/Church/Marcus/Kripke) may have propositions, properties, concepts. | |
| From: Alex Orenstein (W.V. Quine [2002], Ch.3) | |
| A reaction: I don't like sets, because of Idea 7035. Even the ontology of individuals could collapse dramatically (see the ideas of Merricks, e.g. 6124). The intensional items may be real enough, but needn't have a place at the ontological high table. |
| 8457 | The Principle of Conservatism says we should violate the minimum number of background beliefs [Orenstein] |
| Full Idea: The principle of conservatism in choosing between theories is a maxim of minimal mutilation, stating that of competing theories, all other things being equal, choose the one that violates the fewest background beliefs held. | |
| From: Alex Orenstein (W.V. Quine [2002], Ch.2) | |
| A reaction: In this sense, all rational people should be conservatives. The idea is a modern variant of Hume's objection to miracles (Idea 2227). A Kuhnian 'paradigm shift' is the dramatic moment when this principle no longer seems appropriate. |
| 8477 | People presume meanings exist because they confuse meaning and reference [Orenstein] |
| Full Idea: A good part of the confidence people have that there are meanings rests on the confusion of meaning and reference. | |
| From: Alex Orenstein (W.V. Quine [2002], Ch.6) | |
| A reaction: An important point. Everyone assumes that sentences link to the world, but Frege shows that that is not part of meaning. Words like prepositions and conjunctions ('to', 'and') don't have 'a meaning' apart from their function and use. |
| 8471 | Three ways for 'Socrates is human' to be true are nominalist, platonist, or Montague's way [Orenstein] |
| Full Idea: 'Socrates is human' is true if 1) subject referent is identical with a predicate referent (Nominalism), 2) subject reference member of the predicate set, or the subject has that property (Platonism), 3) predicate set a member of the subject set (Montague) | |
| From: Alex Orenstein (W.V. Quine [2002], Ch.3) | |
| A reaction: Orenstein offers these as alternatives to Quine's 'inscrutability of reference' thesis, which makes the sense unanalysable. |
| 8484 | If two people believe the same proposition, this implies the existence of propositions [Orenstein] |
| Full Idea: If we can say 'there exists a p such that John believes p and Barbara believes p', logical forms such as this are cited as evidence for our ontological commitment to propositions. | |
| From: Alex Orenstein (W.V. Quine [2002], Ch.7) | |
| A reaction: Opponents of propositions (such as Quine) will, of course, attempt to revise the logical form to eliminate the quantification over propositions. See Orenstein's outline on p.171. |