67 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] |
17749 | Post proved the consistency of propositional logic in 1921 [Walicki] |
17765 | Propositional language can only relate statements as the same or as different [Walicki] |
17764 | Boolean connectives are interpreted as functions on the set {1,0} [Walicki] |
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] |
17752 | The empty set is useful for defining sets by properties, when the members are not yet known [Walicki] |
17753 | The empty set avoids having to take special precautions in case members vanish [Walicki] |
17759 | Ordinals play the central role in set theory, providing the model of well-ordering [Walicki] |
17741 | To determine the patterns in logic, one must identify its 'building blocks' [Walicki] |
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] |
17747 | A 'model' of a theory specifies interpreting a language in a domain to make all theorems true [Walicki] |
17748 | The L-S Theorem says no theory (even of reals) says more than a natural number theory [Walicki] |
17763 | Axiomatic systems are purely syntactic, and do not presuppose any interpretation [Walicki] |
17761 | A compact axiomatisation makes it possible to understand a field as a whole [Walicki] |
16342 | You cannot just say all of Peano arithmetic is true, as 'true' isn't part of the system [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] |
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] |
17757 | Members of ordinals are ordinals, and also subsets of ordinals [Walicki] |
17758 | Ordinals are transitive sets of transitive sets; or transitive sets totally ordered by inclusion [Walicki] |
17755 | Ordinals are the empty set, union with the singleton, and any arbitrary union of ordinals [Walicki] |
17756 | The union of finite ordinals is the first 'limit ordinal'; 2ω is the second... [Walicki] |
17760 | Two infinite ordinals can represent a single infinite cardinal [Walicki] |
17762 | In non-Euclidean geometry, all Euclidean theorems are valid that avoid the fifth postulate [Walicki] |
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] |
17754 | Inductive proof depends on the choice of the ordering [Walicki] |
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] |
12710 | As well as extension, bodies contain powers [Leibniz] |
17742 | Scotus based modality on semantic consistency, instead of on what the future could allow [Walicki] |
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] |