59 ideas
| 15413 | With four tense operators, all complex tenses reduce to fourteen basic cases [Burgess] |
| 15415 | The temporal Barcan formulas fix what exists, which seems absurd [Burgess] |
| 15430 | Is classical logic a part of intuitionist logic, or vice versa? [Burgess] |
| 15431 | It is still unsettled whether standard intuitionist logic is complete [Burgess] |
| 15429 | Relevance logic's → is perhaps expressible by 'if A, then B, for that reason' [Burgess] |
| 9672 | Free logic is one of the few first-order non-classical logics [Priest,G] |
| 9697 | X1 x X2 x X3... x Xn indicates the 'cartesian product' of those sets [Priest,G] |
| 9685 | <a,b&62; is a set whose members occur in the order shown [Priest,G] |
| 9675 | a ∈ X says a is an object in set X; a ∉ X says a is not in X [Priest,G] |
| 9674 | {x; A(x)} is a set of objects satisfying the condition A(x) [Priest,G] |
| 9673 | {a1, a2, ...an} indicates that a set comprising just those objects [Priest,G] |
| 9677 | Φ indicates the empty set, which has no members [Priest,G] |
| 9676 | {a} is the 'singleton' set of a (not the object a itself) [Priest,G] |
| 9679 | X⊂Y means set X is a 'proper subset' of set Y [Priest,G] |
| 9678 | X⊆Y means set X is a 'subset' of set Y [Priest,G] |
| 9681 | X = Y means the set X equals the set Y [Priest,G] |
| 9683 | X ∩ Y indicates the 'intersection' of sets X and Y, the objects which are in both sets [Priest,G] |
| 9682 | X∪Y indicates the 'union' of all the things in sets X and Y [Priest,G] |
| 9684 | Y - X is the 'relative complement' of X with respect to Y; the things in Y that are not in X [Priest,G] |
| 9694 | The 'relative complement' is things in the second set not in the first [Priest,G] |
| 9693 | The 'intersection' of two sets is a set of the things that are in both sets [Priest,G] |
| 9692 | The 'union' of two sets is a set containing all the things in either of the sets [Priest,G] |
| 9698 | The 'induction clause' says complex formulas retain the properties of their basic formulas [Priest,G] |
| 9687 | A 'member' of a set is one of the objects in the set [Priest,G] |
| 9695 | An 'ordered pair' (or ordered n-tuple) is a set with its members in a particular order [Priest,G] |
| 9696 | A 'cartesian product' of sets is the set of all the n-tuples with one member in each of the sets [Priest,G] |
| 9686 | A 'set' is a collection of objects [Priest,G] |
| 9689 | The 'empty set' or 'null set' has no members [Priest,G] |
| 9690 | A set is a 'subset' of another set if all of its members are in that set [Priest,G] |
| 9691 | A 'proper subset' is smaller than the containing set [Priest,G] |
| 9688 | A 'singleton' is a set with only one member [Priest,G] |
| 9680 | The empty set Φ is a subset of every set (including itself) [Priest,G] |
| 15404 | Technical people see logic as any formal system that can be studied, not a study of argument validity [Burgess] |
| 15405 | Classical logic neglects the non-mathematical, such as temporality or modality [Burgess] |
| 15427 | The Cut Rule expresses the classical idea that entailment is transitive [Burgess] |
| 15421 | Classical logic neglects counterfactuals, temporality and modality, because maths doesn't use them [Burgess] |
| 15403 | Philosophical logic is a branch of logic, and is now centred in computer science [Burgess] |
| 15407 | Formalising arguments favours lots of connectives; proving things favours having very few [Burgess] |
| 15424 | Asserting a disjunction from one disjunct seems odd, but can be sensible, and needed in maths [Burgess] |
| 15409 | All occurrences of variables in atomic formulas are free [Burgess] |
| 15414 | The denotation of a definite description is flexible, rather than rigid [Burgess] |
| 15406 | 'Induction' and 'recursion' on complexity prove by connecting a formula to its atomic components [Burgess] |
| 15425 | The sequent calculus makes it possible to have proof without transitivity of entailment [Burgess] |
| 15426 | We can build one expanding sequence, instead of a chain of deductions [Burgess] |
| 15408 | 'Tautologies' are valid formulas of classical sentential logic - or substitution instances in other logics [Burgess] |
| 15418 | Validity (for truth) and demonstrability (for proof) have correlates in satisfiability and consistency [Burgess] |
| 15412 | Models leave out meaning, and just focus on truth values [Burgess] |
| 15411 | We only need to study mathematical models, since all other models are isomorphic to these [Burgess] |
| 15416 | We aim to get the technical notion of truth in all models matching intuitive truth in all instances [Burgess] |
| 7557 | To solve Zeno's paradox, reject the axiom that the whole has more terms than the parts [Russell] |
| 15428 | The Liar seems like a truth-value 'gap', but dialethists see it as a 'glut' [Burgess] |
| 10059 | In mathematic we are ignorant of both subject-matter and truth [Russell] |
| 7556 | A collection is infinite if you can remove some terms without diminishing its number [Russell] |
| 15420 | De re modality seems to apply to objects a concept intended for sentences [Burgess] |
| 15419 | General consensus is S5 for logical modality of validity, and S4 for proof [Burgess] |
| 15417 | Logical necessity has two sides - validity and demonstrability - which coincide in classical logic [Burgess] |
| 15422 | Three conditionals theories: Materialism (material conditional), Idealism (true=assertable), Nihilism (no truth) [Burgess] |
| 15423 | It is doubtful whether the negation of a conditional has any clear meaning [Burgess] |
| 7554 | Self-evidence is often a mere will-o'-the-wisp [Russell] |