78 ideas
9641 | Definitions should be replaceable by primitives, and should not be creative [Brown,JR] |
9634 | Set theory says that natural numbers are an actual infinity (to accommodate their powerset) [Brown,JR] |
10073 | There cannot be a set theory which is complete [Smith,P] |
9613 | Naïve set theory assumed that there is a set for every condition [Brown,JR] |
9615 | Nowadays conditions are only defined on existing sets [Brown,JR] |
9617 | The 'iterative' view says sets start with the empty set and build up [Brown,JR] |
9642 | A flock of birds is not a set, because a set cannot go anywhere [Brown,JR] |
10616 | Second-order arithmetic can prove new sentences of first-order [Smith,P] |
9605 | If a proposition is false, then its negation is true [Brown,JR] |
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] |
9649 | Axioms are either self-evident, or stipulations, or fallible attempts [Brown,JR] |
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] |
9638 | Berry's Paradox finds a contradiction in the naming of huge numbers [Brown,JR] |
9604 | Mathematics is the only place where we are sure we are right [Brown,JR] |
10599 | For primes we write (x not= 1 ∧ ∀u∀v(u x v = x → (u = 1 ∨ v = 1))) [Smith,P] |
9622 | 'There are two apples' can be expressed logically, with no mention of numbers [Brown,JR] |
10610 | The reals contain the naturals, but the theory of reals doesn't contain the theory of naturals [Smith,P] |
9648 | π is a 'transcendental' number, because it is not the solution of an equation [Brown,JR] |
10619 | The truths of arithmetic are just true equations and their universally quantified versions [Smith,P] |
9621 | Mathematics represents the world through structurally similar models. [Brown,JR] |
9646 | There is no limit to how many ways something can be proved in mathematics [Brown,JR] |
9647 | Computers played an essential role in proving the four-colour theorem of maps [Brown,JR] |
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] |
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] |
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] |
9643 | Set theory may represent all of mathematics, without actually being mathematics [Brown,JR] |
9644 | When graphs are defined set-theoretically, that won't cover unlabelled graphs [Brown,JR] |
9625 | To see a structure in something, we must already have the idea of the structure [Brown,JR] |
9628 | Sets seem basic to mathematics, but they don't suit structuralism [Brown,JR] |
9606 | The irrationality of root-2 was achieved by intellect, not experience [Brown,JR] |
9612 | There is an infinity of mathematical objects, so they can't be physical [Brown,JR] |
9610 | Numbers are not abstracted from particulars, because each number is a particular [Brown,JR] |
9620 | Empiricists base numbers on objects, Platonists base them on properties [Brown,JR] |
9639 | Does some mathematics depend entirely on notation? [Brown,JR] |
9629 | For nomalists there are no numbers, only numerals [Brown,JR] |
9630 | The most brilliant formalist was Hilbert [Brown,JR] |
9608 | There are no constructions for many highly desirable results in mathematics [Brown,JR] |
9645 | Constructivists say p has no value, if the value depends on Goldbach's Conjecture [Brown,JR] |
9619 | David's 'Napoleon' is about something concrete and something abstract [Brown,JR] |
10617 | The 'ancestral' of a relation is a new relation which creates a long chain of the original relation [Smith,P] |
9611 | 'Abstract' nowadays means outside space and time, not concrete, not physical [Brown,JR] |
9609 | The older sense of 'abstract' is where 'redness' or 'group' is abstracted from particulars [Brown,JR] |
9640 | A term can have not only a sense and a reference, but also a 'computational role' [Brown,JR] |
9635 | Given atomism at one end, and a finite universe at the other, there are no physical infinities [Brown,JR] |
1513 | The Egyptians were the first to say the soul is immortal and reincarnated [Herodotus] |