74 ideas
| 15716 | If axioms and their implications have no contradictions, they pass my criterion of truth and existence [Hilbert] |
| 10073 | There cannot be a set theory which is complete [Smith,P] |
| 10616 | Second-order arithmetic can prove new sentences of first-order [Smith,P] |
| 18844 | You would cripple mathematics if you denied Excluded Middle [Hilbert] |
| 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] |
| 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] |
| 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] |
| 10077 | A 'surjective' ('onto') function creates every element of the output set [Smith,P] |
| 10079 | A 'bijective' function has one-to-one correspondence in both directions [Smith,P] |
| 17963 | The facts of geometry, arithmetic or statics order themselves into theories [Hilbert] |
| 17966 | Axioms must reveal their dependence (or not), and must be consistent [Hilbert] |
| 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] |
| 8717 | Hilbert wanted to prove the consistency of all of mathematics (which realists take for granted) [Hilbert, by Friend] |
| 12456 | I aim to establish certainty for mathematical methods [Hilbert] |
| 12461 | We believe all mathematical problems are solvable [Hilbert] |
| 13472 | Hilbert aimed to eliminate number from geometry [Hilbert, by Hart,WD] |
| 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] |
| 10619 | The truths of arithmetic are just true equations and their universally quantified versions [Smith,P] |
| 9633 | No one shall drive us out of the paradise the Cantor has created for us [Hilbert] |
| 12460 | We extend finite statements with ideal ones, in order to preserve our logic [Hilbert] |
| 12462 | Only the finite can bring certainty to the infinite [Hilbert] |
| 12455 | The idea of an infinite totality is an illusion [Hilbert] |
| 12457 | There is no continuum in reality to realise the infinitely small [Hilbert] |
| 17967 | To decide some questions, we must study the essence of mathematical proof itself [Hilbert] |
| 9546 | Euclid axioms concerns possibilities of construction, but Hilbert's assert the existence of objects [Hilbert, by Chihara] |
| 18742 | Hilbert's formalisation revealed implicit congruence axioms in Euclid [Hilbert, by Horsten/Pettigrew] |
| 18217 | Hilbert's geometry is interesting because it captures Euclid without using real numbers [Hilbert, by Field,H] |
| 17965 | The whole of Euclidean geometry derives from a basic equation and transformations [Hilbert] |
| 10618 | All numbers are related to zero by the ancestral of the successor relation [Smith,P] |
| 17964 | Number theory just needs calculation laws and rules for integers [Hilbert] |
| 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] |
| 17697 | The existence of an arbitrarily large number refutes the idea that numbers come from experience [Hilbert] |
| 17698 | Logic already contains some arithmetic, so the two must be developed together [Hilbert] |
| 10113 | The grounding of mathematics is 'in the beginning was the sign' [Hilbert] |
| 10115 | Hilbert substituted a syntactic for a semantic account of consistency [Hilbert, by George/Velleman] |
| 22293 | Hilbert said (to block paradoxes) that mathematical existence is entailed by consistency [Hilbert, by Potter] |
| 12459 | The subject matter of mathematics is immediate and clear concrete symbols [Hilbert] |
| 10116 | Hilbert aimed to prove the consistency of mathematics finitely, to show infinities won't produce contradictions [Hilbert, by George/Velleman] |
| 18112 | Mathematics divides in two: meaningful finitary statements, and empty idealised statements [Hilbert] |
| 10617 | The 'ancestral' of a relation is a new relation which creates a long chain of the original relation [Smith,P] |
| 12887 | A whole must have one characteristic, an internal relation, and a structure [Rescher/Oppenheim] |
| 9636 | My theory aims at the certitude of mathematical methods [Hilbert] |
| 17968 | By digging deeper into the axioms we approach the essence of sciences, and unity of knowedge [Hilbert] |