63 ideas
9738 | Each line of a truth table is a model [Fitting/Mendelsohn] |
Full Idea: Each line of a truth table is, in effect, a model. | |
From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 1.6) | |
A reaction: I find this comment illuminating. It is being connected with the more complex models of modal logic. Each line of a truth table is a picture of how the world might be. |
9727 | Modal logic adds □ (necessarily) and ◊ (possibly) to classical logic [Fitting/Mendelsohn] |
Full Idea: For modal logic we add to the syntax of classical logic two new unary operators □ (necessarily) and ◊ (possibly). | |
From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 1.3) |
9726 | We let 'R' be the accessibility relation: xRy is read 'y is accessible from x' [Fitting/Mendelsohn] |
Full Idea: We let 'R' be the accessibility relation: xRy is read 'y is accessible from x'. | |
From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 1.5) |
9737 | The symbol ||- is the 'forcing' relation; 'Γ ||- P' means that P is true in world Γ [Fitting/Mendelsohn] |
Full Idea: The symbol ||- is used for the 'forcing' relation, as in 'Γ ||- P', which means that P is true in world Γ. | |
From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 1.6) |
13136 | The prefix σ names a possible world, and σ.n names a world accessible from that one [Fitting/Mendelsohn] |
Full Idea: A 'prefix' is a finite sequence of positive integers. A 'prefixed formula' is an expression of the form σ X, where σ is a prefix and X is a formula. A prefix names a possible world, and σ.n names a world accessible from that one. | |
From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 2.2) |
9734 | Modern modal logic introduces 'accessibility', saying xRy means 'y is accessible from x' [Fitting/Mendelsohn] |
Full Idea: Modern modal logic takes into consideration the way the modal relates the possible worlds, called the 'accessibility' relation. .. We let R be the accessibility relation, and xRy reads as 'y is accessible from x. | |
From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 1.5) | |
A reaction: There are various types of accessibility, and these define the various modal logics. |
9736 | A 'model' is a frame plus specification of propositions true at worlds, written < G,R,||- > [Fitting/Mendelsohn] |
Full Idea:
A 'model' is a frame plus a specification of which propositional letters are true at which worlds. It is written as |
|
From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 1.6) |
13727 | A 'constant' domain is the same for all worlds; 'varying' domains can be entirely separate [Fitting/Mendelsohn] |
Full Idea: In 'constant domain' semantics, the domain of each possible world is the same as every other; in 'varying domain' semantics, the domains need not coincide, or even overlap. | |
From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 4.5) |
9735 | A 'frame' is a set G of possible worlds, with an accessibility relation R, written < G,R > [Fitting/Mendelsohn] |
Full Idea:
A 'frame' consists of a non-empty set G, whose members are generally called possible worlds, and a binary relation R, on G, generally called the accessibility relation. We say the frame is the pair |
|
From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 1.6) |
9741 | Accessibility relations can be 'reflexive' (self-referring), 'transitive' (carries over), or 'symmetric' (mutual) [Fitting/Mendelsohn] |
Full Idea: A relation R is 'reflexive' if every world is accessible from itself; 'transitive' if the first world is related to the third world (ΓRΔ and ΔRΩ → ΓRΩ); and 'symmetric' if the accessibility relation is mutual. | |
From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 1.7) | |
A reaction: The different systems of modal logic largely depend on how these accessibility relations are specified. There is also the 'serial' relation, which just says that any world has another world accessible to it. |
9740 | If a proposition is possibly true in a world, it is true in some world accessible from that world [Fitting/Mendelsohn] |
Full Idea: If a proposition is possibly true in a world, then it is also true in some world which is accessible from that world. That is: Γ ||- ◊X ↔ for some Δ ∈ G, ΓRΔ then Δ ||- X. | |
From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 1.6) |
9739 | If a proposition is necessarily true in a world, it is true in all worlds accessible from that world [Fitting/Mendelsohn] |
Full Idea: If a proposition is necessarily true in a world, then it is also true in all worlds which are accessible from that world. That is: Γ ||- □X ↔ for every Δ ∈ G, if ΓRΔ then Δ ||- X. | |
From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 1.6) |
13142 | Existential: a) if σ ◊X then σ.n X b) if σ ¬□X then σ.n ¬X [n is new] [Fitting/Mendelsohn] |
Full Idea: General tableau rules for existential modality: a) if σ ◊ X then σ.n X b) if σ ¬□ X then σ.n ¬X , where n introduces some new world (rather than referring to a world that can be seen). | |
From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 2.2) | |
A reaction: Note that the existential rule of ◊, usually read as 'possibly', asserts something about a new as yet unseen world, whereas □ only refers to worlds which can already be seen, |
13141 | Negation: if σ ¬¬X then σ X [Fitting/Mendelsohn] |
Full Idea: General tableau rule for negation: if σ ¬¬X then σ X | |
From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 2.2) |
13139 | Implic: a) if σ ¬(X→Y) then σ X and σ ¬Y b) if σ X→Y then σ ¬X or σ Y [Fitting/Mendelsohn] |
Full Idea: General tableau rules for implications: a) if σ ¬(X → Y) then σ X and σ ¬Y b) if σ X → Y then σ ¬X or σ Y | |
From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 2.2) |
13143 | Universal: a) if σ ¬◊X then σ.m ¬X b) if σ □X then σ.m X [m exists] [Fitting/Mendelsohn] |
Full Idea: General tableau rules for universal modality: a) if σ ¬◊ X then σ.m ¬X b) if σ □ X then σ.m X , where m refers to a world that can be seen (rather than introducing a new world). | |
From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 2.2) | |
A reaction: Note that the universal rule of □, usually read as 'necessary', only refers to worlds which can already be seen, whereas possibility (◊) asserts some thing about a new as yet unseen world. |
13140 | Bicon: a)if σ(X↔Y) then σ(X→Y) and σ(Y→X) b) [not biconditional, one or other fails] [Fitting/Mendelsohn] |
Full Idea: General tableau rules for biconditionals: a) if σ (X ↔ Y) then σ (X → Y) and σ (Y → X) b) if σ ¬(X ↔ Y) then σ ¬(X → Y) or σ ¬(Y → X) | |
From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 2.2) |
13137 | Conj: a) if σ X∧Y then σ X and σ Y b) if σ ¬(X∧Y) then σ ¬X or σ ¬Y [Fitting/Mendelsohn] |
Full Idea: General tableau rules for conjunctions: a) if σ X ∧ Y then σ X and σ Y b) if σ ¬(X ∧ Y) then σ ¬X or σ ¬Y | |
From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 2.2) |
13138 | Disj: a) if σ ¬(X∨Y) then σ ¬X and σ ¬Y b) if σ X∨Y then σ X or σ Y [Fitting/Mendelsohn] |
Full Idea: General tableau rules for disjunctions: a) if σ ¬(X ∨ Y) then σ ¬X and σ ¬Y b) if σ X ∨ Y then σ X or σ Y | |
From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 2.2) |
13148 | 4r rev-trans: a) if σ.n □X then σ □X b) if σ.n ¬◊X then σ ¬◊X [n occurs] [Fitting/Mendelsohn] |
Full Idea: System 4r reversed-transitive rules (also for S5): a) if σ.n □X then σ □X b) if σ.n ¬◊X then σ ¬◊X [where n is a world which already occurs] | |
From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 2.3) |
13147 | 4 transitive: a) if σ □X then σ.n □X b) if σ ¬◊X then σ.n ¬◊X [n occurs] [Fitting/Mendelsohn] |
Full Idea: System 4 transitive rules (also for K4, S4, S5): a) if σ □X then σ.n □X b) if σ ¬◊X then σ.n ¬◊X [where n is a world which already occurs] | |
From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 2.3) |
13146 | B symmetric: a) if σ.n □X then σ X b) if σ.n ¬◊X then σ ¬X [n occurs] [Fitting/Mendelsohn] |
Full Idea: System B symmetric rules (also for S5): a) if σ.n □X then σ X b) if σ.n ¬◊X then σ ¬X [where n is a world which already occurs] | |
From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 2.3) |
13145 | D serial: a) if σ □X then σ ◊X b) if σ ¬◊X then σ ¬□X [Fitting/Mendelsohn] |
Full Idea: System D serial rules (also for T, B, S4, S5): a) if σ □X then σ ◊X b) if σ ¬◊X then σ ¬□X | |
From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 2.3) |
13144 | T reflexive: a) if σ □X then σ X b) if σ ¬◊X then σ ¬X [Fitting/Mendelsohn] |
Full Idea: System T reflexive rules (also for B, S4, S5): a) if σ □X then σ X b) if σ ¬◊X then σ ¬X | |
From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 2.3) |
13149 | S5: a) if n ◊X then kX b) if n ¬□X then k ¬X c) if n □X then k X d) if n ¬◊X then k ¬X [Fitting/Mendelsohn] |
Full Idea: Simplified S5 rules: a) if n ◊X then kX b) if n ¬□X then k ¬X c) if n □X then k X d) if n ¬◊X then k ¬X. 'n' picks any world; in a) and b) 'k' asserts a new world; in c) and d) 'k' refers to a known world | |
From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 2.3) |
9742 | The system K has no accessibility conditions [Fitting/Mendelsohn] |
Full Idea: The system K has no frame conditions imposed on its accessibility relation. | |
From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 1.8) | |
A reaction: The system is named K in honour of Saul Kripke. |
13114 | □P → P is not valid in D (Deontic Logic), since an obligatory action may be not performed [Fitting/Mendelsohn] |
Full Idea: System D is usually thought of as Deontic Logic, concerning obligations and permissions. □P → P is not valid in D, since just because an action is obligatory, it does not follow that it is performed. | |
From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 1.12.2 Ex) |
9743 | The system D has the 'serial' conditon imposed on its accessibility relation [Fitting/Mendelsohn] |
Full Idea: The system D has the 'serial' condition imposed on its accessibility relation - that is, every world must have some world which is accessible to it. | |
From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 1.8) |
9744 | The system T has the 'reflexive' conditon imposed on its accessibility relation [Fitting/Mendelsohn] |
Full Idea: The system T has the 'reflexive' condition imposed on its accessibility relation - that is, every world must be accessible to itself. | |
From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 1.8) |
9746 | The system K4 has the 'transitive' condition on its accessibility relation [Fitting/Mendelsohn] |
Full Idea: The system K4 has the 'transitive' condition imposed on its accessibility relation - that is, if a relation holds between worlds 1 and 2 and worlds 2 and 3, it must hold between worlds 1 and 3. The relation carries over. | |
From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 1.8) |
9745 | The system B has the 'reflexive' and 'symmetric' conditions on its accessibility relation [Fitting/Mendelsohn] |
Full Idea: The system B has the 'reflexive' and 'symmetric' conditions imposed on its accessibility relation - that is, every world must be accessible to itself, and any relation between worlds must be mutual. | |
From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 1.8) |
9747 | The system S4 has the 'reflexive' and 'transitive' conditions on its accessibility relation [Fitting/Mendelsohn] |
Full Idea: The system S4 has the 'reflexive' and 'transitive' conditions imposed on its accessibility relation - that is, every world is accessible to itself, and accessibility carries over a series of worlds. | |
From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 1.8) |
9748 | System S5 has the 'reflexive', 'symmetric' and 'transitive' conditions on its accessibility relation [Fitting/Mendelsohn] |
Full Idea: The system S5 has the 'reflexive', 'symmetric' and 'transitive' conditions imposed on its accessibility relation - that is, every world is self-accessible, and accessibility is mutual, and it carries over a series of worlds. | |
From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 1.8) | |
A reaction: S5 has total accessibility, and hence is the most powerful system (though it might be too powerful). |
9404 | Modality affects content, because P→◊P is valid, but ◊P→P isn't [Fitting/Mendelsohn] |
Full Idea: P→◊P is usually considered to be valid, but its converse, ◊P→P is not, so (by Frege's own criterion) P and possibly-P differ in conceptual content, and there is no reason why logic should not be widened to accommodate this. | |
From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 1.2) | |
A reaction: Frege had denied that modality affected the content of a proposition (1879:p.4). The observation here is the foundation for the need for a modal logic. |
13112 | In epistemic logic knowers are logically omniscient, so they know that they know [Fitting/Mendelsohn] |
Full Idea: In epistemic logic the knower is treated as logically omniscient. This is puzzling because one then cannot know something and yet fail to know that one knows it (the Principle of Positive Introspection). | |
From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 1.11) | |
A reaction: This is nowadays known as the K-K Problem - to know, must you know that you know. Broadly, we find that externalists say you don't need to know that you know (so animals know things), but internalists say you do need to know that you know. |
13111 | Read epistemic box as 'a knows/believes P' and diamond as 'for all a knows/believes, P' [Fitting/Mendelsohn] |
Full Idea: In epistemic logic we read Υ as 'KaP: a knows that P', and ◊ as 'PaP: it is possible, for all a knows, that P' (a is an individual). For belief we read them as 'BaP: a believes that P' and 'CaP: compatible with everything a believes that P'. | |
From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 1.11) | |
A reaction: [scripted capitals and subscripts are involved] Hintikka 1962 is the source of this. Fitting and Mendelsohn prefer □ to read 'a is entitled to know P', rather than 'a knows that P'. |
13113 | F: will sometime, P: was sometime, G: will always, H: was always [Fitting/Mendelsohn] |
Full Idea: We introduce four future and past tense operators: FP: it will sometime be the case that P. PP: it was sometime the case that P. GP: it will always be the case that P. HP: it has always been the case that P. (P itself is untensed). | |
From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 1.10) | |
A reaction: Temporal logic begins with A.N. Prior, and starts with □ as 'always', and ◊ as 'sometimes', but then adds these past and future divisions. Two different logics emerge, taking □ and ◊ as either past or as future. |
13728 | The Barcan says nothing comes into existence; the Converse says nothing ceases; the pair imply stability [Fitting/Mendelsohn] |
Full Idea: The Converse Barcan says nothing passes out of existence in alternative situations. The Barcan says that nothing comes into existence. The two together say the same things exist no matter what the situation. | |
From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 4.9) | |
A reaction: I take the big problem to be that these reflect what it is you want to say, and that does not keep stable across a conversation, so ordinary rational discussion sometimes asserts these formulas, and 30 seconds later denies them. |
13729 | The Barcan corresponds to anti-monotonicity, and the Converse to monotonicity [Fitting/Mendelsohn] |
Full Idea: The Barcan formula corresponds to anti-monotonicity, and the Converse Barcan formula corresponds to monotonicity. | |
From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 6.3) |
8729 | Intuitionists deny excluded middle, because it is committed to transcendent truth or objects [Shapiro] |
Full Idea: Intuitionists in mathematics deny excluded middle, because it is symptomatic of faith in the transcendent existence of mathematical objects and/or the truth of mathematical statements. | |
From: Stewart Shapiro (Thinking About Mathematics [2000], 1.2) | |
A reaction: There are other problems with excluded middle, such as vagueness, but on the whole I, as a card-carrying 'realist', am committed to the law of excluded middle. |
9725 | 'Predicate abstraction' abstracts predicates from formulae, giving scope for constants and functions [Fitting/Mendelsohn] |
Full Idea: 'Predicate abstraction' is a key idea. It is a syntactic mechanism for abstracting a predicate from a formula, providing a scoping mechanism for constants and function symbols similar to that provided for variables by quantifiers. | |
From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], Pref) |
8763 | The number 3 is presumably identical as a natural, an integer, a rational, a real, and complex [Shapiro] |
Full Idea: It is surely wise to identify the positions in the natural numbers structure with their counterparts in the integer, rational, real and complex number structures. | |
From: Stewart Shapiro (Thinking About Mathematics [2000], 10.2) | |
A reaction: The point is that this might be denied, since 3, 3/1, 3.00.., and -3*i^2 are all arrived at by different methods of construction. Natural 3 has a predecessor, but real 3 doesn't. I agree, intuitively, with Shapiro. Russell (1919) disagreed. |
18249 | Cauchy gave a formal definition of a converging sequence. [Shapiro] |
Full Idea: A sequence a1,a2,... of rational numbers is 'Cauchy' if for each rational number ε>0 there is a natural number N such that for all natural numbers m, n, if m>N and n>N then -ε < am - an < ε. | |
From: Stewart Shapiro (Thinking About Mathematics [2000], 7.2 n4) | |
A reaction: The sequence is 'Cauchy' if N exists. |
8764 | Categories are the best foundation for mathematics [Shapiro] |
Full Idea: There is a dedicated contingent who hold that the category of 'categories' is the proper foundation for mathematics. | |
From: Stewart Shapiro (Thinking About Mathematics [2000], 10.3 n7) | |
A reaction: He cites Lawvere (1966) and McLarty (1993), the latter presenting the view as a form of structuralism. I would say that the concept of a category will need further explication, and probably reduce to either sets or relations or properties. |
8762 | Two definitions of 3 in terms of sets disagree over whether 1 is a member of 3 [Shapiro] |
Full Idea: Zermelo said that for each number n, its successor is the singleton of n, so 3 is {{{null}}}, and 1 is not a member of 3. Von Neumann said each number n is the set of numbers less than n, so 3 is {null,{null},{null,{null}}}, and 1 is a member of 3. | |
From: Stewart Shapiro (Thinking About Mathematics [2000], 10.2) | |
A reaction: See Idea 645 - Zermelo could save Plato from the criticisms of Aristotle! These two accounts are cited by opponents of the set-theoretical account of numbers, because it seems impossible to arbitrate between them. |
8760 | Numbers do not exist independently; the essence of a number is its relations to other numbers [Shapiro] |
Full Idea: The structuralist vigorously rejects any sort of ontological independence among the natural numbers; the essence of a natural number is its relations to other natural numbers. | |
From: Stewart Shapiro (Thinking About Mathematics [2000], 10.1) | |
A reaction: This seems to place the emphasis on ordinals (what order?) rather than on cardinality (how many?). I am strongly inclined to think that this is the correct view, though you can't really have relations if there is nothing to relate. |
8761 | A 'system' is related objects; a 'pattern' or 'structure' abstracts the pure relations from them [Shapiro] |
Full Idea: A 'system' is a collection of objects with certain relations among them; a 'pattern' or 'structure' is the abstract form of a system, highlighting the interrelationships and ignoring any features they do not affect how they relate to other objects. | |
From: Stewart Shapiro (Thinking About Mathematics [2000], 10.1) | |
A reaction: Note that 'ignoring' features is a psychological account of abstraction, which (thanks to Frege and Geach) is supposed to be taboo - but which I suspect is actually indispensable in any proper account of thought and concepts. |
8744 | Logicism seems to be a non-starter if (as is widely held) logic has no ontology of its own [Shapiro] |
Full Idea: The thesis that principles of arithmetic are derivable from the laws of logic runs against a now common view that logic itself has no ontology. There are no particular logical objects. From this perspective logicism is a non-starter. | |
From: Stewart Shapiro (Thinking About Mathematics [2000], 5.1) | |
A reaction: This criticism strikes me as utterly devastating. There are two routes to go: prove that logic does have an ontology of objects (what would they be?), or - better - deny that arithmetic contains any 'objects'. Or give up logicism. |
8749 | Term Formalism says mathematics is just about symbols - but real numbers have no names [Shapiro] |
Full Idea: Term Formalism is the view that mathematics is just about characters or symbols - the systems of numerals and other linguistic forms. ...This will cover integers and rational numbers, but what are real numbers supposed to be, if they lack names? | |
From: Stewart Shapiro (Thinking About Mathematics [2000], 6.1.1) | |
A reaction: Real numbers (such as pi and root-2) have infinite decimal expansions, so we can start naming those. We could also start giving names like 'Harry' to other reals, though it might take a while. OK, I give up. |
8750 | Game Formalism is just a matter of rules, like chess - but then why is it useful in science? [Shapiro] |
Full Idea: Game Formalism likens mathematics to chess, where the 'content' of mathematics is exhausted by the rules of operating with its language. ...This, however, leaves the problem of why the mathematical games are so useful to the sciences. | |
From: Stewart Shapiro (Thinking About Mathematics [2000], 6.1.2) | |
A reaction: This thought pushes us towards structuralism. It could still be a game, but one we learned from observing nature, which plays its own games. Chess is, after all, modelled on warfare. |
8752 | Deductivism says mathematics is logical consequences of uninterpreted axioms [Shapiro] |
Full Idea: The Deductivist version of formalism (sometimes called 'if-thenism') says that the practice of mathematics consists of determining logical consequences of otherwise uninterpreted axioms. | |
From: Stewart Shapiro (Thinking About Mathematics [2000], 6.2) | |
A reaction: [Hilbert is the source] More plausible than Term or Game Formalism (qv). It still leaves the question of why it seems applicable to nature, and why those particular axioms might be chosen. In some sense, though, it is obviously right. |
8753 | Critics resent the way intuitionism cripples mathematics, but it allows new important distinctions [Shapiro] |
Full Idea: Critics commonly complain that the intuitionist restrictions cripple the mathematician. On the other hand, intuitionist mathematics allows for many potentially important distinctions not available in classical mathematics, and is often more subtle. | |
From: Stewart Shapiro (Thinking About Mathematics [2000], 7.1) | |
A reaction: The main way in which it cripples is its restriction on talk of infinity ('Cantor's heaven'), which was resented by Hilbert. Since high-level infinities are interesting, it would be odd if we were not allowed to discuss them. |
8731 | Conceptualist are just realists or idealist or nominalists, depending on their view of concepts [Shapiro] |
Full Idea: I classify conceptualists according to what they say about properties or concepts. If someone classified properties as existing independent of language I would classify her as a realist in ontology of mathematics. Or they may be idealists or nominalists. | |
From: Stewart Shapiro (Thinking About Mathematics [2000], 2.2.1) | |
A reaction: In other words, Shapiro wants to eliminate 'conceptualist' as a useful label in philosophy of mathematics. He's probably right. All thought involves concepts, but that doesn't produce a conceptualist theory of, say, football. |
8730 | 'Impredicative' definitions refer to the thing being described [Shapiro] |
Full Idea: A definition of a mathematical entity is 'impredicative' if it refers to a collection that contains the defined entity. The definition of 'least upper bound' is impredicative as it refers to upper bounds and characterizes a member of this set. | |
From: Stewart Shapiro (Thinking About Mathematics [2000], 1.2) | |
A reaction: The big question is whether mathematics can live with impredicative definitions, or whether they threaten to be viciously circular, and undermine the whole enterprise. |
13730 | The Indiscernibility of Identicals has been a big problem for modal logic [Fitting/Mendelsohn] |
Full Idea: Equality has caused much grief for modal logic. Many of the problems, which have struck at the heart of the coherence of modal logic, stem from the apparent violations of the Indiscernibility of Identicals. | |
From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 7.1) | |
A reaction: Thus when I say 'I might have been three inches taller', presumably I am referring to someone who is 'identical' to me, but who lacks one of my properties. A simple solution is to say that the person is 'essentially' identical. |
13725 | □ must be sensitive as to whether it picks out an object by essential or by contingent properties [Fitting/Mendelsohn] |
Full Idea: If □ is to be sensitive to the quality of the truth of a proposition in its scope, then it must be sensitive as to whether an object is picked out by an essential property or by a contingent one. | |
From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 4.3) | |
A reaction: This incredibly simple idea strikes me as being powerful and important. ...However, creating illustrative examples leaves me in a state of confusion. You try it. They cite '9' and 'number of planets'. But is it just nominal essence? '9' must be 9. |
13731 | Objects retain their possible properties across worlds, so a bundle theory of them seems best [Fitting/Mendelsohn] |
Full Idea: The property of 'possibly being a Republican' is as much a property of Bill Clinton as is 'being a democrat'. So we don't peel off his properties from world to world. Hence the bundle theory fits our treatment of objects better than bare particulars. | |
From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 7.3) | |
A reaction: This bundle theory is better described in recent parlance as the 'modal profile'. I am reluctant to talk of a modal truth about something as one of its 'properties'. An objects, then, is a bundle of truths? |
13726 | Counterpart relations are neither symmetric nor transitive, so there is no logic of equality for them [Fitting/Mendelsohn] |
Full Idea: The main technical problem with counterpart theory is that the being-a-counterpart relation is, in general, neither symmetric nor transitive, so no natural logic of equality is forthcoming. | |
From: M Fitting/R Mendelsohn (First-Order Modal Logic [1998], 4.5) | |
A reaction: That is, nothing is equal to a counterpart, either directly or indirectly. |
8725 | Rationalism tries to apply mathematical methodology to all of knowledge [Shapiro] |
Full Idea: Rationalism is a long-standing school that can be characterized as an attempt to extend the perceived methodology of mathematics to all of knowledge. | |
From: Stewart Shapiro (Thinking About Mathematics [2000], 1.1) | |
A reaction: Sometimes called 'Descartes's Dream', or the 'Enlightenment Project', the dream of proving everything. Within maths, Hilbert's Programme aimed for the same certainty. Idea 22 is the motto for the opposition to this approach. |
22375 | Moral judgements need more than the relevant facts, if the same facts lead to 'x is good' and 'x is bad' [Foot] |
Full Idea: It is suggested that anyone who has considered all the facts which could bear on his moral position has ipso facto produced a 'well founded' moral judgement, ...How 'x is good' can be well founded when 'x is bad' is equally well founded is hard to see. | |
From: Philippa Foot (Moral Arguments [1958], p.96) | |
A reaction: This seems to be a warning to particularists, if they hope that moral judgements just emerge from the facts. It doesn't rule out physicalist naturalism about morality, if the attitudes we bring to the facts have arisen out of further facts. |
22378 | We can't affirm a duty without saying why it matters if it is not performed [Foot] |
Full Idea: I do not know what could be meant by saying it was someone's duty to do something unless there was an attempt to show why it mattered if this sort of thing was not done. | |
From: Philippa Foot (Moral Arguments [1958], p.105) | |
A reaction: The Kantian idea assumes that duty is an absolute, and yet each duty rests on a particular maxim which is going to be universalised. So why should that maxim be universalised, and not some other? |
22377 | Whether someone is rude is judged by agreed criteria, so the facts dictate the value [Foot] |
Full Idea: Whether a man is speaking of behaviour as rude or not rude, he must use the same criteria as anyone else. ...We have here an example of a non-evaluative premise from which an evaluative conclusion can be deduced. | |
From: Philippa Foot (Moral Arguments [1958], p.104) | |
A reaction: We would now call 'rude' a 'thick' ethical concept (where 'good' is 'thin'). Her powerful point is, I take it, that evidence is always relevant to judgements of thick concepts, so there is no fact-value gap. 'Rude' has criteria, but 'good' may not. |
22376 | Facts and values are connected if we cannot choose what counts as evidence of rightness [Foot] |
Full Idea: To show that facts and values are connected we must show that some things do and some things don't count in favour of a moral conclusion, and that no one can choose what counts as evidence for rightness or wrongness. | |
From: Philippa Foot (Moral Arguments [1958], p.99) | |
A reaction: But what sort of facts might do the job? I can only think of right functioning and health as facts which seem to imply value. Pleasure and misery don't quite get there. |