116 ideas
| 291 | Don't assume that wisdom is the automatic consequence of old age [Plato] |
| 13439 | Venn Diagrams map three predicates into eight compartments, then look for the conclusion [Bostock] |
| 13422 | 'Conjunctive Normal Form' is ensuring that no disjunction has a conjunction within its scope [Bostock] |
| 13421 | 'Disjunctive Normal Form' is ensuring that no conjunction has a disjunction within its scope [Bostock] |
| 13355 | 'Disjunction' says that Γ,φ∨ψ|= iff Γ,φ|= and Γ,ψ|= [Bostock] |
| 13356 | The 'conditional' is that Γ|=φ→ψ iff Γ,φ|=ψ [Bostock] |
| 13350 | 'Assumptions' says that a formula entails itself (φ|=φ) [Bostock] |
| 13351 | 'Thinning' allows that if premisses entail a conclusion, then adding further premisses makes no difference [Bostock] |
| 13352 | 'Cutting' allows that if x is proved, and adding y then proves z, you can go straight to z [Bostock] |
| 13353 | 'Negation' says that Γ,¬φ|= iff Γ|=φ [Bostock] |
| 13354 | 'Conjunction' says that Γ|=φ∧ψ iff Γ|=φ and Γ|=ψ [Bostock] |
| 13610 | A logic with ¬ and → needs three axiom-schemas and one rule as foundation [Bostock] |
| 13846 | A 'free' logic can have empty names, and a 'universally free' logic can have empty domains [Bostock] |
| 15901 | Trying to represent curves, we study arbitrary functions, leading to the ordinals, which produces set theory [Cantor, by Lavine] |
| 18098 | Cantor proved that all sets have more subsets than they have members [Cantor, by Bostock] |
| 13444 | Cantor's Theorem: for any set x, its power set P(x) has more members than x [Cantor, by Hart,WD] |
| 15505 | If a set is 'a many thought of as one', beginners should protest against singleton sets [Cantor, by Lewis] |
| 10701 | Cantor showed that supposed contradictions in infinity were just a lack of clarity [Cantor, by Potter] |
| 10865 | The continuum is the powerset of the integers, which moves up a level [Cantor, by Clegg] |
| 13016 | The Axiom of Union dates from 1899, and seems fairly obvious [Cantor, by Maddy] |
| 14199 | Cantor's sets were just collections, but Dedekind's were containers [Cantor, by Oliver/Smiley] |
| 13545 | Elementary logic cannot distinguish clearly between the finite and the infinite [Bostock] |
| 13346 | Truth is the basic notion in classical logic [Bostock] |
| 13822 | Fictional characters wreck elementary logic, as they have contradictions and no excluded middle [Bostock] |
| 13623 | The syntactic turnstile |- φ means 'there is a proof of φ' or 'φ is a theorem' [Bostock] |
| 13349 | Γ|=φ is 'entails'; Γ|= is 'is inconsistent'; |=φ is 'valid' [Bostock] |
| 13347 | Validity is a conclusion following for premises, even if there is no proof [Bostock] |
| 13348 | It seems more natural to express |= as 'therefore', rather than 'entails' [Bostock] |
| 13614 | MPP: 'If Γ|=φ and Γ|=φ→ψ then Γ|=ψ' (omit Γs for Detachment) [Bostock] |
| 13617 | MPP is a converse of Deduction: If Γ |- φ→ψ then Γ,φ|-ψ [Bostock] |
| 13799 | The sign '=' is a two-place predicate expressing that 'a is the same thing as b' (a=b) [Bostock] |
| 13800 | |= α=α and α=β |= φ(α/ξ ↔ φ(β/ξ) fix identity [Bostock] |
| 13803 | If we are to express that there at least two things, we need identity [Bostock] |
| 13357 | Truth-functors are usually held to be defined by their truth-tables [Bostock] |
| 13812 | A 'zero-place' function just has a single value, so it is a name [Bostock] |
| 13811 | A 'total' function ranges over the whole domain, a 'partial' function over appropriate inputs [Bostock] |
| 13360 | In logic, a name is just any expression which refers to a particular single object [Bostock] |
| 13361 | An expression is only a name if it succeeds in referring to a real object [Bostock] |
| 13813 | Definite descriptions don't always pick out one thing, as in denials of existence, or errors [Bostock] |
| 13814 | Definite desciptions resemble names, but can't actually be names, if they don't always refer [Bostock] |
| 13816 | Because of scope problems, definite descriptions are best treated as quantifiers [Bostock] |
| 13817 | Definite descriptions are usually treated like names, and are just like them if they uniquely refer [Bostock] |
| 13848 | We are only obliged to treat definite descriptions as non-names if only the former have scope [Bostock] |
| 13815 | Names do not have scope problems (e.g. in placing negation), but Russell's account does have that problem [Bostock] |
| 13438 | 'Prenex normal form' is all quantifiers at the beginning, out of the scope of truth-functors [Bostock] |
| 13818 | If we allow empty domains, we must allow empty names [Bostock] |
| 13801 | An 'informal proof' is in no particular system, and uses obvious steps and some ordinary English [Bostock] |
| 13619 | Quantification adds two axiom-schemas and a new rule [Bostock] |
| 13622 | Axiom systems from Frege, Russell, Church, Lukasiewicz, Tarski, Nicod, Kleene, Quine... [Bostock] |
| 13615 | 'Conditonalised' inferences point to the Deduction Theorem: If Γ,φ|-ψ then Γ|-φ→ψ [Bostock] |
| 13616 | The Deduction Theorem greatly simplifies the search for proof [Bostock] |
| 13620 | Proof by Assumptions can always be reduced to Proof by Axioms, using the Deduction Theorem [Bostock] |
| 13621 | The Deduction Theorem and Reductio can 'discharge' assumptions - they aren't needed for the new truth [Bostock] |
| 13753 | Natural deduction takes proof from assumptions (with its rules) as basic, and axioms play no part [Bostock] |
| 13755 | Excluded middle is an introduction rule for negation, and ex falso quodlibet will eliminate it [Bostock] |
| 13758 | In natural deduction we work from the premisses and the conclusion, hoping to meet in the middle [Bostock] |
| 13754 | Natural deduction rules for → are the Deduction Theorem (→I) and Modus Ponens (→E) [Bostock] |
| 13611 | Tableau proofs use reduction - seeking an impossible consequence from an assumption [Bostock] |
| 13612 | Non-branching rules add lines, and branching rules need a split; a branch with a contradiction is 'closed' [Bostock] |
| 13613 | A completed open branch gives an interpretation which verifies those formulae [Bostock] |
| 13761 | In a tableau proof no sequence is established until the final branch is closed; hypotheses are explored [Bostock] |
| 13756 | A tree proof becomes too broad if its only rule is Modus Ponens [Bostock] |
| 13757 | Unlike natural deduction, semantic tableaux have recipes for proving things [Bostock] |
| 13762 | Tableau rules are all elimination rules, gradually shortening formulae [Bostock] |
| 13759 | Each line of a sequent calculus is a conclusion of previous lines, each one explicitly recorded [Bostock] |
| 13760 | A sequent calculus is good for comparing proof systems [Bostock] |
| 13364 | Interpretation by assigning objects to names, or assigning them to variables first [Bostock, by PG] |
| 13821 | Extensionality is built into ordinary logic semantics; names have objects, predicates have sets of objects [Bostock] |
| 13362 | If an object has two names, truth is undisturbed if the names are swapped; this is Extensionality [Bostock] |
| 13541 | For 'negation-consistent', there is never |-(S)φ and |-(S)¬φ [Bostock] |
| 13540 | A set of formulae is 'inconsistent' when there is no interpretation which can make them all true [Bostock] |
| 13542 | A proof-system is 'absolutely consistent' iff we don't have |-(S)φ for every formula [Bostock] |
| 13544 | Inconsistency or entailment just from functors and quantifiers is finitely based, if compact [Bostock] |
| 13618 | Compactness means an infinity of sequents on the left will add nothing new [Bostock] |
| 10082 | There are infinite sets that are not enumerable [Cantor, by Smith,P] |
| 13483 | Cantor's Paradox: the power set of the universe must be bigger than the universe, yet a subset of it [Cantor, by Hart,WD] |
| 8710 | The powerset of all the cardinal numbers is required to be greater than itself [Cantor, by Friend] |
| 15910 | Cantor named the third realm between the finite and the Absolute the 'transfinite' [Cantor, by Lavine] |
| 15905 | Cantor proved the points on a plane are in one-to-one correspondence to the points on a line [Cantor, by Lavine] |
| 9983 | Cantor took the ordinal numbers to be primary [Cantor, by Tait] |
| 17798 | Cantor presented the totality of natural numbers as finite, not infinite [Cantor, by Mayberry] |
| 9971 | Cantor introduced the distinction between cardinals and ordinals [Cantor, by Tait] |
| 9892 | Cantor showed that ordinals are more basic than cardinals [Cantor, by Dummett] |
| 14136 | A cardinal is an abstraction, from the nature of a set's elements, and from their order [Cantor] |
| 11015 | Cantor's diagonal argument proved you can't list all decimal numbers between 0 and 1 [Cantor, by Read] |
| 15906 | Cantor tried to prove points on a line matched naturals or reals - but nothing in between [Cantor, by Lavine] |
| 15903 | A real is associated with an infinite set of infinite Cauchy sequences of rationals [Cantor, by Lavine] |
| 18251 | Irrational numbers are the limits of Cauchy sequences of rational numbers [Cantor, by Lavine] |
| 15902 | Irrationals and the Dedekind Cut implied infinite classes, but they seemed to have logical difficulties [Cantor, by Lavine] |
| 15908 | It was Cantor's diagonal argument which revealed infinities greater than that of the real numbers [Cantor, by Lavine] |
| 13464 | Cantor proposes that there won't be a potential infinity if there is no actual infinity [Cantor, by Hart,WD] |
| 10112 | The naturals won't map onto the reals, so there are different sizes of infinity [Cantor, by George/Velleman] |
| 17889 | CH: An infinite set of reals corresponds 1-1 either to the naturals or to the reals [Cantor, by Koellner] |
| 13447 | Cantor: there is no size between naturals and reals, or between a set and its power set [Cantor, by Hart,WD] |
| 10883 | Cantor's Continuum Hypothesis says there is a gap between the natural and the real numbers [Cantor, by Horsten] |
| 8733 | The Continuum Hypothesis says there are no sets between the natural numbers and reals [Cantor, by Shapiro] |
| 13528 | Continuum Hypothesis: there are no sets between N and P(N) [Cantor, by Wolf,RS] |
| 9555 | Continuum Hypothesis: no cardinal greater than aleph-null but less than cardinality of the continuum [Cantor, by Chihara] |
| 18174 | Cantor extended ordinals into the transfinite, and they can thus measure infinite cardinalities [Cantor, by Maddy] |
| 15893 | Cantor's theory concerns collections which can be counted, using the ordinals [Cantor, by Lavine] |
| 18173 | Cardinality strictly concerns one-one correspondence, to test infinite sameness of size [Cantor, by Maddy] |
| 13358 | Ordinary or mathematical induction assumes for the first, then always for the next, and hence for all [Bostock] |
| 13359 | Complete induction assumes for all numbers less than n, then also for n, and hence for all numbers [Bostock] |
| 10232 | Property extensions outstrip objects, so shortage of objects caused the Caesar problem [Cantor, by Shapiro] |
| 18176 | Pure mathematics is pure set theory [Cantor] |
| 8631 | Cantor says that maths originates only by abstraction from objects [Cantor, by Frege] |
| 13543 | A relation is not reflexive, just because it is transitive and symmetrical [Bostock] |
| 13802 | Relations can be one-many (at most one on the left) or many-one (at most one on the right) [Bostock] |
| 13847 | If non-existent things are self-identical, they are just one thing - so call it the 'null object' [Bostock] |
| 13820 | The idea that anything which can be proved is necessary has a problem with empty names [Bostock] |
| 8715 | Infinities expand the bounds of the conceivable; we explore concepts to explore conceivability [Cantor, by Friend] |
| 13454 | Cantor says (vaguely) that we abstract numbers from equal sized sets [Hart,WD on Cantor] |
| 13363 | A (modern) predicate is the result of leaving a gap for the name in a sentence [Bostock] |
| 293 | Being unafraid (perhaps through ignorance) and being brave are two different things [Plato] |
| 10863 | Cantor proved that three dimensions have the same number of points as one dimension [Cantor, by Clegg] |
| 13465 | Only God is absolutely infinite [Cantor, by Hart,WD] |