62 ideas
| 9572 | Realists about sets say there exists a null set in the real world, with no members [Chihara] |
| Full Idea: In the Gödelian realistic view of set theory the statement that there is a null set as the assertion of the existence in the real world of a set that has no members. | |
| From: Charles Chihara (A Structural Account of Mathematics [2004], 11.6) | |
| A reaction: It seems to me obvious that such a claim is nonsense on stilts. 'In the beginning there was the null set'? |
| 9550 | We only know relational facts about the empty set, but nothing intrinsic [Chihara] |
| Full Idea: Everything we know about the empty set is relational; we know that nothing is the membership relation to it. But what do we know about its 'intrinsic properties'? | |
| From: Charles Chihara (A Structural Account of Mathematics [2004], 01.5) | |
| A reaction: Set theory seems to depend on the concept of the empty set. Modern theorists seem over-influenced by the Quine-Putnam view, that if science needs it, we must commit ourselves to its existence. |
| 9562 | In simple type theory there is a hierarchy of null sets [Chihara] |
| Full Idea: In simple type theory, there is a null set of type 1, a null set of type 2, a null set of type 3..... (Quine has expressed his distaste for this). | |
| From: Charles Chihara (A Structural Account of Mathematics [2004], 07.4) | |
| A reaction: It is bad enough trying to individuate the unique null set, without whole gangs of them drifting indistinguishably through the logical fog. All rational beings should share Quine's distaste, even if Quine is wrong. |
| 9573 | The null set is a structural position which has no other position in membership relation [Chihara] |
| Full Idea: In the structuralist view of sets, in structures of a certain sort the null set is taken to be a position (or point) that will be such that no other position (or point) will be in the membership relation to it. | |
| From: Charles Chihara (A Structural Account of Mathematics [2004], 11.6) | |
| A reaction: It would be hard to conceive of something having a place in a structure if nothing had a relation to it, so is the null set related to singeton sets but not there members. It will be hard to avoid Platonism here. Set theory needs the null set. |
| 9551 | What is special about Bill Clinton's unit set, in comparison with all the others? [Chihara] |
| Full Idea: What is it about the intrinsic properties of just that one unit set in virtue of which Bill Clinton is related to just it and not to any other unit sets in the set-theoretical universe? | |
| From: Charles Chihara (A Structural Account of Mathematics [2004], 01.5) | |
| A reaction: If we all kept pet woodlice, we had better not hold a wood louse rally, or we might go home with the wrong one. My singleton seems seems remarkably like yours. Could we, perhaps, swap, just for a change? |
| 10073 | There cannot be a set theory which is complete [Smith,P] |
| Full Idea: By Gödel's First Incompleteness Theorem, there cannot be a negation-complete set theory. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 01.3) | |
| A reaction: This means that we can never prove all the truths of a system of set theory. |
| 9549 | The set theorist cannot tell us what 'membership' is [Chihara] |
| Full Idea: The set theorist cannot tell us anything about the true relationship of membership. | |
| From: Charles Chihara (A Structural Account of Mathematics [2004], 01.5) | |
| A reaction: If three unrelated objects suddenly became members of a set, it is hard to see how the world would have changed, except in the minds of those thinking about it. |
| 9571 | ZFU refers to the physical world, when it talks of 'urelements' [Chihara] |
| Full Idea: ZFU set theory talks about physical objects (the urelements), and hence is in some way about the physical world. | |
| From: Charles Chihara (A Structural Account of Mathematics [2004], 11.5) | |
| A reaction: This sounds a bit surprising, given that the whole theory would appear to be quite unaffected if God announced that idealism is true and there are no physical objects. |
| 9563 | A pack of wolves doesn't cease when one member dies [Chihara] |
| Full Idea: A pack of wolves is not thought to go out of existence just because some member of the pack is killed. | |
| From: Charles Chihara (A Structural Account of Mathematics [2004], 07.5) | |
| A reaction: The point is that the formal extensional notion of a set doesn't correspond to our common sense notion of a group or class. Even a highly scientific theory about wolves needs a loose notion of a wolf pack. |
| 10616 | Second-order arithmetic can prove new sentences of first-order [Smith,P] |
| Full Idea: Going second-order in arithmetic enables us to prove new first-order arithmetical sentences that we couldn't prove before. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 23.4) | |
| A reaction: The wages of Satan, perhaps. We can prove things about objects by proving things about their properties and sets and functions. Smith says this fact goes all the way up the hierarchy. |
| 10075 | A 'partial function' maps only some elements to another set [Smith,P] |
| Full Idea: A 'partial function' is one which maps only some elements of a domain to elements in another set. For example, the reciprocal function 1/x is not defined for x=0. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 02.1 n1) |
| 10074 | A 'total function' maps every element to one element in another set [Smith,P] |
| Full Idea: A 'total function' is one which maps every element of a domain to exactly one corresponding value in another set. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 02.1) |
| 10612 | An argument is a 'fixed point' for a function if it is mapped back to itself [Smith,P] |
| Full Idea: If a function f maps the argument a back to a itself, so that f(a) = a, then a is said to be a 'fixed point' for f. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 20.5) |
| 10076 | The 'range' of a function is the set of elements in the output set created by the function [Smith,P] |
| Full Idea: The 'range' of a function is the set of elements in the output set that are values of the function for elements in the original set. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 02.1) | |
| A reaction: In other words, the range is the set of values that were created by the function. |
| 10605 | Two functions are the same if they have the same extension [Smith,P] |
| Full Idea: We count two functions as being the same if they have the same extension, i.e. if they pair up arguments with values in the same way. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 11.3) | |
| A reaction: So there's only one way to skin a cat in mathematical logic. |
| 9561 | The mathematics of relations is entirely covered by ordered pairs [Chihara] |
| Full Idea: Everything one needs to do with relations in mathematics can be done by taking a relation to be a set of ordered pairs. (Ordered triples etc. can be defined as order pairs, so that <x,y,z> is <x,<y,z>>). | |
| From: Charles Chihara (A Structural Account of Mathematics [2004], 07.2) | |
| A reaction: How do we distinguish 'I own my cat' from 'I love my cat'? Or 'I quite like my cat' from 'I adore my cat'? Nevertheless, this is an interesting starting point for a discussion of relations. |
| 10615 | The Comprehension Schema says there is a property only had by things satisfying a condition [Smith,P] |
| Full Idea: The so-called Comprehension Schema ∃X∀x(Xx ↔ φ(x)) says that there is a property which is had by just those things which satisfy the condition φ. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 22.3) |
| 10595 | A 'theorem' of a theory is a sentence derived from the axioms using the proof system [Smith,P] |
| Full Idea: 'Theorem': given a derivation of the sentence φ from the axioms of the theory T using the background logical proof system, we will say that φ is a 'theorem' of the theory. Standard abbreviation is T |- φ. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 03.4) |
| 10602 | A 'natural deduction system' has no axioms but many rules [Smith,P] |
| Full Idea: A 'natural deduction system' will have no logical axioms but may rules of inference. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 09.1) | |
| A reaction: He contrasts this with 'Hilbert-style systems', which have many axioms but few rules. Natural deduction uses many assumptions which are then discharged, and so tree-systems are good for representing it. |
| 10613 | No nice theory can define truth for its own language [Smith,P] |
| Full Idea: No nice theory can define truth for its own language. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 21.5) | |
| A reaction: This leads on to Tarski's account of truth. |
| 10078 | An 'injective' ('one-to-one') function creates a distinct output element from each original [Smith,P] |
| Full Idea: An 'injective' function is 'one-to-one' - each element of the output set results from a different element of the original set. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 02.1) | |
| A reaction: That is, two different original elements cannot lead to the same output element. |
| 10077 | A 'surjective' ('onto') function creates every element of the output set [Smith,P] |
| Full Idea: A 'surjective' function is 'onto' - the whole of the output set results from the function being applied to elements of the original set. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 02.1) |
| 10079 | A 'bijective' function has one-to-one correspondence in both directions [Smith,P] |
| Full Idea: A 'bijective' function has 'one-to-one correspondence' - it is both surjective and injective, so that every element in each of the original and the output sets has a matching element in the other. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 02.1) | |
| A reaction: Note that 'injective' is also one-to-one, but only in the one direction. |
| 9552 | Sentences are consistent if they can all be true; for Frege it is that no contradiction can be deduced [Chihara] |
| Full Idea: In first-order logic a set of sentences is 'consistent' iff there is an interpretation (or structure) in which the set of sentences is true. ..For Frege, though, a set of sentences is consistent if it is not possible to deduce a contradiction from it. | |
| From: Charles Chihara (A Structural Account of Mathematics [2004], 02.1) | |
| A reaction: The first approach seems positive, the second negative. Frege seems to have a higher standard, which is appealing, but the first one seems intuitively right. There is a possible world where this could work. |
| 10070 | If everything that a theory proves is true, then it is 'sound' [Smith,P] |
| Full Idea: If everything that a theory proves must be true, then it is a 'sound' theory. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 01.1) |
| 10086 | Soundness is true axioms and a truth-preserving proof system [Smith,P] |
| Full Idea: Soundness is normally a matter of having true axioms and a truth-preserving proof system. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 03.4) | |
| A reaction: The only exception I can think of is if a theory consisted of nothing but the axioms. |
| 10596 | A theory is 'sound' iff every theorem is true (usually from true axioms and truth-preservation) [Smith,P] |
| Full Idea: A theory is 'sound' iff every theorem of it is true (i.e. true on the interpretation built into its language). Soundness is normally a matter of having true axioms and a truth-preserving proof system. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 03.4) |
| 10598 | A theory is 'negation complete' if it proves all sentences or their negation [Smith,P] |
| Full Idea: A theory is 'negation complete' if it decides every sentence of its language (either the sentence, or its negation). | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 03.4) |
| 10597 | 'Complete' applies both to whole logics, and to theories within them [Smith,P] |
| Full Idea: There is an annoying double-use of 'complete': a logic may be semantically complete, but there may be an incomplete theory expressed in it. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 03.4) |
| 10069 | A theory is 'negation complete' if one of its sentences or its negation can always be proved [Smith,P] |
| Full Idea: Logicians say that a theory T is '(negation) complete' if, for every sentence φ in the language of the theory, either φ or ¬φ is deducible in T's proof system. If this were the case, then truth could be equated with provability. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 01.1) | |
| A reaction: The word 'negation' seems to be a recent addition to the concept. Presumable it might be the case that φ can always be proved, but not ¬φ. |
| 10609 | Two routes to Incompleteness: semantics of sound/expressible, or syntax of consistency/proof [Smith,P] |
| Full Idea: There are two routes to Incompleteness results. One goes via the semantic assumption that we are dealing with sound theories, using a result about what they can express. The other uses the syntactic notion of consistency, with stronger notions of proof. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 18.1) |
| 10080 | 'Effective' means simple, unintuitive, independent, controlled, dumb, and terminating [Smith,P] |
| Full Idea: An 'effectively decidable' (or 'computable') algorithm will be step-by-small-step, with no need for intuition, or for independent sources, with no random methods, possible for a dumb computer, and terminates in finite steps. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 02.2) | |
| A reaction: [a compressed paragraph] |
| 10087 | A theory is 'decidable' if all of its sentences could be mechanically proved [Smith,P] |
| Full Idea: A theory is 'decidable' iff there is a mechanical procedure for determining whether any sentence of its language can be proved. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 03.4) | |
| A reaction: Note that it doesn't actually have to be proved. The theorems of the theory are all effectively decidable. |
| 10088 | Any consistent, axiomatized, negation-complete formal theory is decidable [Smith,P] |
| Full Idea: Any consistent, axiomatized, negation-complete formal theory is decidable. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 03.6) |
| 10081 | A set is 'enumerable' is all of its elements can result from a natural number function [Smith,P] |
| Full Idea: A set is 'enumerable' iff either the set is empty, or there is a surjective function to the set from the set of natural numbers, so that the set is in the range of that function. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 02.3) |
| 10083 | A set is 'effectively enumerable' if a computer could eventually list every member [Smith,P] |
| Full Idea: A set is 'effectively enumerable' if an (idealised) computer could be programmed to generate a list of its members such that any member will eventually be mentioned (even if the list is empty, or without end, or contains repetitions). | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 02.4) |
| 10084 | A finite set of finitely specifiable objects is always effectively enumerable (e.g. primes) [Smith,P] |
| Full Idea: A finite set of finitely specifiable objects is always effectively enumerable (for example, the prime numbers). | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 02.4) |
| 10085 | The set of ordered pairs of natural numbers <i,j> is effectively enumerable [Smith,P] |
| Full Idea: The set of ordered pairs of natural numbers (i,j) is effectively enumerable, as proven by listing them in an array (across: <0,0>, <0,1>, <0,2> ..., and down: <0,0>, <1,0>, <2,0>...), and then zig-zagging. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 02.5) |
| 10601 | The thorems of a nice arithmetic can be enumerated, but not the truths (so they're diffferent) [Smith,P] |
| Full Idea: The theorems of any properly axiomatized theory can be effectively enumerated. However, the truths of any sufficiently expressive arithmetic can't be effectively enumerated. Hence the theorems and truths of arithmetic cannot be the same. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 05 Intro) |
| 10600 | Being 'expressible' depends on language; being 'capture/represented' depends on axioms and proof system [Smith,P] |
| Full Idea: Whether a property is 'expressible' in a given theory depends on the richness of the theory's language. Whether the property can be 'captured' (or 'represented') by the theory depends on the richness of the axioms and proof system. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 04.7) |
| 10599 | For primes we write (x not= 1 ∧ ∀u∀v(u x v = x → (u = 1 ∨ v = 1))) [Smith,P] |
| Full Idea: For prime numbers we write (x not= 1 ∧ ∀u∀v(u x v = x → (u = 1 ∨ v = 1))). That is, the only way to multiply two numbers and a get a prime is if one of them is 1. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 04.5) |
| 10610 | The reals contain the naturals, but the theory of reals doesn't contain the theory of naturals [Smith,P] |
| Full Idea: It has been proved (by Tarski) that the real numbers R is a complete theory. But this means that while the real numbers contain the natural numbers, the pure theory of real numbers doesn't contain the theory of natural numbers. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 18.2) |
| 10619 | The truths of arithmetic are just true equations and their universally quantified versions [Smith,P] |
| Full Idea: The truths of arithmetic are just the true equations involving particular numbers, and universally quantified versions of such equations. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 27.7) | |
| A reaction: Must each equation be universally quantified? Why can't we just universally quantify over the whole system? |
| 9553 | Analytic geometry gave space a mathematical structure, which could then have axioms [Chihara] |
| Full Idea: With the invention of analytic geometry (by Fermat and then Descartes) physical space could be represented as having a mathematical structure, which could eventually lead to its axiomatization (by Hilbert). | |
| From: Charles Chihara (A Structural Account of Mathematics [2004], 02.3) | |
| A reaction: The idea that space might have axioms seems to be pythagoreanism run riot. I wonder if there is some flaw at the heart of Einstein's General Theory because of this? |
| 10618 | All numbers are related to zero by the ancestral of the successor relation [Smith,P] |
| Full Idea: All numbers are related to zero by the ancestral of the successor relation. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 23.5) | |
| A reaction: The successor relation only ties a number to the previous one, not to the whole series. Ancestrals are a higher level of abstraction. |
| 10608 | The number of Fs is the 'successor' of the Gs if there is a single F that isn't G [Smith,P] |
| Full Idea: The number of Fs is the 'successor' of the number of Gs if there is an object which is an F, and the remaining things that are F but not identical to the object are equinumerous with the Gs. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 14.1) |
| 10849 | Baby arithmetic covers addition and multiplication, but no general facts about numbers [Smith,P] |
| Full Idea: Baby Arithmetic 'knows' the addition of particular numbers and multiplication, but can't express general facts about numbers, because it lacks quantification. It has a constant '0', a function 'S', and functions '+' and 'x', and identity and negation. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 08.1) |
| 10850 | Baby Arithmetic is complete, but not very expressive [Smith,P] |
| Full Idea: Baby Arithmetic is negation complete, so it can prove every claim (or its negation) that it can express, but it is expressively extremely impoverished. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 08.3) |
| 10851 | Robinson Arithmetic 'Q' has basic axioms, quantifiers and first-order logic [Smith,P] |
| Full Idea: We can beef up Baby Arithmetic into Robinson Arithmetic (referred to as 'Q'), by restoring quantifiers and variables. It has seven generalised axioms, plus standard first-order logic. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 08.3) |
| 10852 | Robinson Arithmetic (Q) is not negation complete [Smith,P] |
| Full Idea: Robinson Arithmetic (Q) is not negation complete | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 08.4) |
| 10068 | Natural numbers have zero, unique successors, unending, no circling back, and no strays [Smith,P] |
| Full Idea: The sequence of natural numbers starts from zero, and each number has just one immediate successor; the sequence continues without end, never circling back on itself, and there are no 'stray' numbers, lurking outside the sequence. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 01.1) | |
| A reaction: These are the characteristics of the natural numbers which have to be pinned down by any axiom system, such as Peano's, or any more modern axiomatic structures. We are in the territory of Gödel's theorems. |
| 10603 | The logic of arithmetic must quantify over properties of numbers to handle induction [Smith,P] |
| Full Idea: If the logic of arithmetic doesn't have second-order quantifiers to range over properties of numbers, how can it handle induction? | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 10.1) |
| 10848 | Multiplication only generates incompleteness if combined with addition and successor [Smith,P] |
| Full Idea: Multiplication in itself isn't is intractable. In 1929 Skolem showed a complete theory for a first-order language with multiplication but lacking addition (or successor). Multiplication together with addition and successor produces incompleteness. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 10.7 n8) |
| 10604 | Incompleteness results in arithmetic from combining addition and successor with multiplication [Smith,P] |
| Full Idea: Putting multiplication together with addition and successor in the language of arithmetic produces incompleteness. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 10.7) | |
| A reaction: His 'Baby Arithmetic' has all three and is complete, but lacks quantification (p.51) |
| 10192 | We can replace existence of sets with possibility of constructing token sentences [Chihara, by MacBride] |
| Full Idea: Chihara's 'constructability theory' is nominalist - mathematics is reducible to a simple theory of types. Instead of talk of sets {x:x is F}, we talk of open sentences Fx defining them. Existence claims become constructability of sentence tokens. | |
| From: report of Charles Chihara (A Structural Account of Mathematics [2004]) by Fraser MacBride - Review of Chihara's 'Structural Acc of Maths' p.81 | |
| A reaction: This seems to be approaching the problem in a Fregean way, by giving an account of the semantics. Chihara is trying to evade the Quinean idea that assertion is ontological commitment. But has Chihara retreated too far? How does he assert existence? |
| 9559 | If a successful theory confirms mathematics, presumably a failed theory disconfirms it? [Chihara] |
| Full Idea: If mathematics shares whatever confirmation accrues to the theories using it, would it not be reasonable to suppose that mathematics shares whatever disconfirmation accrues to the theories using it? | |
| From: Charles Chihara (A Structural Account of Mathematics [2004], 05.8) | |
| A reaction: Presumably Quine would bite the bullet here, although maths is much closer to the centre of his web of belief, and so far less likely to require adjustment. In practice, though, mathematics is not challenged whenever an experiment fails. |
| 9566 | No scientific explanation would collapse if mathematical objects were shown not to exist [Chihara] |
| Full Idea: Evidently, no scientific explanations of specific phenomena would collapse as a result of any hypothetical discovery that no mathematical objects exist. | |
| From: Charles Chihara (A Structural Account of Mathematics [2004], 09.1) | |
| A reaction: It is inconceivable that anyone would challenge this claim. A good model seems to be drama; a play needs commitment from actors and audience, even when we know it is fiction. The point is that mathematics doesn't collapse either. |
| 10617 | The 'ancestral' of a relation is a new relation which creates a long chain of the original relation [Smith,P] |
| Full Idea: The 'ancestral' of a relation is that relation which holds when there is an indefinitely long chain of things having the initial relation. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 23.5) | |
| A reaction: The standard example is spotting the relation 'ancestor' from the receding relation 'parent'. This is a sort of abstraction derived from a relation which is not equivalent (parenthood being transitive but not reflexive). The idea originated with Frege. |
| 9568 | I prefer the open sentences of a Constructibility Theory, to Platonist ideas of 'equivalence classes' [Chihara] |
| Full Idea: What I refer to as an 'equivalence class' (of line segments of a particular length) is an open sentence in my Constructibility Theory. I just use this terminology of the Platonist for didactic purposes. | |
| From: Charles Chihara (A Structural Account of Mathematics [2004], 09.10) | |
| A reaction: This is because 'equivalence classes' is committed to the existence of classes, which is Quinean Platonism. I am with Chihara in wanting a story that avoids such things. Kit Fine is investigating similar notions of rules of construction. |
| 9547 | Mathematical entities are causally inert, so the causal theory of reference won't work for them [Chihara] |
| Full Idea: Causal theories of reference seem doomed to failure for the case of reference to mathematical entities, since such entities are evidently causally inert. | |
| From: Charles Chihara (A Structural Account of Mathematics [2004], 01.3) | |
| A reaction: Presumably you could baptise a fictional entity such as 'Polonius', and initiate a social causal chain, with a tradition of reference. You could baptise a baby in absentia. |
| 19216 | Propositions (such as 'that dog is barking') only exist if their items exist [Williamson] |
| Full Idea: A proposition about an item exists only if that item exists... how could something be the proposition that that dog is barking in circumstances in which that dog does not exist? | |
| From: Timothy Williamson (Necessary Existents [2002], p.240), quoted by Trenton Merricks - Propositions | |
| A reaction: This is a view of propositions I can't make sense of. If I'm under an illusion that there is a dog barking nearby, when there isn't one, can I not say 'that dog is barking'? If I haven't expressed a proposition, what have I done? |
| 9574 | 'Gunk' is an individual possessing no parts that are atoms [Chihara] |
| Full Idea: An 'atomless gunk' is defined to be an individual possessing no parts that are atoms. | |
| From: Charles Chihara (A Structural Account of Mathematics [2004], App A) | |
| A reaction: [Lewis coined it] If you ask what are a-toms made of and what are ideas made of, the only answer we can offer is that the a-toms are made of gunk, and the ideas aren't made of anything, which is still bad news for the existence of ideas. |