36 ideas
| 5750 | Consistency is modal, saying propositions are consistent if they could be true together [Melia] |
| 5737 | Predicate logic has connectives, quantifiers, variables, predicates, equality, names and brackets [Melia] |
| 5744 | First-order predicate calculus is extensional logic, but quantified modal logic is intensional (hence dubious) [Melia] |
| 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] |
| 10897 | A first-order 'sentence' is a formula with no free variables [Zalabardo] |
| 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] |
| 10896 | Propositional logic just needs ¬, and one of ∧, ∨ and → [Zalabardo] |
| 5740 | Second-order logic needs second-order variables and quantification into predicate position [Melia] |
| 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] |
| 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] |
| 5741 | If every model that makes premises true also makes conclusion true, the argument is valid [Melia] |
| 10891 | If a set is defined by induction, then proof by induction can be applied to it [Zalabardo] |
| 5735 | Maybe names and predicates can capture any fact [Melia] |
| 5736 | No sort of plain language or levels of logic can express modal facts properly [Melia] |
| 5746 | The Identity of Indiscernibles is contentious for qualities, and trivial for non-qualities [Melia] |
| 5738 | We may be sure that P is necessary, but is it necessarily necessary? [Melia] |
| 5732 | 'De re' modality is about things themselves, 'de dicto' modality is about propositions [Melia] |
| 5739 | Sometimes we want to specify in what ways a thing is possible [Melia] |
| 5734 | Possible worlds make it possible to define necessity and counterfactuals without new primitives [Melia] |
| 5742 | In possible worlds semantics the modal operators are treated as quantifiers [Melia] |
| 5743 | If possible worlds semantics is not realist about possible worlds, logic becomes merely formal [Melia] |
| 5749 | Possible worlds could be real as mathematics, propositions, properties, or like books [Melia] |
| 5751 | The truth of propositions at possible worlds are implied by the world, just as in books [Melia] |
| 5748 | We accept unverifiable propositions because of simplicity, utility, explanation and plausibility [Melia] |
| 6005 | Animals are dangerous and nourishing, and can't form contracts of justice [Hermarchus, by Sedley] |