36 ideas
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) |
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. |
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. |
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'. |
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. |
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) |
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). |
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) |
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. |
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). |
17518 | Counting 'coin in this box' may have coin as the unit, with 'in this box' merely as the scope [Ayers] |
Full Idea: If we count the concept 'coin in this box', we could regard coin as the 'unit', while taking 'in this box' to limit the scope. Counting coins in two boxes would be not a difference in unit (kind of object), but in scope. | |
From: M.R. Ayers (Individuals without Sortals [1974], 'Counting') | |
A reaction: This is a very nice alternative to the Fregean view of counting, depending totally on the concept, and rests more on a natural concept of object. I prefer Ayers. Compare 'count coins till I tell you to stop'. |
17516 | If counting needs a sortal, what of things which fall under two sortals? [Ayers] |
Full Idea: If we accepted that counting objects always presupposes some sortal, it is surely clear that the class of objects to be counted could be designated by two sortals rather than one. | |
From: M.R. Ayers (Individuals without Sortals [1974], 'Realist' vii) | |
A reaction: His nice example is an object which is both 'a single piece of wool' and a 'sweater', which had better not be counted twice. Wiggins struggles to argue that there is always one 'substance sortal' which predominates. |
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. |
17520 | Events do not have natural boundaries, and we have to set them [Ayers] |
Full Idea: In order to know which event has been ostensively identified by a speaker, the auditor must know the limits intended by the speaker. ...Events do not have natural boundaries. | |
From: M.R. Ayers (Individuals without Sortals [1974], 'Concl') | |
A reaction: He distinguishes events thus from natural objects, where the world, to a large extent, offers us the boundaries. Nice point. |
17519 | To express borderline cases of objects, you need the concept of an 'object' [Ayers] |
Full Idea: The only explanation of the power to produce borderline examples like 'Is this hazelnut one object or two?' is the possession of the concept of an object. | |
From: M.R. Ayers (Individuals without Sortals [1974], 'Counting') |
17510 | Speakers need the very general category of a thing, if they are to think about it [Ayers] |
Full Idea: If a speaker indicates something, then in order for others to catch his reference they must know, at some level of generality, what kind of thing is indicated. They must categorise it as event, object, or quality. Thinking about something needs that much. | |
From: M.R. Ayers (Individuals without Sortals [1974], Intro) | |
A reaction: Ayers defends the view that such general categories are required, but not the much narrower sortal terms defended by Geach and Wiggins. I'm with Ayers all the way. 'What the hell is that?' |
17522 | We use sortals to classify physical objects by the nature and origin of their unity [Ayers] |
Full Idea: Sortals are the terms by which we intend to classify physical objects according to the nature and origin of their unity. | |
From: M.R. Ayers (Individuals without Sortals [1974], 'Concl') | |
A reaction: This is as opposed to using sortals for the initial individuation. I take the perception of the unity to come first, so resemblance must be mentioned, though it can be an underlying (essentialist) resemblance. |
17515 | Seeing caterpillar and moth as the same needs continuity, not identity of sortal concepts [Ayers] |
Full Idea: It is unnecessary to call moths 'caterpillars' or caterpillars 'moths' to see that they can be the same individual. It may be that our sortal concepts reflect our beliefs about continuity, but our beliefs about continuity need not reflect our sortals. | |
From: M.R. Ayers (Individuals without Sortals [1974], 'Realist' vi) | |
A reaction: Something that metamorphosed through 15 different stages could hardly required 15 different sortals before we recognised the fact. Ayers is right. |
17511 | Recognising continuity is separate from sortals, and must precede their use [Ayers] |
Full Idea: The recognition of the fact of continuity is logically independent of the possession of sortal concepts, whereas the formation of sortal concepts is at least psychologically dependent upon the recognition of continuity. | |
From: M.R. Ayers (Individuals without Sortals [1974], Intro) | |
A reaction: I take this to be entirely correct. I might add that unity must also be recognised. |
17517 | Could the same matter have more than one form or principle of unity? [Ayers] |
Full Idea: The abstract question arises of whether the same matter could be subject to more than one principle of unity simultaneously, or unified by more than one 'form'. | |
From: M.R. Ayers (Individuals without Sortals [1974], 'Realist' vii) | |
A reaction: He suggests that the unity of the sweater is destroyed by unravelling, and the unity of the thread by cutting. |
17513 | If there are two objects, then 'that marble, man-shaped object' is ambiguous [Ayers] |
Full Idea: The statue is marble and man-shaped, but so is the piece of marble. So not only are the two objects in the same place, but two marble and man-shaped objects in the same place, so 'that marble, man-shaped object' must be ambiguous or indefinite. | |
From: M.R. Ayers (Individuals without Sortals [1974], 'Prob') | |
A reaction: It strikes me as basic that it can't be a piece of marble if you subtract its shape, and it can't be a statue if you subtract its matter. To treat a statue as an object, separately from its matter, is absurd. |
17523 | Sortals basically apply to individuals [Ayers] |
Full Idea: Sortals, in their primitive use, apply to the individual. | |
From: M.R. Ayers (Individuals without Sortals [1974], 'Concl') | |
A reaction: If the sortal applies to the individual, any essence must pertain to that individual, and not to the class it has been placed in. |
17521 | You can't have the concept of a 'stage' if you lack the concept of an object [Ayers] |
Full Idea: It would be impossible for anyone to have the concept of a stage who did not already possess the concept of a physical object. | |
From: M.R. Ayers (Individuals without Sortals [1974], 'Concl') |
17514 | Temporal 'parts' cannot be separated or rearranged [Ayers] |
Full Idea: Temporally extended 'parts' are still mysteriously inseparable and not subject to rearrangement: a thing cannot be cut temporally in half. | |
From: M.R. Ayers (Individuals without Sortals [1974], 'Prob') | |
A reaction: A nice warning to anyone accepting a glib analogy between spatial parts and temporal parts. |
17509 | Some say a 'covering concept' completes identity; others place the concept in the reference [Ayers] |
Full Idea: Some hold that the 'covering concept' completes the incomplete concept of identity, determining the kind of sameness involved. Others strongly deny the identity itself is incomplete, and locate the covering concept within the necessary act of reference. | |
From: M.R. Ayers (Individuals without Sortals [1974], Intro) | |
A reaction: [a bit compressed; Geach is the first view, and Quine the second; Wiggins is somewhere between the two] |
17512 | If diachronic identities need covering concepts, why not synchronic identities too? [Ayers] |
Full Idea: Why are covering concepts required for diachronic identities, when they must be supposed unnecessary for synchronic identities? | |
From: M.R. Ayers (Individuals without Sortals [1974], 'Prob') |
2799 | Bayes' theorem explains why very surprising predictions have a higher value as evidence [Horwich] |
Full Idea: Bayesianism can explain the fact that in science surprising predictions have greater evidential value, as the equation produces a higher degree of confirmation. | |
From: Paul Horwich (Bayesianism [1992], p.42) |
2798 | Probability of H, given evidence E, is prob(H) x prob(E given H) / prob(E) [Horwich] |
Full Idea: Bayesianism says ideally rational people should have degrees of belief (not all-or-nothing beliefs), corresponding with probability theory. Probability of H, given evidence E, is prob(H) X prob(E given H) / prob(E). | |
From: Paul Horwich (Bayesianism [1992], p.41) |