73 ideas
| 9542 | The best known axiomatization of PL is Whitehead/Russell, with four axioms and two rules [Russell/Whitehead, by Hughes/Cresswell] |
| 10073 | There cannot be a set theory which is complete [Smith,P] |
| 21720 | Russell saw Reducibility as legitimate for reducing classes to logic [Linsky,B on Russell/Whitehead] |
| 10044 | Russell denies extensional sets, because the null can't be a collection, and the singleton is just its element [Russell/Whitehead, by Shapiro] |
| 18208 | We regard classes as mere symbolic or linguistic conveniences [Russell/Whitehead] |
| 10616 | Second-order arithmetic can prove new sentences of first-order [Smith,P] |
| 8204 | Lewis's 'strict implication' preserved Russell's confusion of 'if...then' with implication [Quine on Russell/Whitehead] |
| 9359 | Russell's implication means that random sentences imply one another [Lewis,CI on Russell/Whitehead] |
| 21707 | Russell unusually saw logic as 'interpreted' (though very general, and neutral) [Russell/Whitehead, by Linsky,B] |
| 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] |
| 10076 | The 'range' of a function is the set of elements in the output set created by the function [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] |
| 10036 | In 'Principia' a new abstract theory of relations appeared, and was applied [Russell/Whitehead, by Gödel] |
| 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] |
| 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] |
| 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] |
| 10078 | An 'injective' ('one-to-one') function creates a distinct output element from each original [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] |
| 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] |
| 10080 | 'Effective' means simple, unintuitive, independent, controlled, dumb, and terminating [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] |
| 10599 | For primes we write (x not= 1 ∧ ∀u∀v(u x v = x → (u = 1 ∨ v = 1))) [Smith,P] |
| 10610 | The reals contain the naturals, but the theory of reals doesn't contain the theory of naturals [Smith,P] |
| 18248 | A real number is the class of rationals less than the number [Russell/Whitehead, by Shapiro] |
| 10619 | The truths of arithmetic are just true equations and their universally quantified versions [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] |
| 10618 | All numbers are related to zero by the ancestral of the successor relation [Smith,P] |
| 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] |
| 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] |
| 10604 | Incompleteness results in arithmetic from combining addition and successor with multiplication [Smith,P] |
| 10848 | Multiplication only generates incompleteness if combined with addition and successor [Smith,P] |
| 18152 | Russell takes numbers to be classes, but then reduces the classes to numerical quantifiers [Russell/Whitehead, by Bostock] |
| 8683 | Russell and Whitehead were not realists, but embraced nearly all of maths in logic [Russell/Whitehead, by Friend] |
| 10025 | Russell and Whitehead took arithmetic to be higher-order logic [Russell/Whitehead, by Hodes] |
| 10037 | 'Principia' lacks a precise statement of the syntax [Gödel on Russell/Whitehead] |
| 10093 | The ramified theory of types used propositional functions, and covered bound variables [Russell/Whitehead, by George/Velleman] |
| 8691 | The Russell/Whitehead type theory was limited, and was not really logic [Friend on Russell/Whitehead] |
| 10305 | In 'Principia Mathematica', logic is exceeded in the axioms of infinity and reducibility, and in the domains [Bernays on Russell/Whitehead] |
| 8684 | Russell and Whitehead consider the paradoxes to indicate that we create mathematical reality [Russell/Whitehead, by Friend] |
| 8746 | To avoid vicious circularity Russell produced ramified type theory, but Ramsey simplified it [Russell/Whitehead, by Shapiro] |
| 10617 | The 'ancestral' of a relation is a new relation which creates a long chain of the original relation [Smith,P] |
| 12033 | An object is identical with itself, and no different indiscernible object can share that [Russell/Whitehead, by Adams,RM] |
| 10040 | Russell showed, through the paradoxes, that our basic logical intuitions are self-contradictory [Russell/Whitehead, by Gödel] |
| 21725 | The multiple relations theory says assertions about propositions are about their ingredients [Russell/Whitehead, by Linsky,B] |
| 23474 | A judgement is a complex entity, of mind and various objects [Russell/Whitehead] |
| 23455 | The meaning of 'Socrates is human' is completed by a judgement [Russell/Whitehead] |
| 23480 | The multiple relation theory of judgement couldn't explain the unity of sentences [Morris,M on Russell/Whitehead] |
| 18275 | Only the act of judging completes the meaning of a statement [Russell/Whitehead] |
| 23453 | Propositions as objects of judgement don't exist, because we judge several objects, not one [Russell/Whitehead] |
| 6000 | The goal is rationality in the selection of things according to nature [Diogenes of Babylon, by Blank] |
| 5999 | The good is what is perfect by nature [Diogenes of Babylon, by Blank] |
| 6001 | Justice is a disposition to distribute according to desert [Diogenes of Babylon, by Blank] |