33 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'. |
| 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. |
| 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) |
| 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). |
| 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. |
| 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. |
| 3756 | Perception, introspection, testimony, memory, reason, and inference can give us knowledge [Bernecker/Dretske] |
| Full Idea: The basic sources of knowledge and justification are perception, introspection, testimony, memory, reason, and inference. | |
| From: Bernecker / Dretske (Knowledge:Readings in Cont.Epist [2000], Pt.V Int) |
| 3757 | Causal theory says true perceptions must be caused by the object perceived [Bernecker/Dretske] |
| Full Idea: The causal theory of perceptions says that to perceive an object is to have a sense-datum caused by that object; it is not enough for the world to be the way we perceive it; the world must cause the perception. | |
| From: Bernecker / Dretske (Knowledge:Readings in Cont.Epist [2000], Pt.V Int) | |
| A reaction: All causal theories seem dubious to me; what causes something is not the same was what it means, or refers to, or what justifies it. The hallmark of successful perception is truth. I would perceive a tree if God planted the perception in me. |
| 3759 | You can acquire new knowledge by exploring memories [Bernecker/Dretske] |
| Full Idea: You can first come to know by remembering, as in learning how many windows there were in your childhood home by imagining a tour. | |
| From: Bernecker / Dretske (Knowledge:Readings in Cont.Epist [2000], Pt.V Int) |
| 3752 | Justification can be of the belief, or of the person holding the belief [Bernecker/Dretske] |
| Full Idea: There is a distinction between a person being justified in holding a belief, and the belief itself being justified. | |
| From: Bernecker / Dretske (Knowledge:Readings in Cont.Epist [2000], Pt.II Int) | |
| A reaction: This is the crucial and elementary distinction which even the most sophisticated of epistemologists keep losing sight of. Epistemology is about persons. All true beliefs are justified - by the facts! |
| 3753 | Foundationalism aims to avoid an infinite regress [Bernecker/Dretske] |
| Full Idea: The driving force behind foundationalism has always been the threat of an infinite regress. | |
| From: Bernecker / Dretske (Knowledge:Readings in Cont.Epist [2000], Pt.III Int) | |
| A reaction: You could just live with the regress (Peter Klein), or say that the regress fades away, or that it is cut off by social epistemological convention, or the regress circles round and rejoins. |
| 3754 | Infallible sensations can't be foundations if they are non-epistemic [Bernecker/Dretske] |
| Full Idea: If sense experiences are non-epistemic they may be infallible, but they are unsuitable for providing the foundations for other beliefs. | |
| From: Bernecker / Dretske (Knowledge:Readings in Cont.Epist [2000], Pt.III Int) | |
| A reaction: If we experience flashing lights in the retina, or an afterimage, we don't think we are seeing objects, so why is normal perception different? Ans: because it is supported by judgement. |
| 3755 | Justification is normative, so it can't be reduced to cognitive psychology [Bernecker/Dretske] |
| Full Idea: The concept of justification is absolutely central to epistemology; but this concept is normative (i.e. it lays down norms), so epistemology can't be reduced to factual cognitive psychology. | |
| From: Bernecker / Dretske (Knowledge:Readings in Cont.Epist [2000], Pt.III Int) | |
| A reaction: A simple rejection of the 'epistemology naturalised' idea. Best to start with slugs rather than people. You can confuse a slug, so it has truth or falsehood, but what is slug normativity? This is an interesting discussion point, not an argument. |
| 3761 | Modern arguments against the sceptic are epistemological and semantic externalism, and the focus on relevance [Bernecker/Dretske] |
| Full Idea: In modern epistemology the three strategies to rebut the sceptic are 1) epistemological externalism, 2) the 'relevant alternative account of knowledge' (that scepticism is too extreme to be relevant), and 3) semantic externalism. | |
| From: Bernecker / Dretske (Knowledge:Readings in Cont.Epist [2000], Pt.IV Int) |
| 3760 | Predictions are bound to be arbitrary if they depend on the language used [Bernecker/Dretske] |
| Full Idea: The new riddle of induction ('grue') seems to demonstrate that sound inductive inferences are arbitrary because they depend on the actual language people use to formulate predictions. | |
| From: Bernecker / Dretske (Knowledge:Readings in Cont.Epist [2000], Pt.V Int) |
| 3758 | Semantic externalism ties content to the world, reducing error [Bernecker/Dretske] |
| Full Idea: Semantic externalism ties our mental content down to our actual environment so there is no possibility of massive error. | |
| From: Bernecker / Dretske (Knowledge:Readings in Cont.Epist [2000], Pt.V Int) | |
| A reaction: This sounds more prescriptive than descriptive. People do make massive errors in their concepts. Maybe educated people are more externalist (respectful of experts) than uneducated people? |