display all the ideas for this combination of texts
15 ideas
| 16294 | Axiomatic truth doesn't presuppose a truth-definition, though it could admit it at a later stage [Halbach] |
| Full Idea: Choosing an axiomatic approach to truth might well be compatible with the view that truth is definable; the definability of truth is just not presupposed at the outset. | |
| From: Volker Halbach (Axiomatic Theories of Truth [2011], 1) | |
| A reaction: Is it possible that a successful axiomatisation is a successful definition? |
| 16326 | The main semantic theories of truth are Kripke's theory, and revisions semantics [Halbach] |
| Full Idea: Revision semantics is arguably the main competitor of Kripke's theory of truth among semantic truth theories. …In the former one may hope through revision to arrive at better and better models, ..sorting out unsuitable extensions of the truth predicate. | |
| From: Volker Halbach (Axiomatic Theories of Truth [2011], 14) | |
| A reaction: Halbach notes later that Kripke's theory (believe it or not) is considerably simpler than revision semantics. |
| 16311 | To axiomatise Tarski's truth definition, we need a binary predicate for his 'satisfaction' [Halbach] |
| Full Idea: If the clauses of Tarski's definition of truth are turned into axioms (as Davidson proposed) then a primitive binary predicate symbol for satisfaction is needed, as Tarski defined truth in terms of satisfaction. Standard language has a unary predicate. | |
| From: Volker Halbach (Axiomatic Theories of Truth [2011], 5.2) |
| 16318 | Compositional Truth CT has the truth of a sentence depending of the semantic values of its constituents [Halbach] |
| Full Idea: In the typed Compositional Truth theory CT, it is compositional because the truth of a sentence depends on the semantic values of the constituents of that sentence. | |
| From: Volker Halbach (Axiomatic Theories of Truth [2011], 8) | |
| A reaction: [axioms on p. 65 of Halbach] |
| 16299 | Gödel numbering means a theory of truth can use Peano Arithmetic as its base theory [Halbach] |
| Full Idea: Often syntactic objects are identified with their numerical codes. …Expressions of a countable formal language can be coded in the natural numbers. This allows a theory of truth to use Peano Arithmetic (with its results) as a base theory. | |
| From: Volker Halbach (Axiomatic Theories of Truth [2011], 2) | |
| A reaction: The numbering system is the famous device invented by Gödel for his great proof of incompleteness. This idea is a key to understanding modern analytic philosophy. It is the bridge which means philosophical theories can be treated mathematically. |
| 16340 | Truth axioms need a base theory, because that is where truth issues arise [Halbach] |
| Full Idea: Considering the truth axioms in the absence of a base theory is not very sensible because characteristically truth theoretic reasoning arises from the interplay of the truth axioms with the base theory. | |
| From: Volker Halbach (Axiomatic Theories of Truth [2011], 21.2) | |
| A reaction: The base theory usually seems to be either Peano arithmetic or set theory. We might say that introverted thought (e.g. in infants) has little use for truth; it is when you think about the world that truth becomes a worry. |
| 16305 | We know a complete axiomatisation of truth is not feasible [Halbach] |
| Full Idea: In the light of incompleteness phenomena, one should not expect a categorical axiomatisation of truth to be feasible, but this should not keep one from studying axiomatic theories of truth (or of arithmetic). | |
| From: Volker Halbach (Axiomatic Theories of Truth [2011], 3) | |
| A reaction: This, of course, is because of Gödel's famous results. It is important to be aware in this field that there cannot be a dream of a final theory, so we are just seeing what can be learned about truth. |
| 16313 | A theory is 'conservative' if it adds no new theorems to its base theory [Halbach, by PG] |
| Full Idea: A truth theory is 'conservative' if the addition of the truth predicate does not add any new theorems to the base theory. | |
| From: report of Volker Halbach (Axiomatic Theories of Truth [2011], 6 Df 6.6) by PG - Db (ideas) | |
| A reaction: Halbach presents the definition more formally, and this is my attempt at getting it into plain English. Halbach uses Peano Arithmetic as his base theory, but set theory is also sometimes used. |
| 16315 | The Tarski Biconditional theory TB is Peano Arithmetic, plus truth, plus all Tarski bi-conditionals [Halbach] |
| Full Idea: The truth theory TB (Tarski Biconditional) is all the axioms of Peano Arithmetic, including all instances of the induction schema with the truth predicate, plus all the sentences of the form T[φ] ↔ φ. | |
| From: Volker Halbach (Axiomatic Theories of Truth [2011], 7) | |
| A reaction: The biconditional formula is the famous 'snow is white' iff snow is white. The truth of the named sentence is equivalent to asserting the sentence. This is a typed theory of truth, and it is conservative over PA. |
| 16314 | Theories of truth are 'typed' (truth can't apply to sentences containing 'true'), or 'type-free' [Halbach] |
| Full Idea: I sort theories of truth into the large families of 'typed' and 'type-free'. Roughly, typed theories prohibit a truth predicate's application to sentences with occurrences of that predicate, and one cannot prove the truth of sentences containing 'true'. | |
| From: Volker Halbach (Axiomatic Theories of Truth [2011], II Intro) | |
| A reaction: The problem sentence the typed theories are terrified of is the Liar Sentence. Typing produces a hierarchy of languages, referring down to the languages below them. |
| 16322 | CT proves PA consistent, which PA can't do on its own, so CT is not conservative over PA [Halbach] |
| Full Idea: Compositional Truth CT proves the consistency of Peano arithmetic, which is not provable in Peano arithmetic by Gödel's second incompleteness theorem. Hence the theory CT is not conservative over Peano arithmetic. | |
| From: Volker Halbach (Axiomatic Theories of Truth [2011], 8.6) |
| 16327 | Friedman-Sheard is type-free Compositional Truth, with two inference rules for truth [Halbach] |
| Full Idea: The Friedman-Sheard truth system FS is based on compositional theory CT. The axioms of FS are obtained by relaxing the type restriction on the CT-axioms, and adding rules inferring sentences from their truth, and vice versa. | |
| From: Volker Halbach (Axiomatic Theories of Truth [2011], 15) | |
| A reaction: The rules are called NEC and CONEC by Halbach. The system FSN is FS without the two rules. |
| 16329 | Kripke-Feferman theory KF axiomatises Kripke fixed-points, with Strong Kleene logic with gluts [Halbach] |
| Full Idea: The Kripke-Feferman theory KF is an axiomatisation of the fixed points of an operator, that is, of a Kripkean fixed-point semantics with the Strong Kleene evaluation schema with truth-value gluts. | |
| From: Volker Halbach (Axiomatic Theories of Truth [2011], 15.1) |
| 16331 | The KF is much stronger deductively than FS, which relies on classical truth [Halbach] |
| Full Idea: The Kripke-Feferman theory is relatively deductively very strong. In particular, it is much stronger than its competitor FS, which is based on a completely classical notion of truth. | |
| From: Volker Halbach (Axiomatic Theories of Truth [2011], 15.3) |
| 16332 | The KF theory is useful, but it is not a theory containing its own truth predicate [Halbach] |
| Full Idea: KF is useful for explicating Peano arithmetic, but it certainly does not come to close to being a theory that contains its own truth predicate. | |
| From: Volker Halbach (Axiomatic Theories of Truth [2011], 16) | |
| A reaction: Since it is a type-free theory, its main philosophical aspiration was to contain its own truth predicate, so that is bad news (for philosophers). |