62 ideas
| 13634 | Satisfaction is 'truth in a model', which is a model of 'truth' [Shapiro] |
| Full Idea: In a sense, satisfaction is the notion of 'truth in a model', and (as Hodes 1984 elegantly puts it) 'truth in a model' is a model of 'truth'. | |
| From: Stewart Shapiro (Foundations without Foundationalism [1991], 1.1) | |
| A reaction: So we can say that Tarski doesn't offer a definition of truth itself, but replaces it with a 'model' of truth. |
| 13643 | Aristotelian logic is complete [Shapiro] |
| Full Idea: Aristotelian logic is complete. | |
| From: Stewart Shapiro (Foundations without Foundationalism [1991], 2.5) | |
| A reaction: [He cites Corcoran 1972] |
| 6299 | Axioms are often affirmed simply because they produce results which have been accepted [Resnik] |
| Full Idea: Many axioms have been proposed, not on the grounds that they can be directly known, but rather because they produce a desired body of previously recognised results. | |
| From: Michael D. Resnik (Maths as a Science of Patterns [1997], One.5.1) | |
| A reaction: This is the perennial problem with axioms - whether we start from them, or whether we deduce them after the event. There is nothing wrong with that, just as we might infer the existence of quarks because of their results. |
| 13651 | A set is 'transitive' if contains every member of each of its members [Shapiro] |
| Full Idea: If, for every b∈d, a∈b entails that a∈d, the d is said to be 'transitive'. In other words, d is transitive if it contains every member of each of its members. | |
| From: Stewart Shapiro (Foundations without Foundationalism [1991], 4.2) | |
| A reaction: The alternative would be that the members of the set are subsets, but the members of those subsets are not themselves members of the higher-level set. |
| 13647 | Choice is essential for proving downward Löwenheim-Skolem [Shapiro] |
| Full Idea: The axiom of choice is essential for proving the downward Löwenheim-Skolem Theorem. | |
| From: Stewart Shapiro (Foundations without Foundationalism [1991], 4.1) |
| 13631 | Are sets part of logic, or part of mathematics? [Shapiro] |
| Full Idea: Is there a notion of set in the jurisdiction of logic, or does it belong to mathematics proper? | |
| From: Stewart Shapiro (Foundations without Foundationalism [1991], Pref) | |
| A reaction: It immediately strikes me that they might be neither. I don't see that relations between well-defined groups of things must involve number, and I don't see that mapping the relations must intrinsically involve logical consequence or inference. |
| 13654 | It is central to the iterative conception that membership is well-founded, with no infinite descending chains [Shapiro] |
| Full Idea: In set theory it is central to the iterative conception that the membership relation is well-founded, ...which means there are no infinite descending chains from any relation. | |
| From: Stewart Shapiro (Foundations without Foundationalism [1991], 5.1.4) |
| 13640 | Russell's paradox shows that there are classes which are not iterative sets [Shapiro] |
| Full Idea: The argument behind Russell's paradox shows that in set theory there are logical sets (i.e. classes) that are not iterative sets. | |
| From: Stewart Shapiro (Foundations without Foundationalism [1991], 1.3) | |
| A reaction: In his preface, Shapiro expresses doubts about the idea of a 'logical set'. Hence the theorists like the iterative hierarchy because it is well-founded and under control, not because it is comprehensive in scope. See all of pp.19-20. |
| 13666 | Iterative sets are not Boolean; the complement of an iterative set is not an iterative sets [Shapiro] |
| Full Idea: Iterative sets do not exhibit a Boolean structure, because the complement of an iterative set is not itself an iterative set. | |
| From: Stewart Shapiro (Foundations without Foundationalism [1991], 7.1) |
| 13653 | 'Well-ordering' of a set is an irreflexive, transitive, and binary relation with a least element [Shapiro] |
| Full Idea: A 'well-ordering' of a set X is an irreflexive, transitive, and binary relation on X in which every non-empty subset of X has a least element. | |
| From: Stewart Shapiro (Foundations without Foundationalism [1991], 5.1.3) | |
| A reaction: So there is a beginning, an ongoing sequence, and no retracing of steps. |
| 13627 | There is no 'correct' logic for natural languages [Shapiro] |
| Full Idea: There is no question of finding the 'correct' or 'true' logic underlying a part of natural language. | |
| From: Stewart Shapiro (Foundations without Foundationalism [1991], Pref) | |
| A reaction: One needs the context of Shapiro's defence of second-order logic to see his reasons for this. Call me romantic, but I retain faith that there is one true logic. The Kennedy Assassination problem - can't see the truth because drowning in evidence. |
| 13642 | Logic is the ideal for learning new propositions on the basis of others [Shapiro] |
| Full Idea: A logic can be seen as the ideal of what may be called 'relative justification', the process of coming to know some propositions on the basis of others. | |
| From: Stewart Shapiro (Foundations without Foundationalism [1991], 2.3.1) | |
| A reaction: This seems to be the modern idea of logic, as opposed to identification of a set of 'logical truths' from which eternal necessities (such as mathematics) can be derived. 'Know' implies that they are true - which conclusions may not be. |
| 13668 | Bernays (1918) formulated and proved the completeness of propositional logic [Shapiro] |
| Full Idea: Bernays (1918) formulated and proved the completeness of propositional logic, the first precise solution as part of the Hilbert programme. | |
| From: Stewart Shapiro (Foundations without Foundationalism [1991], 7.2.1) |
| 13669 | Can one develop set theory first, then derive numbers, or are numbers more basic? [Shapiro] |
| Full Idea: In 1910 Weyl observed that set theory seemed to presuppose natural numbers, and he regarded numbers as more fundamental than sets, as did Fraenkel. Dedekind had developed set theory independently, and used it to formulate numbers. | |
| From: Stewart Shapiro (Foundations without Foundationalism [1991], 7.2.2) |
| 13667 | Skolem and Gödel championed first-order, and Zermelo, Hilbert, and Bernays championed higher-order [Shapiro] |
| Full Idea: Skolem and Gödel were the main proponents of first-order languages. The higher-order language 'opposition' was championed by Zermelo, Hilbert, and Bernays. | |
| From: Stewart Shapiro (Foundations without Foundationalism [1991], 7.2) |
| 13662 | First-order logic was an afterthought in the development of modern logic [Shapiro] |
| Full Idea: Almost all the systems developed in the first part of the twentieth century are higher-order; first-order logic was an afterthought. | |
| From: Stewart Shapiro (Foundations without Foundationalism [1991], 7.1) |
| 13624 | The 'triumph' of first-order logic may be related to logicism and the Hilbert programme, which failed [Shapiro] |
| Full Idea: The 'triumph' of first-order logic may be related to the remnants of failed foundationalist programmes early this century - logicism and the Hilbert programme. | |
| From: Stewart Shapiro (Foundations without Foundationalism [1991], Pref) | |
| A reaction: Being complete must also be one of its attractions, and Quine seems to like it because of its minimal ontological commitment. |
| 13660 | Maybe compactness, semantic effectiveness, and the Löwenheim-Skolem properties are desirable [Shapiro] |
| Full Idea: Tharp (1975) suggested that compactness, semantic effectiveness, and the Löwenheim-Skolem properties are consequences of features one would want a logic to have. | |
| From: Stewart Shapiro (Foundations without Foundationalism [1991], 6.5) | |
| A reaction: I like this proposal, though Shapiro is strongly against. We keep extending our logic so that we can prove new things, but why should we assume that we can prove everything? That's just what Gödel suggests that we should give up on. |
| 13673 | The notion of finitude is actually built into first-order languages [Shapiro] |
| Full Idea: The notion of finitude is explicitly 'built in' to the systems of first-order languages in one way or another. | |
| From: Stewart Shapiro (Foundations without Foundationalism [1991], 9.1) | |
| A reaction: Personally I am inclined to think that they are none the worse for that. No one had even thought of all these lovely infinities before 1870, and now we are supposed to change our logic (our actual logic!) to accommodate them. Cf quantum logic. |
| 15944 | Second-order logic is better than set theory, since it only adds relations and operations, and nothing else [Shapiro, by Lavine] |
| Full Idea: Shapiro preferred second-order logic to set theory because second-order logic refers only to the relations and operations in a domain, and not to the other things that set-theory brings with it - other domains, higher-order relations, and so forth. | |
| From: report of Stewart Shapiro (Foundations without Foundationalism [1991]) by Shaughan Lavine - Understanding the Infinite VII.4 |
| 13629 | Broad standard semantics, or Henkin semantics with a subclass, or many-sorted first-order semantics? [Shapiro] |
| Full Idea: Three systems of semantics for second-order languages: 'standard semantics' (variables cover all relations and functions), 'Henkin semantics' (relations and functions are a subclass) and 'first-order semantics' (many-sorted domains for variable-types). | |
| From: Stewart Shapiro (Foundations without Foundationalism [1991], Pref) | |
| A reaction: [my summary] |
| 13650 | Henkin semantics has separate variables ranging over the relations and over the functions [Shapiro] |
|
Full Idea:
In 'Henkin' semantics, in a given model |
|
| From: Stewart Shapiro (Foundations without Foundationalism [1991], 3.3) |
| 13645 | In standard semantics for second-order logic, a single domain fixes the ranges for the variables [Shapiro] |
| Full Idea: In the standard semantics of second-order logic, by fixing a domain one thereby fixes the range of both the first-order variables and the second-order variables. There is no further 'interpreting' to be done. | |
| From: Stewart Shapiro (Foundations without Foundationalism [1991], 3.3) | |
| A reaction: This contrasts with 'Henkin' semantics (Idea 13650), or first-order semantics, which involve more than one domain of quantification. |
| 13649 | Completeness, Compactness and Löwenheim-Skolem fail in second-order standard semantics [Shapiro] |
| Full Idea: The counterparts of Completeness, Compactness and the Löwenheim-Skolem theorems all fail for second-order languages with standard semantics, but hold for Henkin or first-order semantics. Hence such logics are much like first-order logic. | |
| From: Stewart Shapiro (Foundations without Foundationalism [1991], 4.1) | |
| A reaction: Shapiro votes for the standard semantics, because he wants the greater expressive power, especially for the characterization of infinite structures. |
| 13626 | Semantic consequence is ineffective in second-order logic [Shapiro] |
| Full Idea: It follows from Gödel's incompleteness theorem that the semantic consequence relation of second-order logic is not effective. For example, the set of logical truths of any second-order logic is not recursively enumerable. It is not even arithmetic. | |
| From: Stewart Shapiro (Foundations without Foundationalism [1991], Pref) | |
| A reaction: I don't fully understand this, but it sounds rather major, and a good reason to avoid second-order logic (despite Shapiro's proselytising). See Peter Smith on 'effectively enumerable'. |
| 13637 | If a logic is incomplete, its semantic consequence relation is not effective [Shapiro] |
| Full Idea: Second-order logic is inherently incomplete, so its semantic consequence relation is not effective. | |
| From: Stewart Shapiro (Foundations without Foundationalism [1991], 1.2.1) |
| 13632 | Finding the logical form of a sentence is difficult, and there are no criteria of correctness [Shapiro] |
| Full Idea: It is sometimes difficult to find a formula that is a suitable counterpart of a particular sentence of natural language, and there is no acclaimed criterion for what counts as a good, or even acceptable, 'translation'. | |
| From: Stewart Shapiro (Foundations without Foundationalism [1991], 1.1) |
| 13674 | We might reduce ontology by using truth of sentences and terms, instead of using objects satisfying models [Shapiro] |
| Full Idea: The main role of substitutional semantics is to reduce ontology. As an alternative to model-theoretic semantics for formal languages, the idea is to replace the 'satisfaction' relation of formulas (by objects) with the 'truth' of sentences (using terms). | |
| From: Stewart Shapiro (Foundations without Foundationalism [1991], 9.1.4) | |
| A reaction: I find this very appealing, and Ruth Barcan Marcus is the person to look at. My intuition is that logic should have no ontology at all, as it is just about how inference works, not about how things are. Shapiro offers a compromise. |
| 13633 | 'Satisfaction' is a function from models, assignments, and formulas to {true,false} [Shapiro] |
| Full Idea: The 'satisfaction' relation may be thought of as a function from models, assignments, and formulas to the truth values {true,false}. | |
| From: Stewart Shapiro (Foundations without Foundationalism [1991], 1.1) | |
| A reaction: This at least makes clear that satisfaction is not the same as truth. Now you have to understand how Tarski can define truth in terms of satisfaction. |
| 13644 | Semantics for models uses set-theory [Shapiro] |
| Full Idea: Typically, model-theoretic semantics is formulated in set theory. | |
| From: Stewart Shapiro (Foundations without Foundationalism [1991], 2.5.1) |
| 13636 | An axiomatization is 'categorical' if its models are isomorphic, so there is really only one interpretation [Shapiro] |
| Full Idea: An axiomatization is 'categorical' if all its models are isomorphic to one another; ..hence it has 'essentially only one' interpretation [Veblen 1904]. | |
| From: Stewart Shapiro (Foundations without Foundationalism [1991], 1.2.1) |
| 13670 | Categoricity can't be reached in a first-order language [Shapiro] |
| Full Idea: Categoricity cannot be attained in a first-order language. | |
| From: Stewart Shapiro (Foundations without Foundationalism [1991], 7.3) |
| 13658 | Downward Löwenheim-Skolem: each satisfiable countable set always has countable models [Shapiro] |
| Full Idea: A language has the Downward Löwenheim-Skolem property if each satisfiable countable set of sentences has a model whose domain is at most countable. | |
| From: Stewart Shapiro (Foundations without Foundationalism [1991], 6.5) | |
| A reaction: This means you can't employ an infinite model to represent a fact about a countable set. |
| 13659 | Upward Löwenheim-Skolem: each infinite model has infinite models of all sizes [Shapiro] |
| Full Idea: A language has the Upward Löwenheim-Skolem property if for each set of sentences whose model has an infinite domain, then it has a model at least as big as each infinite cardinal. | |
| From: Stewart Shapiro (Foundations without Foundationalism [1991], 6.5) | |
| A reaction: This means you can't have a countable model to represent a fact about infinite sets. |
| 13648 | The Löwenheim-Skolem theorems show an explosion of infinite models, so 1st-order is useless for infinity [Shapiro] |
| Full Idea: The Löwenheim-Skolem theorems mean that no first-order theory with an infinite model is categorical. If Γ has an infinite model, then it has a model of every infinite cardinality. So first-order languages cannot characterize infinite structures. | |
| From: Stewart Shapiro (Foundations without Foundationalism [1991], 4.1) | |
| A reaction: So much of the debate about different logics hinges on characterizing 'infinite structures' - whatever they are! Shapiro is a leading structuralist in mathematics, so he wants second-order logic to help with his project. |
| 13675 | Substitutional semantics only has countably many terms, so Upward Löwenheim-Skolem trivially fails [Shapiro] |
| Full Idea: The Upward Löwenheim-Skolem theorem fails (trivially) with substitutional semantics. If there are only countably many terms of the language, then there are no uncountable substitution models. | |
| From: Stewart Shapiro (Foundations without Foundationalism [1991], 9.1.4) | |
| A reaction: Better and better. See Idea 13674. Why postulate more objects than you can possibly name? I'm even suspicious of all real numbers, because you can't properly define them in finite terms. Shapiro objects that the uncountable can't be characterized. |
| 13635 | 'Weakly sound' if every theorem is a logical truth; 'sound' if every deduction is a semantic consequence [Shapiro] |
| Full Idea: A logic is 'weakly sound' if every theorem is a logical truth, and 'strongly sound', or simply 'sound', if every deduction from Γ is a semantic consequence of Γ. Soundness indicates that the deductive system is faithful to the semantics. | |
| From: Stewart Shapiro (Foundations without Foundationalism [1991], 1.1) | |
| A reaction: Similarly, 'weakly complete' is when every logical truth is a theorem. |
| 13628 | We can live well without completeness in logic [Shapiro] |
| Full Idea: We can live without completeness in logic, and live well. | |
| From: Stewart Shapiro (Foundations without Foundationalism [1991], Pref) | |
| A reaction: This is the kind of heady suggestion that American philosophers love to make. Sounds OK to me, though. Our ability to draw good inferences should be expected to outrun our ability to actually prove them. Completeness is for wimps. |
| 13630 | Non-compactness is a strength of second-order logic, enabling characterisation of infinite structures [Shapiro] |
| Full Idea: It is sometimes said that non-compactness is a defect of second-order logic, but it is a consequence of a crucial strength - its ability to give categorical characterisations of infinite structures. | |
| From: Stewart Shapiro (Foundations without Foundationalism [1991], Pref) | |
| A reaction: The dispute between fans of first- and second-order may hinge on their attitude to the infinite. I note that Skolem, who was not keen on the infinite, stuck to first-order. Should we launch a new Skolemite Crusade? |
| 13646 | Compactness is derived from soundness and completeness [Shapiro] |
| Full Idea: Compactness is a corollary of soundness and completeness. If Γ is not satisfiable, then, by completeness, Γ is not consistent. But the deductions contain only finite premises. So a finite subset shows the inconsistency. | |
| From: Stewart Shapiro (Foundations without Foundationalism [1991], 4.1) | |
| A reaction: [this is abbreviated, but a proof of compactness] Since all worthwhile logics are sound, this effectively means that completeness entails compactness. |
| 13661 | A language is 'semantically effective' if its logical truths are recursively enumerable [Shapiro] |
| Full Idea: A logical language is 'semantically effective' if the collection of logically true sentences is a recursively enumerable set of strings. | |
| From: Stewart Shapiro (Foundations without Foundationalism [1991], 6.5) |
| 6304 | Mathematical realism says that maths exists, is largely true, and is independent of proofs [Resnik] |
| Full Idea: Mathematical realism is the doctrine that mathematical objects exist, that much contemporary mathematics is true, and that the existence and truth in question is independent of our constructions, beliefs and proofs. | |
| From: Michael D. Resnik (Maths as a Science of Patterns [1997], Three.12.9) | |
| A reaction: As thus defined, I would call myself a mathematical realist, but everyone must hesitate a little at the word 'exist' and ask, how does it exist? What is it 'made of'? To say that it exists in the way that patterns exist strikes me as very helpful. |
| 13641 | Complex numbers can be defined as reals, which are defined as rationals, then integers, then naturals [Shapiro] |
| Full Idea: 'Definitions' of integers as pairs of naturals, rationals as pairs of integers, reals as Cauchy sequences of rationals, and complex numbers as pairs of reals are reductive foundations of various fields. | |
| From: Stewart Shapiro (Foundations without Foundationalism [1991], 2.1) | |
| A reaction: On p.30 (bottom) Shapiro objects that in the process of reduction the numbers acquire properties they didn't have before. |
| 13676 | Only higher-order languages can specify that 0,1,2,... are all the natural numbers that there are [Shapiro] |
| Full Idea: The main problem of characterizing the natural numbers is to state, somehow, that 0,1,2,.... are all the numbers that there are. We have seen that this can be accomplished with a higher-order language, but not in a first-order language. | |
| From: Stewart Shapiro (Foundations without Foundationalism [1991], 9.1.4) |
| 13677 | Natural numbers are the finite ordinals, and integers are equivalence classes of pairs of finite ordinals [Shapiro] |
| Full Idea: By convention, the natural numbers are the finite ordinals, the integers are certain equivalence classes of pairs of finite ordinals, etc. | |
| From: Stewart Shapiro (Foundations without Foundationalism [1991], 9.3) |
| 13652 | The 'continuum' is the cardinality of the powerset of a denumerably infinite set [Shapiro] |
| Full Idea: The 'continuum' is the cardinality of the powerset of a denumerably infinite set. | |
| From: Stewart Shapiro (Foundations without Foundationalism [1991], 5.1.2) |
| 13657 | First-order arithmetic can't even represent basic number theory [Shapiro] |
| Full Idea: Few theorists consider first-order arithmetic to be an adequate representation of even basic number theory. | |
| From: Stewart Shapiro (Foundations without Foundationalism [1991], 5 n28) | |
| A reaction: This will be because of Idea 13656. Even 'basic' number theory will include all sorts of vast infinities, and that seems to be where the trouble is. |
| 13656 | Some sets of natural numbers are definable in set-theory but not in arithmetic [Shapiro] |
| Full Idea: There are sets of natural numbers definable in set-theory but not in arithmetic. | |
| From: Stewart Shapiro (Foundations without Foundationalism [1991], 5.3.3) |
| 6300 | Mathematical constants and quantifiers only exist as locations within structures or patterns [Resnik] |
| Full Idea: In maths the primary subject-matter is not mathematical objects but structures in which they are arranged; our constants and quantifiers denote atoms, structureless points, or positions in structures; they have no identity outside a structure or pattern. | |
| From: Michael D. Resnik (Maths as a Science of Patterns [1997], Three.10.1) | |
| A reaction: This seems to me a very promising idea for the understanding of mathematics. All mathematicians acknowledge that the recognition of patterns is basic to the subject. Even animals recognise patterns. It is natural to invent a language of patterns. |
| 6303 | Sets are positions in patterns [Resnik] |
| Full Idea: On my view, sets are positions in certain patterns. | |
| From: Michael D. Resnik (Maths as a Science of Patterns [1997], Three.10.5) | |
| A reaction: I have always found the ontology of a 'set' puzzling, because they seem to depend on prior reasons why something is a member of a given set, which cannot always be random. It is hard to explain sets without mentioning properties. |
| 6302 | Structuralism must explain why a triangle is a whole, and not a random set of points [Resnik] |
| Full Idea: An objection is that structuralism fails to explain why certain mathematical patterns are unified wholes while others are not; for instance, some think that an ontological account of mathematics must explain why a triangle is not a 'random' set of points. | |
| From: Michael D. Resnik (Maths as a Science of Patterns [1997], Three.10.4) | |
| A reaction: This is an indication that we are not just saying that we recognise patterns in nature, but that we also 'see' various underlying characteristics of the patterns. The obvious suggestion is that we see meta-patterns. |
| 6295 | There are too many mathematical objects for them all to be mental or physical [Resnik] |
| Full Idea: If we take mathematics at its word, there are too many mathematical objects for it to be plausible that they are all mental or physical objects. | |
| From: Michael D. Resnik (Maths as a Science of Patterns [1997], One.1) | |
| A reaction: No one, of course, has ever claimed that they are, but this is a good starting point for assessing the ontology of mathematics. We are going to need 'rules', which can deduce the multitudinous mathematical objects from a small ontology. |
| 6296 | Maths is pattern recognition and representation, and its truth and proofs are based on these [Resnik] |
| Full Idea: I argue that mathematical knowledge has its roots in pattern recognition and representation, and that manipulating representations of patterns provides the connection between the mathematical proof and mathematical truth. | |
| From: Michael D. Resnik (Maths as a Science of Patterns [1997], One.1) | |
| A reaction: The suggestion that patterns are at the basis of the ontology of mathematics is the most illuminating thought I have encountered in the area. It immediately opens up the possibility of maths being an entirely empirical subject. |
| 6301 | Congruence is the strongest relationship of patterns, equivalence comes next, and mutual occurrence is the weakest [Resnik] |
| Full Idea: Of the equivalence relationships which occur between patterns, congruence is the strongest, equivalence the next, and mutual occurrence the weakest. None of these is identity, which would require the same position. | |
| From: Michael D. Resnik (Maths as a Science of Patterns [1997], Three.10.3) | |
| A reaction: This gives some indication of how an account of mathematics as a science of patterns might be built up. Presumably the recognition of these 'degrees of strength' cannot be straightforward observation, but will need an a priori component? |
| 13664 | Logicism is distinctive in seeking a universal language, and denying that logic is a series of abstractions [Shapiro] |
| Full Idea: It is claimed that aiming at a universal language for all contexts, and the thesis that logic does not involve a process of abstraction, separates the logicists from algebraists and mathematicians, and also from modern model theory. | |
| From: Stewart Shapiro (Foundations without Foundationalism [1991], 7.1) | |
| A reaction: I am intuitively drawn to the idea that logic is essentially the result of a series of abstractions, so this gives me a further reason not to be a logicist. Shapiro cites Goldfarb 1979 and van Heijenoort 1967. Logicists reduce abstraction to logic. |
| 13625 | Mathematics and logic have no border, and logic must involve mathematics and its ontology [Shapiro] |
| Full Idea: I extend Quinean holism to logic itself; there is no sharp border between mathematics and logic, especially the logic of mathematics. One cannot expect to do logic without incorporating some mathematics and accepting at least some of its ontology. | |
| From: Stewart Shapiro (Foundations without Foundationalism [1991], Pref) | |
| A reaction: I have strong sales resistance to this proposal. Mathematics may have hijacked logic and warped it for its own evil purposes, but if logic is just the study of inferences then it must be more general than to apply specifically to mathematics. |
| 13663 | Some reject formal properties if they are not defined, or defined impredicatively [Shapiro] |
| Full Idea: Some authors (Poincaré and Russell, for example) were disposed to reject properties that are not definable, or are definable only impredicatively. | |
| From: Stewart Shapiro (Foundations without Foundationalism [1991], 7.1) | |
| A reaction: I take Quine to be the culmination of this line of thought, with his general rejection of 'attributes' in logic and in metaphysics. |
| 16730 | If matter is entirely atoms, anything else we notice in it can only be modes [Gassendi] |
| Full Idea: Since these atoms are the whole of the corporeal matter or substance that exists in bodies, if we conceive or notice anything else to exist in these bodies, that is not a substance but only some kind of mode of the substance. | |
| From: Pierre Gassendi (Syntagma [1658], II.1.6.1), quoted by Robert Pasnau - Metaphysical Themes 1274-1671 22.4 | |
| A reaction: If the atoms have a few qualities of their own, are they just modes? If they are genuine powers, then there can be emergent powers, which are rather more than mere 'modes'. |
| 13638 | Properties are often seen as intensional; equiangular and equilateral are different, despite identity of objects [Shapiro] |
| Full Idea: Properties are often taken to be intensional; equiangular and equilateral are thought to be different properties of triangles, even though any triangle is equilateral if and only if it is equiangular. | |
| From: Stewart Shapiro (Foundations without Foundationalism [1991], 1.3) | |
| A reaction: Many logicians seem to want to treat properties as sets of objects (red being just the set of red things), but this looks like a desperate desire to say everything in first-order logic, where only objects are available to quantify over. |
| 16619 | We observe qualities, and use 'induction' to refer to the substances lying under them [Gassendi] |
| Full Idea: Nothing beyond qualities is perceived by the senses. …When we refer to the substance in which the qualities inhere, we do this through induction, by which we reason that some subject lies under the quality. | |
| From: Pierre Gassendi (Syntagma [1658], II.1.6.1), quoted by Robert Pasnau - Metaphysical Themes 1274-1671 07.1 | |
| A reaction: He talks of 'induction' (in an older usage), but he seems to mean abduction, since he never makes any observations of the substances being proposed. |
| 16593 | Atoms are not points, but hard indivisible things, which no force in nature can divide [Gassendi] |
| Full Idea: The vulgar think atoms lack parts and are free of all magnitude, and hence nothing other than a mathematical point, but it is something solid and hard and compact, as to leave no room for division, separation and cutting. No force in nature can divide it. | |
| From: Pierre Gassendi (Syntagma [1658], II.1.3.5), quoted by Robert Pasnau - Metaphysical Themes 1274-1671 03.2 | |
| A reaction: If you gloatingly think the atom has now been split, ask whether electrons and quarks now fit his description. Pasnau notes that though atoms are indivisible, they are not incorruptible, and could go out of existence, or be squashed. |
| 16729 | How do mere atoms produce qualities like colour, flavour and odour? [Gassendi] |
| Full Idea: If the only material principles of things are atoms, having only size, shape, and weight, or motion, then why are so many additional qualities created and existing within the things: color, heat, flavor, odor, and innumerable others? | |
| From: Pierre Gassendi (Syntagma [1658], II.1.5.7), quoted by Robert Pasnau - Metaphysical Themes 1274-1671 22.4 | |
| A reaction: This is pretty much the 'hard question' about the mind-body relation. Bacon said that heat was just motion of matter. I would say that this problem is gradually being solved in my lifetime. |