50 ideas
| 13252 | Some truths have true negations [Beall/Restall] |
| 13247 | A truthmaker is an object which entails a sentence [Beall/Restall] |
| 10688 | 'Equivocation' is when terms do not mean the same thing in premises and conclusion [Beall/Restall] |
| 13249 | (∀x)(A v B) |- (∀x)A v (∃x)B) is valid in classical logic but invalid intuitionistically [Beall/Restall] |
| 13243 | Excluded middle must be true for some situation, not for all situations [Beall/Restall] |
| 13242 | It's 'relevantly' valid if all those situations make it true [Beall/Restall] |
| 13246 | Relevant logic does not abandon classical logic [Beall/Restall] |
| 13245 | Relevant consequence says invalidity is the conclusion not being 'in' the premises [Beall/Restall] |
| 13254 | A doesn't imply A - that would be circular [Beall/Restall] |
| 13255 | Relevant logic may reject transitivity [Beall/Restall] |
| 13250 | Free logic terms aren't existential; classical is non-empty, with referring names [Beall/Restall] |
| 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] |
| 13235 | Logic studies consequence; logical truths are consequences of everything, or nothing [Beall/Restall] |
| 13238 | Syllogisms are only logic when they use variables, and not concrete terms [Beall/Restall] |
| 13234 | The view of logic as knowing a body of truths looks out-of-date [Beall/Restall] |
| 10690 | Formal logic is invariant under permutations, or devoid of content, or gives the norms for thought [Beall/Restall] |
| 13232 | Logic studies arguments, not formal languages; this involves interpretations [Beall/Restall] |
| 10897 | A first-order 'sentence' is a formula with no free variables [Zalabardo] |
| 13241 | The model theory of classical predicate logic is mathematics [Beall/Restall] |
| 10691 | Logical consequence needs either proofs, or absence of counterexamples [Beall/Restall] |
| 13253 | There are several different consequence relations [Beall/Restall] |
| 13240 | A sentence follows from others if they always model it [Beall/Restall] |
| 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] |
| 10695 | Logical consequence is either necessary truth preservation, or preservation based on interpretation [Beall/Restall] |
| 10689 | A step is a 'material consequence' if we need contents as well as form [Beall/Restall] |
| 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] |
| 10696 | A 'logical truth' (or 'tautology', or 'theorem') follows from empty premises [Beall/Restall] |
| 13236 | Logical truth is much more important if mathematics rests on it, as logicism claims [Beall/Restall] |
| 10895 | 'Logically true' (|= φ) is true for every truth-assignment [Zalabardo] |
| 10900 | Logically true sentences are true in all structures [Zalabardo] |
| 10894 | A sentence-set is 'satisfiable' if at least one truth-assignment makes them all true [Zalabardo] |
| 10901 | Some formulas are 'satisfiable' if there is a structure and interpretation that makes them 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] |
| 10693 | Models are mathematical structures which interpret the non-logical primitives [Beall/Restall] |
| 13237 | Preface Paradox affirms and denies the conjunction of propositions in the book [Beall/Restall] |
| 10692 | Hilbert proofs have simple rules and complex axioms, and natural deduction is the opposite [Beall/Restall] |
| 10891 | If a set is defined by induction, then proof by induction can be applied to it [Zalabardo] |
| 13244 | Relevant necessity is always true for some situation (not all situations) [Beall/Restall] |
| 13239 | Judgement is always predicating a property of a subject [Beall/Restall] |
| 13248 | We can rest truth-conditions on situations, rather than on possible worlds [Beall/Restall] |
| 13233 | Propositions commit to content, and not to any way of spelling it out [Beall/Restall] |
| 3031 | The greatest good is not the achievement of desire, but to desire what is proper [Menedemus, by Diog. Laertius] |