44 ideas
| 9672 | Free logic is one of the few first-order non-classical logics [Priest,G] |
| Full Idea: Free logic is an unusual example of a non-classical logic which is first-order. | |
| From: Graham Priest (Intro to Non-Classical Logic (1st ed) [2001], Pref) |
| 9697 | X1 x X2 x X3... x Xn indicates the 'cartesian product' of those sets [Priest,G] |
| Full Idea: X1 x X2 x X3... x Xn indicates the 'cartesian product' of those sets, the set of all the n-tuples with its first member in X1, its second in X2, and so on. | |
| From: Graham Priest (Intro to Non-Classical Logic (1st ed) [2001], 0.1.0) |
| 9685 | <a,b&62; is a set whose members occur in the order shown [Priest,G] |
| Full Idea: <a,b> is a set whose members occur in the order shown; <x1,x2,x3, ..xn> is an 'n-tuple' ordered set. | |
| From: Graham Priest (Intro to Non-Classical Logic (1st ed) [2001], 0.1.10) |
| 9675 | a ∈ X says a is an object in set X; a ∉ X says a is not in X [Priest,G] |
| Full Idea: a ∈ X means that a is a member of the set X, that is, a is one of the objects in X. a ∉ X indicates that a is not in X. | |
| From: Graham Priest (Intro to Non-Classical Logic (1st ed) [2001], 0.1.2) |
| 9674 | {x; A(x)} is a set of objects satisfying the condition A(x) [Priest,G] |
| Full Idea: {x; A(x)} indicates a set of objects which satisfy the condition A(x). | |
| From: Graham Priest (Intro to Non-Classical Logic (1st ed) [2001], 0.1.2) |
| 9673 | {a1, a2, ...an} indicates that a set comprising just those objects [Priest,G] |
| Full Idea: {a1, a2, ...an} indicates that the set comprises of just those objects. | |
| From: Graham Priest (Intro to Non-Classical Logic (1st ed) [2001], 0.1.2) |
| 9677 | Φ indicates the empty set, which has no members [Priest,G] |
| Full Idea: Φ indicates the empty set, which has no members | |
| From: Graham Priest (Intro to Non-Classical Logic (1st ed) [2001], 0.1.4) |
| 9676 | {a} is the 'singleton' set of a (not the object a itself) [Priest,G] |
| Full Idea: {a} is the 'singleton' set of a, not to be confused with the object a itself. | |
| From: Graham Priest (Intro to Non-Classical Logic (1st ed) [2001], 0.1.4) |
| 9679 | X⊂Y means set X is a 'proper subset' of set Y [Priest,G] |
| Full Idea: X⊂Y means set X is a 'proper subset' of set Y (if and only if all of its members are members of Y, but some things in Y are not in X) | |
| From: Graham Priest (Intro to Non-Classical Logic (1st ed) [2001], 0.1.6) |
| 9678 | X⊆Y means set X is a 'subset' of set Y [Priest,G] |
| Full Idea: X⊆Y means set X is a 'subset' of set Y (if and only if all of its members are members of Y). | |
| From: Graham Priest (Intro to Non-Classical Logic (1st ed) [2001], 0.1.6) |
| 9681 | X = Y means the set X equals the set Y [Priest,G] |
| Full Idea: X = Y means the set X equals the set Y, which means they have the same members (i.e. X⊆Y and Y⊆X). | |
| From: Graham Priest (Intro to Non-Classical Logic (1st ed) [2001], 0.1.6) |
| 9683 | X ∩ Y indicates the 'intersection' of sets X and Y, the objects which are in both sets [Priest,G] |
| Full Idea: X ∩ Y indicates the 'intersection' of sets X and Y, which is a set containing just those things that are in both X and Y. | |
| From: Graham Priest (Intro to Non-Classical Logic (1st ed) [2001], 0.1.8) |
| 9682 | X∪Y indicates the 'union' of all the things in sets X and Y [Priest,G] |
| Full Idea: X ∪ Y indicates the 'union' of sets X and Y, which is a set containing just those things that are in X or Y (or both). | |
| From: Graham Priest (Intro to Non-Classical Logic (1st ed) [2001], 0.1.8) |
| 9684 | Y - X is the 'relative complement' of X with respect to Y; the things in Y that are not in X [Priest,G] |
| Full Idea: Y - X indicates the 'relative complement' of X with respect to Y, that is, all the things in Y that are not in X. | |
| From: Graham Priest (Intro to Non-Classical Logic (1st ed) [2001], 0.1.8) |
| 9694 | The 'relative complement' is things in the second set not in the first [Priest,G] |
| Full Idea: The 'relative complement' of one set with respect to another is the things in the second set that aren't in the first. | |
| From: Graham Priest (Intro to Non-Classical Logic (1st ed) [2001], 0.1.8) |
| 9693 | The 'intersection' of two sets is a set of the things that are in both sets [Priest,G] |
| Full Idea: The 'intersection' of two sets is a set containing the things that are in both sets. | |
| From: Graham Priest (Intro to Non-Classical Logic (1st ed) [2001], 0.1.8) |
| 9692 | The 'union' of two sets is a set containing all the things in either of the sets [Priest,G] |
| Full Idea: The 'union' of two sets is a set containing all the things in either of the sets | |
| From: Graham Priest (Intro to Non-Classical Logic (1st ed) [2001], 0.1.8) |
| 9698 | The 'induction clause' says complex formulas retain the properties of their basic formulas [Priest,G] |
| Full Idea: The 'induction clause' says that whenever one constructs more complex formulas out of formulas that have the property P, the resulting formulas will also have that property. | |
| From: Graham Priest (Intro to Non-Classical Logic (1st ed) [2001], 0.2) |
| 9688 | A 'singleton' is a set with only one member [Priest,G] |
| Full Idea: A 'singleton' is a set with only one member. | |
| From: Graham Priest (Intro to Non-Classical Logic (1st ed) [2001], 0.1.4) |
| 9687 | A 'member' of a set is one of the objects in the set [Priest,G] |
| Full Idea: A 'member' of a set is one of the objects in the set. | |
| From: Graham Priest (Intro to Non-Classical Logic (1st ed) [2001], 0.1.2) |
| 9695 | An 'ordered pair' (or ordered n-tuple) is a set with its members in a particular order [Priest,G] |
| Full Idea: An 'ordered pair' (or ordered n-tuple) is a set with its members in a particular order. | |
| From: Graham Priest (Intro to Non-Classical Logic (1st ed) [2001], 0.1.10) |
| 9696 | A 'cartesian product' of sets is the set of all the n-tuples with one member in each of the sets [Priest,G] |
| Full Idea: A 'cartesian product' of sets is the set of all the n-tuples with one member in each of the sets. | |
| From: Graham Priest (Intro to Non-Classical Logic (1st ed) [2001], 0.1.10) |
| 9686 | A 'set' is a collection of objects [Priest,G] |
| Full Idea: A 'set' is a collection of objects. | |
| From: Graham Priest (Intro to Non-Classical Logic (1st ed) [2001], 0.1.2) |
| 9689 | The 'empty set' or 'null set' has no members [Priest,G] |
| Full Idea: The 'empty set' or 'null set' is a set with no members. | |
| From: Graham Priest (Intro to Non-Classical Logic (1st ed) [2001], 0.1.4) |
| 9690 | A set is a 'subset' of another set if all of its members are in that set [Priest,G] |
| Full Idea: A set is a 'subset' of another set if all of its members are in that set. | |
| From: Graham Priest (Intro to Non-Classical Logic (1st ed) [2001], 0.1.6) |
| 9691 | A 'proper subset' is smaller than the containing set [Priest,G] |
| Full Idea: A set is a 'proper subset' of another set if some things in the large set are not in the smaller set | |
| From: Graham Priest (Intro to Non-Classical Logic (1st ed) [2001], 0.1.6) |
| 9680 | The empty set Φ is a subset of every set (including itself) [Priest,G] |
| Full Idea: The empty set Φ is a subset of every set (including itself). | |
| From: Graham Priest (Intro to Non-Classical Logic (1st ed) [2001], 0.1.6) |
| 10775 | The axiom of choice now seems acceptable and obvious (if it is meaningful) [Tharp] |
| Full Idea: The main objection to the axiom of choice was that it had to be given by some law or definition, but since sets are arbitrary this seems irrelevant. Formalists consider it meaningless, but set-theorists consider it as true, and practically obvious. | |
| From: Leslie H. Tharp (Which Logic is the Right Logic? [1975], §3) |
| 10766 | Logic is either for demonstration, or for characterizing structures [Tharp] |
| Full Idea: One can distinguish at least two quite different senses of logic: as an instrument of demonstration, and perhaps as an instrument for the characterization of structures. | |
| From: Leslie H. Tharp (Which Logic is the Right Logic? [1975], §2) | |
| A reaction: This is trying to capture the proof-theory and semantic aspects, but merely 'characterizing' something sounds like a rather feeble aspiration for the semantic side of things. Isn't it to do with truth, rather than just rule-following? |
| 10767 | Elementary logic is complete, but cannot capture mathematics [Tharp] |
| Full Idea: Elementary logic cannot characterize the usual mathematical structures, but seems to be distinguished by its completeness. | |
| From: Leslie H. Tharp (Which Logic is the Right Logic? [1975], §2) |
| 10769 | Second-order logic isn't provable, but will express set-theory and classic problems [Tharp] |
| Full Idea: The expressive power of second-order logic is too great to admit a proof procedure, but is adequate to express set-theoretical statements, and open questions such as the continuum hypothesis or the existence of big cardinals are easily stated. | |
| From: Leslie H. Tharp (Which Logic is the Right Logic? [1975], §2) |
| 10762 | In sentential logic there is a simple proof that all truth functions can be reduced to 'not' and 'and' [Tharp] |
| Full Idea: In sentential logic there is a simple proof that all truth functions, of any number of arguments, are definable from (say) 'not' and 'and'. | |
| From: Leslie H. Tharp (Which Logic is the Right Logic? [1975], §0) | |
| A reaction: The point of 'say' is that it can be got down to two connectives, and these are just the usual preferred pair. |
| 10776 | The main quantifiers extend 'and' and 'or' to infinite domains [Tharp] |
| Full Idea: The symbols ∀ and ∃ may, to start with, be regarded as extrapolations of the truth functional connectives ∧ ('and') and ∨ ('or') to infinite domains. | |
| From: Leslie H. Tharp (Which Logic is the Right Logic? [1975], §5) |
| 10774 | There are at least five unorthodox quantifiers that could be used [Tharp] |
| Full Idea: One might add to one's logic an 'uncountable quantifier', or a 'Chang quantifier', or a 'two-argument quantifier', or 'Shelah's quantifier', or 'branching quantifiers'. | |
| From: Leslie H. Tharp (Which Logic is the Right Logic? [1975], §3) | |
| A reaction: [compressed - just listed for reference, if you collect quantifiers, like collecting butterflies] |
| 10777 | Skolem mistakenly inferred that Cantor's conceptions were illusory [Tharp] |
| Full Idea: Skolem deduced from the Löwenheim-Skolem theorem that 'the absolutist conceptions of Cantor's theory' are 'illusory'. I think it is clear that this conclusion would not follow even if elementary logic were in some sense the true logic, as Skolem assumed. | |
| From: Leslie H. Tharp (Which Logic is the Right Logic? [1975], §7) | |
| A reaction: [Tharp cites Skolem 1962 p.47] Kit Fine refers to accepters of this scepticism about the arithmetic of infinities as 'Skolemites'. |
| 10773 | The Löwenheim-Skolem property is a limitation (e.g. can't say there are uncountably many reals) [Tharp] |
| Full Idea: The Löwenheim-Skolem property seems to be undesirable, in that it states a limitation concerning the distinctions the logic is capable of making, such as saying there are uncountably many reals ('Skolem's Paradox'). | |
| From: Leslie H. Tharp (Which Logic is the Right Logic? [1975], §2) |
| 10765 | Soundness would seem to be an essential requirement of a proof procedure [Tharp] |
| Full Idea: Soundness would seem to be an essential requirement of a proof procedure, since there is little point in proving formulas which may turn out to be false under some interpretation. | |
| From: Leslie H. Tharp (Which Logic is the Right Logic? [1975], §2) |
| 10763 | Completeness and compactness together give axiomatizability [Tharp] |
| Full Idea: Putting completeness and compactness together, one has axiomatizability. | |
| From: Leslie H. Tharp (Which Logic is the Right Logic? [1975], §1) |
| 10770 | If completeness fails there is no algorithm to list the valid formulas [Tharp] |
| Full Idea: In general, if completeness fails there is no algorithm to list the valid formulas. | |
| From: Leslie H. Tharp (Which Logic is the Right Logic? [1975], §2) | |
| A reaction: I.e. the theory is not effectively enumerable. |
| 10771 | Compactness is important for major theories which have infinitely many axioms [Tharp] |
| Full Idea: It is strange that compactness is often ignored in discussions of philosophy of logic, since the most important theories have infinitely many axioms. | |
| From: Leslie H. Tharp (Which Logic is the Right Logic? [1975], §2) | |
| A reaction: An example of infinite axioms is the induction schema in first-order Peano Arithmetic. |
| 10772 | Compactness blocks infinite expansion, and admits non-standard models [Tharp] |
| Full Idea: The compactness condition seems to state some weakness of the logic (as if it were futile to add infinitely many hypotheses). To look at it another way, formalizations of (say) arithmetic will admit of non-standard models. | |
| From: Leslie H. Tharp (Which Logic is the Right Logic? [1975], §2) |
| 10764 | A complete logic has an effective enumeration of the valid formulas [Tharp] |
| Full Idea: A complete logic has an effective enumeration of the valid formulas. | |
| From: Leslie H. Tharp (Which Logic is the Right Logic? [1975], §2) |
| 10768 | Effective enumeration might be proved but not specified, so it won't guarantee knowledge [Tharp] |
| Full Idea: Despite completeness, the mere existence of an effective enumeration of the valid formulas will not, by itself, provide knowledge. For example, one might be able to prove that there is an effective enumeration, without being able to specify one. | |
| From: Leslie H. Tharp (Which Logic is the Right Logic? [1975], §2) | |
| A reaction: The point is that completeness is supposed to ensure knowledge (of what is valid but unprovable), and completeness entails effective enumerability, but more than the latter is needed to do the key job. |
| 468 | Musical performance can reveal a range of virtues [Damon of Ath.] |
| Full Idea: In singing and playing the lyre, a boy will be likely to reveal not only courage and moderation, but also justice. | |
| From: Damon (fragments/reports [c.460 BCE], B4), quoted by (who?) - where? |