58 ideas
| 13985 | A true proposition seems true of one fact, but a false proposition seems true of nothing at all. [Ryle] |
| Full Idea: Whereas there might be just one fact that a true proposition was like, we would have to say that a false proposition was unlike any fact. We could not speak of the fact that it was false of, so we could not speak of its being false of anything at all. | |
| From: Gilbert Ryle (Are there propositions? [1930], 'Objections') | |
| A reaction: Ryle brings out very nicely the point Russell emphasised so much, that the most illuminating studies in philosophy are of how falsehood works, rather than of how truths work. If I say 'the Queen is really a man' it is obvious what that is false of. |
| 13984 | Two maps might correspond to one another, but they are only 'true' of the country they show [Ryle] |
| Full Idea: One map of Sussex is like another, but it is not true of that other map, but only of the county. | |
| From: Gilbert Ryle (Are there propositions? [1930], 'Objections') | |
| A reaction: One might question whether a map is in any sense 'true' of Sussex, though one must admit that there are good and bad maps of Sussex. The point is a nice one, which shows that there is no simple account of truth as correspondence. |
| 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. |
| 13979 | Logic studies consequence, compatibility, contradiction, corroboration, necessitation, grounding.... [Ryle] |
| Full Idea: Logic studies the way in which one thing follows from another, in which one thing is compatible with another, contradicts, corroborates or necessitates another, is a special case of another or the nerve of another. And so on. | |
| From: Gilbert Ryle (Are there propositions? [1930], IV) | |
| A reaction: I presume that 'and so on' would include how one thing proves another. This is quite a nice list, which makes me think a little more widely about the nature of logic (rather than just about inference). Incompatibility isn't a process. |
| 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. |
| 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. |
| 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? |
| 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) |
| 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) |
| 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) |
| 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) |
| 13988 | Many sentences do not state facts, but there are no facts which could not be stated [Ryle] |
| Full Idea: There are many sentences which do not state facts, while there are no facts which (in principle) could not be stated. | |
| From: Gilbert Ryle (Are there propositions? [1930], 'Substitute') | |
| A reaction: Hm. This seems like a nice challenge. The first problem would be infinite facts. Then complex universal facts, beyond the cognizance of any mind. Then facts that change faster than thinking can change. Do you give up yet? Then there's.... |
| 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. |
| 21547 | On Meinong's principles 'the existent round square' has to exist [Russell] |
| Full Idea: To my contention that, on his principles, 'the existent round square' exists, Meinong replies that it is existent but does not exist. I must confess that I see no difference between existing and being existent, and I have no more to say on this head. | |
| From: Bertrand Russell (Review: Meinong 'Uber die Stellung...' [1907], p.93) | |
| A reaction: Russell is obviously invoking the famously dubious ontological argument for God's existence. Normally impossible objects are rejected because of contradictions, but there might also be category mistakes. 'The slow square'. |
| 13983 | Representation assumes you know the ideas, and the reality, and the relation between the two [Ryle] |
| Full Idea: The theory of Representative Ideas begs the whole question, by assuming a) that we can know these 'Ideas', b) that we can know the realities they represent, and c) we can know a particular 'idea' to be representative of a particular reality. | |
| From: Gilbert Ryle (Are there propositions? [1930], 'Objections') | |
| A reaction: Personally I regard the ideas as immediate (rather than acquired by some knowledge process), and I am dimly hoping that they represent reality (or I'm in deep trouble), and I am struggling to piece together the reality they represent. I'm happy with that. |
| 13980 | If you like judgments and reject propositions, what are the relata of incoherence in a judgment? [Ryle] |
| Full Idea: Those who find 'judgments' everywhere and propositions nowhere find that some judgments cohere whereas others are incoherent. What is the status of the terms between which these relations hold? | |
| From: Gilbert Ryle (Are there propositions? [1930], IV) | |
| A reaction: Ryle is playing devil's advocate, but this strikes me as a nice point. I presume Russell after 1906 is the sort of thinker he has in mind. |
| 13978 | Husserl and Meinong wanted objective Meanings and Propositions, as subject-matter for Logic [Ryle] |
| Full Idea: It is argued by Husserl and (virtually) by Meinong that only if there are such entities as objective Meanings - and propositions are just a species of Meaning - is there anything for Logic to be about. | |
| From: Gilbert Ryle (Are there propositions? [1930], IV) | |
| A reaction: It is presumably this proposal which led to the scepticism about meanings in Wittgenstein, Quine and Kripke. The modern view, which strikes me as right, is that logic is about inference, and so doesn't need a subject-matter. |
| 13977 | When I utter a sentence, listeners grasp both my meaning and my state of mind [Ryle] |
| Full Idea: If I have uttered my sentence aloud, a listener can both understand what I say or grasp my meaning, and also infer to my state of mind. | |
| From: Gilbert Ryle (Are there propositions? [1930], I) | |
| A reaction: This simple observations seems rather important. If we shake written words onto the floor, they might add up to a proper sentence, but half of the point of a sentence is missing. Irony trades on the gap between meaning and state of mind. |
| 13976 | 'Propositions' name what is thought, because 'thoughts' and 'judgments' are too ambiguous [Ryle] |
| Full Idea: As the orthodox terms 'thoughts' and 'judgments' are equivocal, since they may equally well denote 'thinkings' as 'what-is-thought', the 'accusatives' of acts of thinking have come to be called 'propositions'. | |
| From: Gilbert Ryle (Are there propositions? [1930], I) | |
| A reaction: I have understood propositions to be capable of truth or falsity. 'What is thought' could be a right old jumble of images and disjointed fragments. Propositions are famous for their unity! |
| 13981 | Several people can believe one thing, or make the same mistake, or share one delusion [Ryle] |
| Full Idea: We ordinarily find no difficulty in saying of a given thing that several people believe it and so, if they think it false, 'make the same mistake' or 'labour under the same delusion'. | |
| From: Gilbert Ryle (Are there propositions? [1930], IV) | |
| A reaction: Ryle is playing devil's advocate, but this (like 13980) strikes me as quite good support for propositions. I suppose you can describe these phenomena as assent to sentences, but they might be very different sentences to express the same delusion. |
| 13987 | We may think in French, but we don't know or believe in French [Ryle] |
| Full Idea: Although we speak of thinking in French, we never talk of knowing or believing or opining in French. | |
| From: Gilbert Ryle (Are there propositions? [1930], 'Substitute') | |
| A reaction: Once again Ryle is playing devil's advocate, but he does it rather well, and offers good support for my belief in propositions. I love this. 'I know, in French, a bank where the wild thyme blows'. |
| 13989 | There are no propositions; they are just sentences, used for thinking, which link to facts in a certain way [Ryle] |
| Full Idea: There are no substantial propositions...There is just a relation between grammatical structure and the logical structure of facts. 'Proposition' denotes the same as 'sentence' or 'statement'. A proposition is not what I think, but what I think or talk in. | |
| From: Gilbert Ryle (Are there propositions? [1930], 'Conclusions') | |
| A reaction: The conclusion of Ryle's discussion, but I found his support for propositions much more convincing than his critique of them, or his attempt at an alternative linguistic account. He never mentioned animals, so he self-evidently hasn't grasped the problem. |
| 13982 | If we accept true propositions, it is hard to reject false ones, and even nonsensical ones [Ryle] |
| Full Idea: All the arguments for the subsistence of true propositions seem to hold good for the subsistence of false ones. We might even have to find room for absurd or nonsensical ones like 'some round squares are not red-headed'. | |
| From: Gilbert Ryle (Are there propositions? [1930], 'Objections') | |
| A reaction: A particularly nice example of a Category Mistake from the man who made them famous. Why can't we just make belief a proposition attitude, so I equally believe 'sea is blue', 'grass is pink' and 'trees are bifocal', but the status of my belief varies? |