59 ideas
| 9123 | Someone standing in a doorway seems to be both in and not-in the room [Priest,G, by Sorensen] |
| 18335 | There are five problems which the truth-maker theory might solve [Rami] |
| 18334 | The truth-maker idea is usually justified by its explanatory power, or intuitive appeal [Rami] |
| 18339 | The truth-making relation can be one-to-one, or many-to-many [Rami] |
| 18333 | Central idea: truths need truthmakers; and possibly all truths have them, and makers entail truths [Rami] |
| 18342 | Most theorists say that truth-makers necessitate their truths [Rami] |
| 18340 | It seems best to assume different kinds of truth-maker, such as objects, facts, tropes, or events [Rami] |
| 18341 | Truth-makers seem to be states of affairs (plus optional individuals), or individuals and properties [Rami] |
| 18346 | 'Truth supervenes on being' only gives necessary (not sufficient) conditions for contingent truths [Rami] |
| 18345 | 'Truth supervenes on being' avoids entities as truth-makers for negative truths [Rami] |
| 18343 | Maybe a truth-maker also works for the entailments of the given truth [Rami] |
| 18338 | Truth-making is usually internalist, but the correspondence theory is externalist [Rami] |
| 18337 | Correspondence theories assume that truth is a representation relation [Rami] |
| 18347 | Deflationist truth is an infinitely disjunctive property [Rami] |
| 18350 | Truth-maker theorists should probably reject the converse Barcan formula [Rami] |
| 8720 | A logic is 'relevant' if premise and conclusion are connected, and 'paraconsistent' allows contradictions [Priest,G, by Friend] |
| 9672 | Free logic is one of the few first-order non-classical logics [Priest,G] |
| 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] |
| 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] |
| 9688 | A 'singleton' is a set with only one member [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] |
| 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] |
| 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] |
| 13373 | Typically, paradoxes are dealt with by dividing them into two groups, but the division is wrong [Priest,G] |
| 13368 | The 'least indefinable ordinal' is defined by that very phrase [Priest,G] |
| 13370 | 'x is a natural number definable in less than 19 words' leads to contradiction [Priest,G] |
| 13369 | By diagonalization we can define a real number that isn't in the definable set of reals [Priest,G] |
| 13366 | The least ordinal greater than the set of all ordinals is both one of them and not one of them [Priest,G] |
| 13367 | The next set up in the hierarchy of sets seems to be both a member and not a member of it [Priest,G] |
| 13371 | If you know that a sentence is not one of the known sentences, you know its truth [Priest,G] |
| 13372 | There are Liar Pairs, and Liar Chains, which fit the same pattern as the basic Liar [Priest,G] |
| 18336 | Internal relations depend either on the existence of the relata, or on their properties [Rami] |
| 10938 | The extremes of essentialism are that all properties are essential, or only very trivial ones [Rami] |
| 10940 | An 'individual essence' is possessed uniquely by a particular object [Rami] |
| 10939 | 'Sortal essentialism' says being a particular kind is what is essential [Rami] |
| 10934 | Unlosable properties are not the same as essential properties [Rami] |
| 10933 | Physical possibility is part of metaphysical possibility which is part of logical possibility [Rami] |
| 10932 | If it is possible 'for all I know' then it is 'epistemically possible' [Rami] |
| 3032 | I can form no notion of what the good is [Amphis] |