81 ideas
15945 | Second-order set theory just adds a version of Replacement that quantifies over functions [Lavine] |
15914 | An 'upper bound' is the greatest member of a subset; there may be several of these, so there is a 'least' one [Lavine] |
15921 | Collections of things can't be too big, but collections by a rule seem unlimited in size [Lavine] |
15937 | Those who reject infinite collections also want to reject the Axiom of Choice [Lavine] |
10073 | There cannot be a set theory which is complete [Smith,P] |
15936 | The Power Set is just the collection of functions from one collection to another [Lavine] |
15899 | Replacement was immediately accepted, despite having very few implications [Lavine] |
15930 | Foundation says descending chains are of finite length, blocking circularity, or ungrounded sets [Lavine] |
15920 | Pure collections of things obey Choice, but collections defined by a rule may not [Lavine] |
15898 | The controversy was not about the Axiom of Choice, but about functions as arbitrary, or given by rules [Lavine] |
15919 | The 'logical' notion of class has some kind of definition or rule to characterise the class [Lavine] |
15900 | The iterative conception of set wasn't suggested until 1947 [Lavine] |
15931 | The iterative conception needs the Axiom of Infinity, to show how far we can iterate [Lavine] |
15932 | The iterative conception doesn't unify the axioms, and has had little impact on mathematical proofs [Lavine] |
15933 | Limitation of Size: if it's the same size as a set, it's a set; it uses Replacement [Lavine] |
15913 | A collection is 'well-ordered' if there is a least element, and all of its successors can be identified [Lavine] |
10616 | Second-order arithmetic can prove new sentences of first-order [Smith,P] |
15926 | Second-order logic presupposes a set of relations already fixed by the first-order domain [Lavine] |
15934 | Mathematical proof by contradiction needs the law of excluded middle [Lavine] |
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] |
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] |
15907 | Mathematics is nowadays (thanks to set theory) regarded as the study of structure, not of quantity [Lavine] |
10599 | For primes we write (x not= 1 ∧ ∀u∀v(u x v = x → (u = 1 ∨ v = 1))) [Smith,P] |
15942 | Every rational number, unlike every natural number, is divisible by some other number [Lavine] |
15922 | For the real numbers to form a set, we need the Continuum Hypothesis to be true [Lavine] |
10610 | The reals contain the naturals, but the theory of reals doesn't contain the theory of naturals [Smith,P] |
18250 | Cauchy gave a necessary condition for the convergence of a sequence [Lavine] |
15904 | The two sides of the Cut are, roughly, the bounding commensurable ratios [Lavine] |
15912 | Counting results in well-ordering, and well-ordering makes counting possible [Lavine] |
10619 | The truths of arithmetic are just true equations and their universally quantified versions [Smith,P] |
15949 | The theory of infinity must rest on our inability to distinguish between very large sizes [Lavine] |
15947 | The infinite is extrapolation from the experience of indefinitely large size [Lavine] |
15940 | The intuitionist endorses only the potential infinite [Lavine] |
15909 | 'Aleph-0' is cardinality of the naturals, 'aleph-1' the next cardinal, 'aleph-ω' the ω-th cardinal [Lavine] |
15915 | Ordinals are basic to Cantor's transfinite, to count the sets [Lavine] |
15917 | Paradox: the class of all ordinals is well-ordered, so must have an ordinal as type - giving a bigger ordinal [Lavine] |
15918 | Paradox: there is no largest cardinal, but the class of everything seems to be the largest [Lavine] |
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] |
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] |
10852 | Robinson Arithmetic (Q) is not negation complete [Smith,P] |
10851 | Robinson Arithmetic 'Q' has basic axioms, quantifiers and first-order logic [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] |
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] |
15929 | Set theory will found all of mathematics - except for the notion of proof [Lavine] |
15935 | Modern mathematics works up to isomorphism, and doesn't care what things 'really are' [Lavine] |
15928 | Intuitionism rejects set-theory to found mathematics [Lavine] |
16062 | A necessary relation between fact-levels seems to be a further irreducible fact [Lynch/Glasgow] |
16061 | If some facts 'logically supervene' on some others, they just redescribe them, adding nothing [Lynch/Glasgow] |
16060 | Nonreductive materialism says upper 'levels' depend on lower, but don't 'reduce' [Lynch/Glasgow] |
16064 | The hallmark of physicalism is that each causal power has a base causal power under it [Lynch/Glasgow] |
10617 | The 'ancestral' of a relation is a new relation which creates a long chain of the original relation [Smith,P] |