88 ideas
| 15357 | Philosophy is the most general intellectual discipline [Horsten] |
| 9123 | Someone standing in a doorway seems to be both in and not-in the room [Priest,G, by Sorensen] |
| 15352 | A definition should allow the defined term to be eliminated [Horsten] |
| 10882 | Predicative definitions only refer to entities outside the defined collection [Horsten] |
| 15324 | Semantic theories of truth seek models; axiomatic (syntactic) theories seek logical principles [Horsten] |
| 15323 | Truth is a property, because the truth predicate has an extension [Horsten] |
| 15374 | Truth has no 'nature', but we should try to describe its behaviour in inferences [Horsten] |
| 15348 | Propositions have sentence-like structures, so it matters little which bears the truth [Horsten] |
| 15333 | Modern correspondence is said to be with the facts, not with true propositions [Horsten] |
| 15337 | The correspondence 'theory' is too vague - about both 'correspondence' and 'facts' [Horsten] |
| 15334 | The coherence theory allows multiple coherent wholes, which could contradict one another [Horsten] |
| 15336 | The pragmatic theory of truth is relative; useful for group A can be useless for group B [Horsten] |
| 15354 | Tarski's hierarchy lacks uniform truth, and depends on contingent factors [Horsten] |
| 15340 | Tarski Bi-conditional: if you'll assert φ you'll assert φ-is-true - and also vice versa [Horsten] |
| 15345 | Semantic theories have a regress problem in describing truth in the languages for the models [Horsten] |
| 15373 | Axiomatic approaches avoid limiting definitions to avoid the truth predicate, and limited sizes of models [Horsten] |
| 15332 | 'Reflexive' truth theories allow iterations (it is T that it is T that p) [Horsten] |
| 15346 | Axiomatic approaches to truth avoid the regress problem of semantic theories [Horsten] |
| 15361 | A good theory of truth must be compositional (as well as deriving biconditionals) [Horsten] |
| 15371 | An axiomatic theory needs to be of maximal strength, while being natural and sound [Horsten] |
| 15350 | The Naďve Theory takes the bi-conditionals as axioms, but it is inconsistent, and allows the Liar [Horsten] |
| 15351 | Axiomatic theories take truth as primitive, and propose some laws of truth as axioms [Horsten] |
| 15367 | By adding truth to Peano Arithmetic we increase its power, so truth has mathematical content! [Horsten] |
| 15330 | Friedman-Sheard theory keeps classical logic and aims for maximum strength [Horsten] |
| 15331 | Kripke-Feferman has truth gaps, instead of classical logic, and aims for maximum strength [Horsten] |
| 15325 | Inferential deflationism says truth has no essence because no unrestricted logic governs the concept [Horsten] |
| 15344 | Deflationism skips definitions and models, and offers just accounts of basic laws of truth [Horsten] |
| 15356 | Deflationism concerns the nature and role of truth, but not its laws [Horsten] |
| 15368 | This deflationary account says truth has a role in generality, and in inference [Horsten] |
| 15358 | Deflationism says truth isn't a topic on its own - it just concerns what is true [Horsten] |
| 15359 | Deflation: instead of asserting a sentence, we can treat it as an object with the truth-property [Horsten] |
| 15329 | Nonclassical may accept T/F but deny applicability, or it may deny just T or F as well [Horsten] |
| 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] |
| 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] |
| 9675 | a ∈ X says a is an object in set X; a ∉ X says a is not in X [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] |
| 9678 | X⊆Y means set X is a 'subset' of set Y [Priest,G] |
| 9679 | X⊂Y means set X is a 'proper 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] |
| 9684 | Y - X is the 'relative complement' of X with respect to Y; the things in Y that are not in X [Priest,G] |
| 9682 | X∪Y indicates the 'union' of all the things in sets X and Y [Priest,G] |
| 9692 | The 'union' of two sets is a set containing all the things in either of the sets [Priest,G] |
| 9693 | The 'intersection' of two sets is a set of the things that are in both sets [Priest,G] |
| 9694 | The 'relative complement' is things in the second set not in the first [Priest,G] |
| 9698 | The 'induction clause' says complex formulas retain the properties of their basic formulas [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] |
| 9695 | An 'ordered pair' (or ordered n-tuple) is a set with its members in a particular order [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] |
| 9680 | The empty set Φ is a subset of every set (including itself) [Priest,G] |
| 15326 | Doubt is thrown on classical logic by the way it so easily produces the liar paradox [Horsten] |
| 15341 | Deduction Theorem: ψ only derivable from φ iff φ→ψ are axioms [Horsten] |
| 15328 | A theory is 'non-conservative' if it facilitates new mathematical proofs [Horsten] |
| 15349 | It is easier to imagine truth-value gaps (for the Liar, say) than for truth-value gluts (both T and F) [Horsten] |
| 15366 | Satisfaction is a primitive notion, and very liable to semantical paradoxes [Horsten] |
| 10884 | A theory is 'categorical' if it has just one model up to isomorphism [Horsten] |
| 15353 | The first incompleteness theorem means that consistency does not entail soundness [Horsten] |
| 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] |
| 13372 | There are Liar Pairs, and Liar Chains, which fit the same pattern as the basic Liar [Priest,G] |
| 13371 | If you know that a sentence is not one of the known sentences, you know its truth [Priest,G] |
| 15355 | Strengthened Liar: 'this sentence is not true in any context' - in no context can this be evaluated [Horsten] |
| 15364 | English expressions are denumerably infinite, but reals are nondenumerable, so many are unnameable [Horsten] |
| 10885 | Computer proofs don't provide explanations [Horsten] |
| 10881 | The concept of 'ordinal number' is set-theoretic, not arithmetical [Horsten] |
| 15360 | ZFC showed that the concept of set is mathematical, not logical, because of its existence claims [Horsten] |
| 15369 | Set theory is substantial over first-order arithmetic, because it enables new proofs [Horsten] |
| 15370 | Predicativism says mathematical definitions must not include the thing being defined [Horsten] |
| 15338 | We may believe in atomic facts, but surely not complex disjunctive ones? [Horsten] |
| 15362 | If 'Italy is large' lacks truth, so must 'Italy is not large'; but classical logic says it's large or it isn't [Horsten] |
| 15363 | In the supervaluationist account, disjunctions are not determined by their disjuncts [Horsten] |
| 15372 | Some claim that indicative conditionals are believed by people, even though they are not actually held true [Horsten] |
| 20653 | Six reduction levels: groups, lives, cells, molecules, atoms, particles [Putnam/Oppenheim, by Watson] |
| 15347 | A theory of syntax can be based on Peano arithmetic, thanks to the translation by Gödel coding [Horsten] |