display all the ideas for this combination of texts
5 ideas
| 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) |
| 17518 | Counting 'coin in this box' may have coin as the unit, with 'in this box' merely as the scope [Ayers] |
| Full Idea: If we count the concept 'coin in this box', we could regard coin as the 'unit', while taking 'in this box' to limit the scope. Counting coins in two boxes would be not a difference in unit (kind of object), but in scope. | |
| From: M.R. Ayers (Individuals without Sortals [1974], 'Counting') | |
| A reaction: This is a very nice alternative to the Fregean view of counting, depending totally on the concept, and rests more on a natural concept of object. I prefer Ayers. Compare 'count coins till I tell you to stop'. |
| 17516 | If counting needs a sortal, what of things which fall under two sortals? [Ayers] |
| Full Idea: If we accepted that counting objects always presupposes some sortal, it is surely clear that the class of objects to be counted could be designated by two sortals rather than one. | |
| From: M.R. Ayers (Individuals without Sortals [1974], 'Realist' vii) | |
| A reaction: His nice example is an object which is both 'a single piece of wool' and a 'sweater', which had better not be counted twice. Wiggins struggles to argue that there is always one 'substance sortal' which predominates. |
| 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? |