68 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] |
| 16309 | Every attempt at formal rigour uses some set theory [Halbach] |
| 10859 | A set is 'well-ordered' if every subset has a first element [Clegg] |
| 10857 | Set theory made a closer study of infinity possible [Clegg] |
| 10864 | Any set can always generate a larger set - its powerset, of subsets [Clegg] |
| 10872 | Extensionality: Two sets are equal if and only if they have the same elements [Clegg] |
| 10875 | Pairing: For any two sets there exists a set to which they both belong [Clegg] |
| 10876 | Unions: There is a set of all the elements which belong to at least one set in a collection [Clegg] |
| 10878 | Infinity: There exists a set of the empty set and the successor of each element [Clegg] |
| 10877 | Powers: All the subsets of a given set form their own new powerset [Clegg] |
| 10879 | Choice: For every set a mechanism will choose one member of any non-empty subset [Clegg] |
| 10871 | Axiom of Existence: there exists at least one set [Clegg] |
| 10874 | Specification: a condition applied to a set will always produce a new set [Clegg] |
| 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] |
| 10880 | Mathematics can be 'pure' (unapplied), 'real' (physically grounded); or 'applied' (just applicable) [Clegg] |
| 10860 | An ordinal number is defined by the set that comes before it [Clegg] |
| 10861 | Beyond infinity cardinals and ordinals can come apart [Clegg] |
| 10854 | Transcendental numbers can't be fitted to finite equations [Clegg] |
| 10858 | By adding an axis of imaginary numbers, we get the useful 'number plane' instead of number line [Clegg] |
| 10853 | Either lack of zero made early mathematics geometrical, or the geometrical approach made zero meaningless [Clegg] |
| 10866 | Cantor's account of infinities has the shaky foundation of irrational numbers [Clegg] |
| 10869 | The Continuum Hypothesis is independent of the axioms of set theory [Clegg] |
| 10862 | The 'continuum hypothesis' says aleph-one is the cardinality of the reals [Clegg] |
| 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] |
| 16298 | We need propositions to ascribe the same beliefs to people with different languages [Halbach] |
| 5655 | Happiness is not satisfaction of desires, but fulfilment of values [Bradley, by Scruton] |