35 ideas
| 13913 | The four 'perfect syllogisms' are called Barbara, Celarent, Darii and Ferio [Engelbretsen/Sayward] |
| 13914 | Syllogistic logic has one rule: what is affirmed/denied of wholes is affirmed/denied of their parts [Engelbretsen/Sayward] |
| 13915 | Syllogistic can't handle sentences with singular terms, or relational terms, or compound sentences [Engelbretsen/Sayward] |
| 13916 | Term logic uses expression letters and brackets, and '-' for negative terms, and '+' for compound terms [Engelbretsen/Sayward] |
| 10888 | Sets can be defined by 'enumeration', or by 'abstraction' (based on a property) [Zalabardo] |
| 10889 | The 'Cartesian Product' of two sets relates them by pairing every element with every element [Zalabardo] |
| 10890 | A 'partial ordering' is reflexive, antisymmetric and transitive [Zalabardo] |
| 10886 | Determinacy: an object is either in a set, or it isn't [Zalabardo] |
| 10887 | Specification: Determinate totals of objects always make a set [Zalabardo] |
| 13850 | In modern logic all formal validity can be characterised syntactically [Engelbretsen/Sayward] |
| 10897 | A first-order 'sentence' is a formula with no free variables [Zalabardo] |
| 13849 | Classical logic rests on truth and models, where constructivist logic rests on defence and refutation [Engelbretsen/Sayward] |
| 10893 | Γ |= φ for sentences if φ is true when all of Γ is true [Zalabardo] |
| 10899 | Γ |= φ if φ is true when all of Γ is true, for all structures and interpretations [Zalabardo] |
| 13851 | Unlike most other signs, = cannot be eliminated [Engelbretsen/Sayward] |
| 10896 | Propositional logic just needs ¬, and one of ∧, ∨ and → [Zalabardo] |
| 10898 | The semantics shows how truth values depend on instantiations of properties and relations [Zalabardo] |
| 10902 | We can do semantics by looking at given propositions, or by building new ones [Zalabardo] |
| 10892 | We make a truth assignment to T and F, which may be true and false, but merely differ from one another [Zalabardo] |
| 10900 | Logically true sentences are true in all structures [Zalabardo] |
| 10895 | 'Logically true' (|= φ) is true for every truth-assignment [Zalabardo] |
| 10901 | Some formulas are 'satisfiable' if there is a structure and interpretation that makes them true [Zalabardo] |
| 10894 | A sentence-set is 'satisfiable' if at least one truth-assignment makes them all true [Zalabardo] |
| 10903 | A structure models a sentence if it is true in the model, and a set of sentences if they are all true in the model [Zalabardo] |
| 13852 | Axioms are ω-incomplete if the instances are all derivable, but the universal quantification isn't [Engelbretsen/Sayward] |
| 10891 | If a set is defined by induction, then proof by induction can be applied to it [Zalabardo] |
| 7127 | If men are good you should keep promises, but they aren't, so you needn't [Machiavelli] |
| 6309 | The principle foundations of all states are good laws and good armies [Machiavelli] |
| 6306 | People are vengeful, so be generous to them, or destroy them [Machiavelli] |
| 6305 | To retain a conquered state, wipe out the ruling family, and preserve everything else [Machiavelli] |
| 6308 | A sensible conqueror does all his harmful deeds immediately, because people soon forget [Machiavelli] |
| 6307 | A desire to conquer, and men who do it, are always praised, or not blamed [Machiavelli] |
| 7486 | Machiavelli emancipated politics from religion [Machiavelli, by Watson] |
| 19813 | All legislators invoke God in support of extraordinary laws, because their justification is not obvious [Machiavelli] |
| 7126 | Rulers should preserve the foundations of religion, to ensure good behaviour and unity [Machiavelli] |