62 ideas
11223 | Definitions usually have a term, a 'definiendum' containing the term, and a defining 'definiens' [Gupta] |
11215 | Notable definitions have been of piety (Plato), God (Anselm), number (Frege), and truth (Tarski) [Gupta] |
11225 | A definition needs to apply to the same object across possible worlds [Gupta] |
11227 | The 'revision theory' says that definitions are rules for improving output [Gupta] |
11221 | A definition can be 'extensionally', 'intensionally' or 'sense' adequate [Gupta] |
11224 | Traditional definitions are general identities, which are sentential and reductive [Gupta] |
11226 | Traditional definitions need: same category, mention of the term, and conservativeness and eliminability [Gupta] |
11217 | Chemists aim at real definition of things; lexicographers aim at nominal definition of usage [Gupta] |
11216 | If definitions aim at different ideals, then defining essence is not a unitary activity [Gupta] |
11218 | Stipulative definition assigns meaning to a term, ignoring prior meanings [Gupta] |
11220 | Ostensive definitions look simple, but are complex and barely explicable [Gupta] |
13252 | Some truths have true negations [Beall/Restall] |
13247 | A truthmaker is an object which entails a sentence [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] |
13245 | Relevant consequence says invalidity is the conclusion not being 'in' the premises [Beall/Restall] |
13246 | Relevant logic does not abandon classical logic [Beall/Restall] |
13254 | A doesn't imply A - that would be circular [Beall/Restall] |
13255 | Relevant logic may reject transitivity [Beall/Restall] |
9672 | Free logic is one of the few first-order non-classical logics [Priest,G] |
13250 | Free logic terms aren't existential; classical is non-empty, with referring names [Beall/Restall] |
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] |
9688 | A 'singleton' is a set with only one member [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] |
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] |
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] |
9687 | A 'member' of a set is one of the objects in the set [Priest,G] |
9680 | The empty set Φ is a subset of every set (including itself) [Priest,G] |
11222 | The ordered pair <x,y> is defined as the set {{x},{x,y}}, capturing function, not meaning [Gupta] |
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] |
13232 | Logic studies arguments, not formal languages; this involves interpretations [Beall/Restall] |
13241 | The model theory of classical predicate logic is mathematics [Beall/Restall] |
13253 | There are several different consequence relations [Beall/Restall] |
13240 | A sentence follows from others if they always model it [Beall/Restall] |
13236 | Logical truth is much more important if mathematics rests on it, as logicism claims [Beall/Restall] |
13237 | Preface Paradox affirms and denies the conjunction of propositions in the book [Beall/Restall] |
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] |