99 ideas
| 14456 | 'Socrates is human' expresses predication, and 'Socrates is a man' expresses identity [Russell] |
| 14426 | A definition by 'extension' enumerates items, and one by 'intension' gives a defining property [Russell] |
| 8468 | The sentence 'procrastination drinks quadruplicity' is meaningless, rather than false [Russell, by Orenstein] |
| 14454 | An argument 'satisfies' a function φx if φa is true [Russell] |
| 14453 | The Darapti syllogism is fallacious: All M is S, all M is P, so some S is P' - but if there is no M? [Russell] |
| 14427 | We can enumerate finite classes, but an intensional definition is needed for infinite classes [Russell] |
| 10073 | There cannot be a set theory which is complete [Smith,P] |
| 14428 | Members define a unique class, whereas defining characteristics are numerous [Russell] |
| 14447 | Infinity says 'for any inductive cardinal, there is a class having that many terms' [Russell] |
| 14440 | We may assume that there are infinite collections, as there is no logical reason against them [Russell] |
| 14443 | The British parliament has one representative selected from each constituency [Russell] |
| 14445 | Choice shows that if any two cardinals are not equal, one must be the greater [Russell] |
| 14444 | Choice is equivalent to the proposition that every class is well-ordered [Russell] |
| 14446 | We can pick all the right or left boots, but socks need Choice to insure the representative class [Russell] |
| 14459 | Reducibility: a family of functions is equivalent to a single type of function [Russell] |
| 14461 | Propositions about classes can be reduced to propositions about their defining functions [Russell] |
| 8469 | Russell's proposal was that only meaningful predicates have sets as their extensions [Russell, by Orenstein] |
| 8745 | Classes are logical fictions, and are not part of the ultimate furniture of the world [Russell] |
| 14452 | All the propositions of logic are completely general [Russell] |
| 10616 | Second-order arithmetic can prove new sentences of first-order [Smith,P] |
| 14462 | In modern times, logic has become mathematical, and mathematics has become logical [Russell] |
| 10057 | Logic can only assert hypothetical existence [Russell] |
| 12444 | Logic is concerned with the real world just as truly as zoology [Russell] |
| 14464 | Logic can be known a priori, without study of the actual world [Russell] |
| 10076 | The 'range' of a function is the set of elements in the output set created by the function [Smith,P] |
| 10605 | Two functions are the same if they have the same extension [Smith,P] |
| 10075 | A 'partial function' maps only some elements to another set [Smith,P] |
| 10074 | A 'total function' maps every element to one element in another set [Smith,P] |
| 10612 | An argument is a 'fixed point' for a function if it is mapped back to itself [Smith,P] |
| 10615 | The Comprehension Schema says there is a property only had by things satisfying a condition [Smith,P] |
| 10595 | A 'theorem' of a theory is a sentence derived from the axioms using the proof system [Smith,P] |
| 14458 | Asking 'Did Homer exist?' is employing an abbreviated description [Russell] |
| 10450 | Russell admitted that even names could also be used as descriptions [Russell, by Bach] |
| 14457 | Names are really descriptions, except for a few words like 'this' and 'that' [Russell] |
| 7311 | The only genuine proper names are 'this' and 'that' [Russell] |
| 14455 | 'I met a unicorn' is meaningful, and so is 'unicorn', but 'a unicorn' is not [Russell] |
| 10602 | A 'natural deduction system' has no axioms but many rules [Smith,P] |
| 10613 | No nice theory can define truth for its own language [Smith,P] |
| 10078 | An 'injective' ('one-to-one') function creates a distinct output element from each original [Smith,P] |
| 10079 | A 'bijective' function has one-to-one correspondence in both directions [Smith,P] |
| 10077 | A 'surjective' ('onto') function creates every element of the output set [Smith,P] |
| 10070 | If everything that a theory proves is true, then it is 'sound' [Smith,P] |
| 10086 | Soundness is true axioms and a truth-preserving proof system [Smith,P] |
| 10596 | A theory is 'sound' iff every theorem is true (usually from true axioms and truth-preservation) [Smith,P] |
| 10598 | A theory is 'negation complete' if it proves all sentences or their negation [Smith,P] |
| 10597 | 'Complete' applies both to whole logics, and to theories within them [Smith,P] |
| 10069 | A theory is 'negation complete' if one of its sentences or its negation can always be proved [Smith,P] |
| 10609 | Two routes to Incompleteness: semantics of sound/expressible, or syntax of consistency/proof [Smith,P] |
| 10080 | 'Effective' means simple, unintuitive, independent, controlled, dumb, and terminating [Smith,P] |
| 10087 | A theory is 'decidable' if all of its sentences could be mechanically proved [Smith,P] |
| 10088 | Any consistent, axiomatized, negation-complete formal theory is decidable [Smith,P] |
| 10081 | A set is 'enumerable' is all of its elements can result from a natural number function [Smith,P] |
| 10083 | A set is 'effectively enumerable' if a computer could eventually list every member [Smith,P] |
| 10084 | A finite set of finitely specifiable objects is always effectively enumerable (e.g. primes) [Smith,P] |
| 10085 | The set of ordered pairs of natural numbers <i,j> is effectively enumerable [Smith,P] |
| 10601 | The thorems of a nice arithmetic can be enumerated, but not the truths (so they're diffferent) [Smith,P] |
| 10600 | Being 'expressible' depends on language; being 'capture/represented' depends on axioms and proof system [Smith,P] |
| 14442 | If straight lines were like ratios they might intersect at a 'gap', and have no point in common [Russell] |
| 10599 | For primes we write (x not= 1 ∧ ∀u∀v(u x v = x → (u = 1 ∨ v = 1))) [Smith,P] |
| 14438 | New numbers solve problems: negatives for subtraction, fractions for division, complex for equations [Russell] |
| 13510 | Could a number just be something which occurs in a progression? [Russell, by Hart,WD] |
| 10610 | The reals contain the naturals, but the theory of reals doesn't contain the theory of naturals [Smith,P] |
| 14436 | A series can be 'Cut' in two, where the lower class has no maximum, the upper no minimum [Russell] |
| 14439 | A complex number is simply an ordered couple of real numbers [Russell] |
| 14421 | Discovering that 1 is a number was difficult [Russell] |
| 14424 | Numbers are needed for counting, so they need a meaning, and not just formal properties [Russell] |
| 14441 | The formal laws of arithmetic are the Commutative, the Associative and the Distributive [Russell] |
| 10619 | The truths of arithmetic are just true equations and their universally quantified versions [Smith,P] |
| 14420 | Infinity and continuity used to be philosophy, but are now mathematics [Russell] |
| 10618 | All numbers are related to zero by the ancestral of the successor relation [Smith,P] |
| 10608 | The number of Fs is the 'successor' of the Gs if there is a single F that isn't G [Smith,P] |
| 14431 | The definition of order needs a transitive relation, to leap over infinite intermediate terms [Russell] |
| 10849 | Baby arithmetic covers addition and multiplication, but no general facts about numbers [Smith,P] |
| 10850 | Baby Arithmetic is complete, but not very expressive [Smith,P] |
| 10851 | Robinson Arithmetic 'Q' has basic axioms, quantifiers and first-order logic [Smith,P] |
| 10852 | Robinson Arithmetic (Q) is not negation complete [Smith,P] |
| 14422 | Any founded, non-repeating series all reachable in steps will satisfy Peano's axioms [Russell] |
| 14423 | '0', 'number' and 'successor' cannot be defined by Peano's axioms [Russell] |
| 10068 | Natural numbers have zero, unique successors, unending, no circling back, and no strays [Smith,P] |
| 10603 | The logic of arithmetic must quantify over properties of numbers to handle induction [Smith,P] |
| 10848 | Multiplication only generates incompleteness if combined with addition and successor [Smith,P] |
| 10604 | Incompleteness results in arithmetic from combining addition and successor with multiplication [Smith,P] |
| 14425 | A number is something which characterises collections of the same size [Russell] |
| 14434 | What matters is the logical interrelation of mathematical terms, not their intrinsic nature [Russell] |
| 14465 | Maybe numbers are adjectives, since 'ten men' grammatically resembles 'white men' [Russell] |
| 13414 | For Russell, numbers are sets of equivalent sets [Russell, by Benacerraf] |
| 14449 | There is always something psychological about inference [Russell] |
| 14463 | Existence can only be asserted of something described, not of something named [Russell] |
| 14429 | Classes are logical fictions, made from defining characteristics [Russell] |
| 21628 | To say reality itself is vague is not properly intelligible [Dummett] |
| 14430 | If a relation is symmetrical and transitive, it has to be reflexive [Russell] |
| 14432 | 'Asymmetry' is incompatible with its converse; a is husband of b, so b can't be husband of a [Russell] |
| 10617 | The 'ancestral' of a relation is a new relation which creates a long chain of the original relation [Smith,P] |
| 14435 | The essence of individuality is beyond description, and hence irrelevant to science [Russell] |
| 12197 | Inferring q from p only needs p to be true, and 'not-p or q' to be true [Russell] |
| 14450 | All forms of implication are expressible as truth-functions [Russell] |
| 14460 | If something is true in all possible worlds then it is logically necessary [Russell] |
| 14433 | Mathematically expressed propositions are true of the world, but how to interpret them? [Russell] |
| 14451 | Propositions are mainly verbal expressions of true or false, and perhaps also symbolic thoughts [Russell] |