75 ideas
| 16325 | Analysis rests on natural language, but its ideal is a framework which revises language [Halbach] |
| 16292 | An explicit definition enables the elimination of what is defined [Halbach] |
| 16307 | Don't trust analogies; they are no more than a guideline [Halbach] |
| 16339 | Truth axioms prove objects exist, so truth doesn't seem to be a logical notion [Halbach] |
| 16330 | Truth-value 'gluts' allow two truth values together; 'gaps' give a partial conception of truth [Halbach] |
| 16324 | Any definition of truth requires a metalanguage [Halbach] |
| 16293 | Traditional definitions of truth often make it more obscure, rather than less [Halbach] |
| 16301 | If people have big doubts about truth, a definition might give it more credibility [Halbach] |
| 16297 | Semantic theories avoid Tarski's Theorem by sticking to a sublanguage [Halbach] |
| 16337 | Disquotational truth theories are short of deductive power [Halbach] |
| 16294 | Axiomatic truth doesn't presuppose a truth-definition, though it could admit it at a later stage [Halbach] |
| 16311 | To axiomatise Tarski's truth definition, we need a binary predicate for his 'satisfaction' [Halbach] |
| 16318 | Compositional Truth CT has the truth of a sentence depending of the semantic values of its constituents [Halbach] |
| 16326 | The main semantic theories of truth are Kripke's theory, and revisions semantics [Halbach] |
| 16299 | Gödel numbering means a theory of truth can use Peano Arithmetic as its base theory [Halbach] |
| 16340 | Truth axioms need a base theory, because that is where truth issues arise [Halbach] |
| 16322 | CT proves PA consistent, which PA can't do on its own, so CT is not conservative over PA [Halbach] |
| 16305 | We know a complete axiomatisation of truth is not feasible [Halbach] |
| 16313 | A theory is 'conservative' if it adds no new theorems to its base theory [Halbach, by PG] |
| 16315 | The Tarski Biconditional theory TB is Peano Arithmetic, plus truth, plus all Tarski bi-conditionals [Halbach] |
| 16314 | Theories of truth are 'typed' (truth can't apply to sentences containing 'true'), or 'type-free' [Halbach] |
| 16327 | Friedman-Sheard is type-free Compositional Truth, with two inference rules for truth [Halbach] |
| 16332 | The KF theory is useful, but it is not a theory containing its own truth predicate [Halbach] |
| 16329 | Kripke-Feferman theory KF axiomatises Kripke fixed-points, with Strong Kleene logic with gluts [Halbach] |
| 16331 | The KF is much stronger deductively than FS, which relies on classical truth [Halbach] |
| 16338 | Deflationism says truth is a disquotation device to express generalisations, adding no new knowledge [Halbach] |
| 16317 | The main problem for deflationists is they can express generalisations, but not prove them [Halbach] |
| 16316 | Deflationists say truth is just for expressing infinite conjunctions or generalisations [Halbach] |
| 16319 | Compositional Truth CT proves generalisations, so is preferred in discussions of deflationism [Halbach] |
| 16320 | Some say deflationism is axioms which are conservative over the base theory [Halbach] |
| 16335 | In Strong Kleene logic a disjunction just needs one disjunct to be true [Halbach] |
| 16334 | In Weak Kleene logic there are 'gaps', neither true nor false if one component lacks a truth value [Halbach] |
| 9672 | Free logic is one of the few first-order non-classical logics [Priest,G] |
| 16309 | Every attempt at formal rigour uses some set theory [Halbach] |
| 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] |
| 16333 | The underestimated costs of giving up classical logic are found in mathematical reasoning [Halbach] |
| 16310 | A theory is some formulae and all of their consequences [Halbach] |
| 16341 | Normally we only endorse a theory if we believe it to be sound [Halbach] |
| 16344 | Soundness must involve truth; the soundness of PA certainly needs it [Halbach] |
| 16342 | You cannot just say all of Peano arithmetic is true, as 'true' isn't part of the system [Halbach] |
| 16347 | Many new paradoxes may await us when we study interactions between frameworks [Halbach] |
| 16336 | The liar paradox applies truth to a negated truth (but the conditional will serve equally) [Halbach] |
| 16321 | The compactness theorem can prove nonstandard models of PA [Halbach] |
| 16343 | The global reflection principle seems to express the soundness of Peano Arithmetic [Halbach] |
| 16312 | To reduce PA to ZF, we represent the non-negative integers with von Neumann ordinals [Halbach] |
| 16308 | Set theory was liberated early from types, and recent truth-theories are exploring type-free [Halbach] |
| 16345 | That Peano arithmetic is interpretable in ZF set theory is taken by philosophers as a reduction [Halbach] |
| 16346 | Maybe necessity is a predicate, not the usual operator, to make it more like truth [Halbach] |
| 17503 | Theories can never represent accurately, because their components are abstract [Cartwright,N, by Portides] |
| 16298 | We need propositions to ascribe the same beliefs to people with different languages [Halbach] |