103 ideas
| 16325 | Analysis rests on natural language, but its ideal is a framework which revises language [Halbach] |
| Full Idea: For me, although the enterprise of philosophical analysis is driven by natural language, its goal is not a linguistic analysis of English but rather an expressively strong framework that may at best be seen as a revision of English. | |
| From: Volker Halbach (Axiomatic Theories of Truth [2011], 12) | |
| A reaction: I agree, but the problem is that there are different ideals for the revision, which may be in conflict. Logicians, mathematicians, metaphysicians, scientists, moralists and aestheticians are queueing up to improve in their own way. |
| 16292 | An explicit definition enables the elimination of what is defined [Halbach] |
| Full Idea: Explicit definitions allow for a complete elimination of the defined notion (at least in extensional contexts). | |
| From: Volker Halbach (Axiomatic Theories of Truth [2011], 1) | |
| A reaction: If the context isn't extensional (concerning the things themselves) then we could define one description of it, but be unable to eliminate it under another description. Elimination is no the aim of an Aristotelian definition. Halbach refers to truth. |
| 16307 | Don't trust analogies; they are no more than a guideline [Halbach] |
| Full Idea: Arguments from analogy are to be distrusted: at best they can serve as heuristics. | |
| From: Volker Halbach (Axiomatic Theories of Truth [2011], 4) |
| 16330 | Truth-value 'gluts' allow two truth values together; 'gaps' give a partial conception of truth [Halbach] |
| Full Idea: Truth-value 'gluts' correspond to a so-called dialethic conception of truth; excluding gluts and admitting only 'gaps' leads to a conception of what is usually called 'partial' truth. | |
| From: Volker Halbach (Axiomatic Theories of Truth [2011], 15.2) | |
| A reaction: Talk of 'gaps' and 'gluts' seem to be the neatest way of categorising views of truth. I want a theory with no gaps or gluts. |
| 16339 | Truth axioms prove objects exist, so truth doesn't seem to be a logical notion [Halbach] |
| Full Idea: Two typed disquotation sentences, truth axioms of TB, suffice for proving that there at least two objects. Hence truth is not a logical notion if one expects logical notions to be ontologically neutral. | |
| From: Volker Halbach (Axiomatic Theories of Truth [2011], 21.2) |
| 16324 | Any definition of truth requires a metalanguage [Halbach] |
| Full Idea: It is plain that the distinction between object and metalanguage is required for the definability of truth. | |
| From: Volker Halbach (Axiomatic Theories of Truth [2011], 11) | |
| A reaction: Halbach's axiomatic approach has given up on definability, and therefore it can seek to abandon the metalanguage and examine 'type-free' theories. |
| 15647 | Truth definitions don't produce a good theory, because they go beyond your current language [Halbach] |
| Full Idea: It is far from clear that a definition of truth can lead to a philosophically satisfactory theory of truth. Tarski's theorem on the undefinability of the truth predicate needs resources beyond those of the language for which it is being defined. | |
| From: Volker Halbach (Axiomatic Theories of Truth (2005 ver) [2005], 1) | |
| A reaction: The idea is that you need a 'metalanguage' for the definition. If I say 'p' is a true sentence in language 'L', I am not making that observation from within language L. The dream is a theory confined to the object language. |
| 16293 | Traditional definitions of truth often make it more obscure, rather than less [Halbach] |
| Full Idea: A common complaint against traditional definitional theories of truth is that it is far from clear that the definiens is not more in need of clarification than the definiendum (that is, the notion of truth). | |
| From: Volker Halbach (Axiomatic Theories of Truth [2011], 1) | |
| A reaction: He refers to concepts like 'correspondence', 'facts', 'coherence' or 'utility', which are said to be trickier to understand than 'true'. I suspect that philosophers like Halbach confuse 'clear' with 'precise'. Coherence is quite clear, but imprecise. |
| 16301 | If people have big doubts about truth, a definition might give it more credibility [Halbach] |
| Full Idea: If one were wondering whether truth should be considered a legitimate notion at all, a definition might be useful in dispersing doubts about its legitimacy. | |
| From: Volker Halbach (Axiomatic Theories of Truth [2011], 3) | |
| A reaction: Halbach is proposing to skip definitions, and try to give rules for using 'true' instead, but he doesn't rule out definitions. A definition of 'knowledge' or 'virtue' or 'democracy' might equally give those credibility. |
| 15649 | In semantic theories of truth, the predicate is in an object-language, and the definition in a metalanguage [Halbach] |
| Full Idea: In semantic theories of truth (Tarski or Kripke), a truth predicate is defined for an object-language. This definition is carried out in a metalanguage, which is typically taken to include set theory or another strong theory or expressive language. | |
| From: Volker Halbach (Axiomatic Theories of Truth (2005 ver) [2005], 1) | |
| A reaction: Presumably the metalanguage includes set theory because that connects it with mathematics, and enables it to be formally rigorous. Tarski showed, in his undefinability theorem, that the meta-language must have increased resources. |
| 16297 | Semantic theories avoid Tarski's Theorem by sticking to a sublanguage [Halbach] |
| Full Idea: In semantic theories (e.g.Tarski's or Kripke's), a definition evades Tarski's Theorem by restricting the possible instances in the schema T[φ]↔φ to sentences of a proper sublanguage of the language formulating the equivalences. | |
| From: Volker Halbach (Axiomatic Theories of Truth [2011], 1) | |
| A reaction: The schema says if it's true it's affirmable, and if it's affirmable it's true. The Liar Paradox is a key reason for imposing this restriction. |
| 16337 | Disquotational truth theories are short of deductive power [Halbach] |
| Full Idea: The problem of restricted deductive power has haunted disquotational theories of truth (…because they can't prove generalisations). | |
| From: Volker Halbach (Axiomatic Theories of Truth [2011], 19.5) |
| 15650 | Axiomatic theories of truth need a weak logical framework, and not a strong metatheory [Halbach] |
| Full Idea: Axiomatic theories of truth can be presented within very weak logical frameworks which require very few resources, and avoid the need for a strong metalanguage and metatheory. | |
| From: Volker Halbach (Axiomatic Theories of Truth (2005 ver) [2005], 1) |
| 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) |
| 15655 | Should axiomatic truth be 'conservative' - not proving anything apart from implications of the axioms? [Halbach] |
| Full Idea: If truth is not explanatory, truth axioms should not allow proof of new theorems not involving the truth predicate. It is hence said that axiomatic truth should be 'conservative' - not implying further sentences beyond what the axioms can prove. | |
| From: Volker Halbach (Axiomatic Theories of Truth (2005 ver) [2005], 1.3) | |
| A reaction: [compressed] |
| 15654 | If truth is defined it can be eliminated, whereas axiomatic truth has various commitments [Halbach] |
| Full Idea: If truth can be explicitly defined, it can be eliminated, whereas an axiomatized notion of truth may bring all kinds of commitments. | |
| From: Volker Halbach (Axiomatic Theories of Truth (2005 ver) [2005], 1.3) | |
| A reaction: The general principle that anything which can be defined can be eliminated (in an abstract theory, presumably, not in nature!) raises interesting questions about how many true theories there are which are all equivalent to one another. |
| 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. |
| 15648 | Instead of a truth definition, add a primitive truth predicate, and axioms for how it works [Halbach] |
| Full Idea: The axiomatic approach does not presuppose that truth can be defined. Instead, a formal language is expanded by a new primitive predicate of truth, and axioms for that predicate are then laid down. | |
| From: Volker Halbach (Axiomatic Theories of Truth (2005 ver) [2005], 1) | |
| A reaction: Idea 15647 explains why Halbach thinks the definition route is no good. |
| 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). |
| 16320 | Some say deflationism is axioms which are conservative over the base theory [Halbach] |
| Full Idea: Some authors have tried to understand the deflationist claim that truth is not a substantial notion as the claim that a satisfactory axiomatisation of truth should be conservative over the base theory. | |
| From: Volker Halbach (Axiomatic Theories of Truth [2011], 8) |
| 15656 | Deflationists say truth merely serves to express infinite conjunctions [Halbach] |
| Full Idea: According to many deflationists, truth serves merely the purpose of expressing infinite conjunctions. | |
| From: Volker Halbach (Axiomatic Theories of Truth (2005 ver) [2005], 1.3) | |
| A reaction: That is, it asserts sentences that are too numerous to express individually. It also seems, on a deflationist view, to serve for anaphoric reference to sentences, such as 'what she just said is true'. |
| 16338 | Deflationism says truth is a disquotation device to express generalisations, adding no new knowledge [Halbach] |
| Full Idea: There are two doctrines at the core of deflationism. The first says truth is a device of disquotation used to express generalisations, and the second says truth is a thin notion that contributes nothing to our knowledge of the world | |
| From: Volker Halbach (Axiomatic Theories of Truth [2011], 21) |
| 16317 | The main problem for deflationists is they can express generalisations, but not prove them [Halbach] |
| Full Idea: The main criticism that deflationist theories based on the disquotation sentences or similar axioms have to meet was raised by Tarski: the disquotation sentences do not allow one to prove generalisations. | |
| From: Volker Halbach (Axiomatic Theories of Truth [2011], 7) |
| 16316 | Deflationists say truth is just for expressing infinite conjunctions or generalisations [Halbach] |
| Full Idea: Deflationists do not hold that truth is completely dispensable. They claim that truth serves the purpose of expressing infinite conjunctions or generalisations. | |
| From: Volker Halbach (Axiomatic Theories of Truth [2011], 7) | |
| A reaction: It is also of obvious value as a shorthand in ordinary conversation, but rigorous accounts can paraphrase that out. 'What he said is true'. 'Pick out the true sentences from p,q,r and s' seems to mean 'affirm some of them'. What does 'affirm' mean? |
| 16319 | Compositional Truth CT proves generalisations, so is preferred in discussions of deflationism [Halbach] |
| Full Idea: Compositional Truth CT and its variants has desirable generalisations among its logical consequences, so they seem to have ousted purely disquotational theories such as TB in the discussion on deflationism. | |
| From: Volker Halbach (Axiomatic Theories of Truth [2011], 8) |
| 16335 | In Strong Kleene logic a disjunction just needs one disjunct to be true [Halbach] |
| Full Idea: In Strong Kleene logic a disjunction of two sentences is true if at least one disjunct is true, even when the other disjunct lacks a truth value. | |
| From: Volker Halbach (Axiomatic Theories of Truth [2011], 18) | |
| A reaction: This sounds fine to me. 'Either I'm typing this or Homer had blue eyes' comes out true in any sensible system. |
| 16334 | In Weak Kleene logic there are 'gaps', neither true nor false if one component lacks a truth value [Halbach] |
| Full Idea: In Weak Kleene Logic, with truth-value gaps, a sentence is neither true nor false if one of its components lacks a truth value. A line of the truth table shows a gap if there is a gap anywhere in the line, and the other lines are classical. | |
| From: Volker Halbach (Axiomatic Theories of Truth [2011], 18) | |
| A reaction: This will presumably apply even if the connective is 'or', so a disjunction won't be true, even if one disjunct is true, when the other disjunct is unknown. 'Either 2+2=4 or Lot's wife was left-handed' sounds true to me. Odd. |
| 15657 | To prove the consistency of set theory, we must go beyond set theory [Halbach] |
| Full Idea: The consistency of set theory cannot be established without assumptions transcending set theory. | |
| From: Volker Halbach (Axiomatic Theories of Truth (2005 ver) [2005], 2.1) |
| 16309 | Every attempt at formal rigour uses some set theory [Halbach] |
| Full Idea: Almost any subject with any formal rigour employs some set theory. | |
| From: Volker Halbach (Axiomatic Theories of Truth [2011], 4.1) | |
| A reaction: This is partly because mathematics is often seen as founded in set theory, and formal rigour tends to be mathematical in character. |
| 10073 | There cannot be a set theory which is complete [Smith,P] |
| Full Idea: By Gödel's First Incompleteness Theorem, there cannot be a negation-complete set theory. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 01.3) | |
| A reaction: This means that we can never prove all the truths of a system of set theory. |
| 16333 | The underestimated costs of giving up classical logic are found in mathematical reasoning [Halbach] |
| Full Idea: The costs of giving up classical logic are easily underestimated, …the price being paid in terms of mathematical reasoning. | |
| From: Volker Halbach (Axiomatic Theories of Truth [2011], 16.2) | |
| A reaction: No one cares much about such costs, until you say they are 'mathematical'. Presumably this is a message to Graham Priest and his pals. |
| 10616 | Second-order arithmetic can prove new sentences of first-order [Smith,P] |
| Full Idea: Going second-order in arithmetic enables us to prove new first-order arithmetical sentences that we couldn't prove before. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 23.4) | |
| A reaction: The wages of Satan, perhaps. We can prove things about objects by proving things about their properties and sets and functions. Smith says this fact goes all the way up the hierarchy. |
| 15652 | We can use truth instead of ontologically loaded second-order comprehension assumptions about properties [Halbach] |
| Full Idea: The reduction of 2nd-order theories (of properties or sets) to axiomatic theories of truth may be conceived as a form of reductive nominalism, replacing existence assumptions (for comprehension axioms) by ontologically innocent truth assumptions. | |
| From: Volker Halbach (Axiomatic Theories of Truth (2005 ver) [2005], 1.1) | |
| A reaction: I like this very much, as weeding properties out of logic (without weeding them out of the world). So-called properties in logic are too abundant, so there is a misfit with their role in science. |
| 10075 | A 'partial function' maps only some elements to another set [Smith,P] |
| Full Idea: A 'partial function' is one which maps only some elements of a domain to elements in another set. For example, the reciprocal function 1/x is not defined for x=0. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 02.1 n1) |
| 10074 | A 'total function' maps every element to one element in another set [Smith,P] |
| Full Idea: A 'total function' is one which maps every element of a domain to exactly one corresponding value in another set. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 02.1) |
| 10612 | An argument is a 'fixed point' for a function if it is mapped back to itself [Smith,P] |
| Full Idea: If a function f maps the argument a back to a itself, so that f(a) = a, then a is said to be a 'fixed point' for f. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 20.5) |
| 10076 | The 'range' of a function is the set of elements in the output set created by the function [Smith,P] |
| Full Idea: The 'range' of a function is the set of elements in the output set that are values of the function for elements in the original set. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 02.1) | |
| A reaction: In other words, the range is the set of values that were created by the function. |
| 10605 | Two functions are the same if they have the same extension [Smith,P] |
| Full Idea: We count two functions as being the same if they have the same extension, i.e. if they pair up arguments with values in the same way. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 11.3) | |
| A reaction: So there's only one way to skin a cat in mathematical logic. |
| 10615 | The Comprehension Schema says there is a property only had by things satisfying a condition [Smith,P] |
| Full Idea: The so-called Comprehension Schema ∃X∀x(Xx ↔ φ(x)) says that there is a property which is had by just those things which satisfy the condition φ. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 22.3) |
| 15651 | Instead of saying x has a property, we can say a formula is true of x - as long as we have 'true' [Halbach] |
| Full Idea: Quantification over (certain) properties can be mimicked in a language with a truth predicate by quantifying over formulas. Instead of saying that Tom has the property of being a poor philosopher, we can say 'x is a poor philosopher' is true of Tom. | |
| From: Volker Halbach (Axiomatic Theories of Truth (2005 ver) [2005], 1.1) | |
| A reaction: I love this, and think it is very important. He talks of 'mimicking' properties, but I see it as philosophers mistakenly attributing properties, when actually what they were doing is asserting truths involving certain predicates. |
| 10595 | A 'theorem' of a theory is a sentence derived from the axioms using the proof system [Smith,P] |
| Full Idea: 'Theorem': given a derivation of the sentence φ from the axioms of the theory T using the background logical proof system, we will say that φ is a 'theorem' of the theory. Standard abbreviation is T |- φ. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 03.4) |
| 16310 | A theory is some formulae and all of their consequences [Halbach] |
| Full Idea: A theory is a set of formulae closed under first-order logical consequence. | |
| From: Volker Halbach (Axiomatic Theories of Truth [2011], 5.1) |
| 10602 | A 'natural deduction system' has no axioms but many rules [Smith,P] |
| Full Idea: A 'natural deduction system' will have no logical axioms but may rules of inference. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 09.1) | |
| A reaction: He contrasts this with 'Hilbert-style systems', which have many axioms but few rules. Natural deduction uses many assumptions which are then discharged, and so tree-systems are good for representing it. |
| 10613 | No nice theory can define truth for its own language [Smith,P] |
| Full Idea: No nice theory can define truth for its own language. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 21.5) | |
| A reaction: This leads on to Tarski's account of truth. |
| 10078 | An 'injective' ('one-to-one') function creates a distinct output element from each original [Smith,P] |
| Full Idea: An 'injective' function is 'one-to-one' - each element of the output set results from a different element of the original set. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 02.1) | |
| A reaction: That is, two different original elements cannot lead to the same output element. |
| 10077 | A 'surjective' ('onto') function creates every element of the output set [Smith,P] |
| Full Idea: A 'surjective' function is 'onto' - the whole of the output set results from the function being applied to elements of the original set. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 02.1) |
| 10079 | A 'bijective' function has one-to-one correspondence in both directions [Smith,P] |
| Full Idea: A 'bijective' function has 'one-to-one correspondence' - it is both surjective and injective, so that every element in each of the original and the output sets has a matching element in the other. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 02.1) | |
| A reaction: Note that 'injective' is also one-to-one, but only in the one direction. |
| 10070 | If everything that a theory proves is true, then it is 'sound' [Smith,P] |
| Full Idea: If everything that a theory proves must be true, then it is a 'sound' theory. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 01.1) |
| 10086 | Soundness is true axioms and a truth-preserving proof system [Smith,P] |
| Full Idea: Soundness is normally a matter of having true axioms and a truth-preserving proof system. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 03.4) | |
| A reaction: The only exception I can think of is if a theory consisted of nothing but the axioms. |
| 10596 | A theory is 'sound' iff every theorem is true (usually from true axioms and truth-preservation) [Smith,P] |
| Full Idea: A theory is 'sound' iff every theorem of it is true (i.e. true on the interpretation built into its language). Soundness is normally a matter of having true axioms and a truth-preserving proof system. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 03.4) |
| 16342 | You cannot just say all of Peano arithmetic is true, as 'true' isn't part of the system [Halbach] |
| Full Idea: One cannot just accept that all the theorems of Peano arithmetic are true when one accepts Peano arithmetic as the notion of truth is not available in the language of arithmetic. | |
| From: Volker Halbach (Axiomatic Theories of Truth [2011], 22.1) | |
| A reaction: This is given as the reason why Kreisel and Levy (1968) introduced 'reflection principles', which allow you to assert whatever has been proved (with no mention of truth). (I think. The waters are closing over my head). |
| 16341 | Normally we only endorse a theory if we believe it to be sound [Halbach] |
| Full Idea: If one endorses a theory, so one might argue, one should also take it to be sound. | |
| From: Volker Halbach (Axiomatic Theories of Truth [2011], 22.1) |
| 16344 | Soundness must involve truth; the soundness of PA certainly needs it [Halbach] |
| Full Idea: Soundness seems to be a notion essentially involving truth. At least I do not know how to fully express the soundness of Peano arithmetic without invoking a truth predicate. | |
| From: Volker Halbach (Axiomatic Theories of Truth [2011], 22.1) | |
| A reaction: I suppose you could use some alternative locution such as 'assertible' or 'cuddly'. Intuitionists seem a bit vague about the truth end of things. |
| 10598 | A theory is 'negation complete' if it proves all sentences or their negation [Smith,P] |
| Full Idea: A theory is 'negation complete' if it decides every sentence of its language (either the sentence, or its negation). | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 03.4) |
| 10597 | 'Complete' applies both to whole logics, and to theories within them [Smith,P] |
| Full Idea: There is an annoying double-use of 'complete': a logic may be semantically complete, but there may be an incomplete theory expressed in it. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 03.4) |
| 10069 | A theory is 'negation complete' if one of its sentences or its negation can always be proved [Smith,P] |
| Full Idea: Logicians say that a theory T is '(negation) complete' if, for every sentence φ in the language of the theory, either φ or ¬φ is deducible in T's proof system. If this were the case, then truth could be equated with provability. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 01.1) | |
| A reaction: The word 'negation' seems to be a recent addition to the concept. Presumable it might be the case that φ can always be proved, but not ¬φ. |
| 10609 | Two routes to Incompleteness: semantics of sound/expressible, or syntax of consistency/proof [Smith,P] |
| Full Idea: There are two routes to Incompleteness results. One goes via the semantic assumption that we are dealing with sound theories, using a result about what they can express. The other uses the syntactic notion of consistency, with stronger notions of proof. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 18.1) |
| 10080 | 'Effective' means simple, unintuitive, independent, controlled, dumb, and terminating [Smith,P] |
| Full Idea: An 'effectively decidable' (or 'computable') algorithm will be step-by-small-step, with no need for intuition, or for independent sources, with no random methods, possible for a dumb computer, and terminates in finite steps. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 02.2) | |
| A reaction: [a compressed paragraph] |
| 10087 | A theory is 'decidable' if all of its sentences could be mechanically proved [Smith,P] |
| Full Idea: A theory is 'decidable' iff there is a mechanical procedure for determining whether any sentence of its language can be proved. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 03.4) | |
| A reaction: Note that it doesn't actually have to be proved. The theorems of the theory are all effectively decidable. |
| 10088 | Any consistent, axiomatized, negation-complete formal theory is decidable [Smith,P] |
| Full Idea: Any consistent, axiomatized, negation-complete formal theory is decidable. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 03.6) |
| 10081 | A set is 'enumerable' is all of its elements can result from a natural number function [Smith,P] |
| Full Idea: A set is 'enumerable' iff either the set is empty, or there is a surjective function to the set from the set of natural numbers, so that the set is in the range of that function. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 02.3) |
| 10083 | A set is 'effectively enumerable' if a computer could eventually list every member [Smith,P] |
| Full Idea: A set is 'effectively enumerable' if an (idealised) computer could be programmed to generate a list of its members such that any member will eventually be mentioned (even if the list is empty, or without end, or contains repetitions). | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 02.4) |
| 10084 | A finite set of finitely specifiable objects is always effectively enumerable (e.g. primes) [Smith,P] |
| Full Idea: A finite set of finitely specifiable objects is always effectively enumerable (for example, the prime numbers). | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 02.4) |
| 10085 | The set of ordered pairs of natural numbers <i,j> is effectively enumerable [Smith,P] |
| Full Idea: The set of ordered pairs of natural numbers (i,j) is effectively enumerable, as proven by listing them in an array (across: <0,0>, <0,1>, <0,2> ..., and down: <0,0>, <1,0>, <2,0>...), and then zig-zagging. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 02.5) |
| 10601 | The thorems of a nice arithmetic can be enumerated, but not the truths (so they're diffferent) [Smith,P] |
| Full Idea: The theorems of any properly axiomatized theory can be effectively enumerated. However, the truths of any sufficiently expressive arithmetic can't be effectively enumerated. Hence the theorems and truths of arithmetic cannot be the same. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 05 Intro) |
| 10600 | Being 'expressible' depends on language; being 'capture/represented' depends on axioms and proof system [Smith,P] |
| Full Idea: Whether a property is 'expressible' in a given theory depends on the richness of the theory's language. Whether the property can be 'captured' (or 'represented') by the theory depends on the richness of the axioms and proof system. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 04.7) |
| 16347 | Many new paradoxes may await us when we study interactions between frameworks [Halbach] |
| Full Idea: Paradoxes that arise from interaction of predicates such as truth, necessity, knowledge, future and past truths have receive little attention. There may be many unknown paradoxes lurking when we develop frameworks with these intensional notions. | |
| From: Volker Halbach (Axiomatic Theories of Truth [2011], 24.2) | |
| A reaction: Nice. This is a wonderful pointer to new research in the analytic tradition, in which formal problems will gradually iron out our metaphysical framework. |
| 16336 | The liar paradox applies truth to a negated truth (but the conditional will serve equally) [Halbach] |
| Full Idea: An essential feature of the liar paradox is the application of the truth predicate to a sentence with a negated occurrence of the truth predicate, though the negation can be avoided by using the conditional. | |
| From: Volker Halbach (Axiomatic Theories of Truth [2011], 19.3) |
| 10599 | For primes we write (x not= 1 ∧ ∀u∀v(u x v = x → (u = 1 ∨ v = 1))) [Smith,P] |
| Full Idea: For prime numbers we write (x not= 1 ∧ ∀u∀v(u x v = x → (u = 1 ∨ v = 1))). That is, the only way to multiply two numbers and a get a prime is if one of them is 1. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 04.5) |
| 10610 | The reals contain the naturals, but the theory of reals doesn't contain the theory of naturals [Smith,P] |
| Full Idea: It has been proved (by Tarski) that the real numbers R is a complete theory. But this means that while the real numbers contain the natural numbers, the pure theory of real numbers doesn't contain the theory of natural numbers. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 18.2) |
| 10619 | The truths of arithmetic are just true equations and their universally quantified versions [Smith,P] |
| Full Idea: The truths of arithmetic are just the true equations involving particular numbers, and universally quantified versions of such equations. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 27.7) | |
| A reaction: Must each equation be universally quantified? Why can't we just universally quantify over the whole system? |
| 10608 | The number of Fs is the 'successor' of the Gs if there is a single F that isn't G [Smith,P] |
| Full Idea: The number of Fs is the 'successor' of the number of Gs if there is an object which is an F, and the remaining things that are F but not identical to the object are equinumerous with the Gs. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 14.1) |
| 10618 | All numbers are related to zero by the ancestral of the successor relation [Smith,P] |
| Full Idea: All numbers are related to zero by the ancestral of the successor relation. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 23.5) | |
| A reaction: The successor relation only ties a number to the previous one, not to the whole series. Ancestrals are a higher level of abstraction. |
| 10849 | Baby arithmetic covers addition and multiplication, but no general facts about numbers [Smith,P] |
| Full Idea: Baby Arithmetic 'knows' the addition of particular numbers and multiplication, but can't express general facts about numbers, because it lacks quantification. It has a constant '0', a function 'S', and functions '+' and 'x', and identity and negation. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 08.1) |
| 10850 | Baby Arithmetic is complete, but not very expressive [Smith,P] |
| Full Idea: Baby Arithmetic is negation complete, so it can prove every claim (or its negation) that it can express, but it is expressively extremely impoverished. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 08.3) |
| 10852 | Robinson Arithmetic (Q) is not negation complete [Smith,P] |
| Full Idea: Robinson Arithmetic (Q) is not negation complete | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 08.4) |
| 10851 | Robinson Arithmetic 'Q' has basic axioms, quantifiers and first-order logic [Smith,P] |
| Full Idea: We can beef up Baby Arithmetic into Robinson Arithmetic (referred to as 'Q'), by restoring quantifiers and variables. It has seven generalised axioms, plus standard first-order logic. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 08.3) |
| 10068 | Natural numbers have zero, unique successors, unending, no circling back, and no strays [Smith,P] |
| Full Idea: The sequence of natural numbers starts from zero, and each number has just one immediate successor; the sequence continues without end, never circling back on itself, and there are no 'stray' numbers, lurking outside the sequence. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 01.1) | |
| A reaction: These are the characteristics of the natural numbers which have to be pinned down by any axiom system, such as Peano's, or any more modern axiomatic structures. We are in the territory of Gödel's theorems. |
| 16321 | The compactness theorem can prove nonstandard models of PA [Halbach] |
| Full Idea: Nonstandard models of Peano arithmetic are models of PA that are not isomorphic to the standard model. Their existence can be established with the compactness theorem or the adequacy theorem of first-order logic. | |
| From: Volker Halbach (Axiomatic Theories of Truth [2011], 8.3) |
| 16343 | The global reflection principle seems to express the soundness of Peano Arithmetic [Halbach] |
| Full Idea: The global reflection principle ∀x(Sent(x) ∧ Bew[PA](x) → Tx) …seems to be the full statement of the soundness claim for Peano arithmetic, as it expresses that all theorems of Peano arithmetic are true. | |
| From: Volker Halbach (Axiomatic Theories of Truth [2011], 22.1) | |
| A reaction: That is, an extra principle must be introduced to express the soundness. PA is, of course, not complete. |
| 10603 | The logic of arithmetic must quantify over properties of numbers to handle induction [Smith,P] |
| Full Idea: If the logic of arithmetic doesn't have second-order quantifiers to range over properties of numbers, how can it handle induction? | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 10.1) |
| 10848 | Multiplication only generates incompleteness if combined with addition and successor [Smith,P] |
| Full Idea: Multiplication in itself isn't is intractable. In 1929 Skolem showed a complete theory for a first-order language with multiplication but lacking addition (or successor). Multiplication together with addition and successor produces incompleteness. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 10.7 n8) |
| 10604 | Incompleteness results in arithmetic from combining addition and successor with multiplication [Smith,P] |
| Full Idea: Putting multiplication together with addition and successor in the language of arithmetic produces incompleteness. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 10.7) | |
| A reaction: His 'Baby Arithmetic' has all three and is complete, but lacks quantification (p.51) |
| 16312 | To reduce PA to ZF, we represent the non-negative integers with von Neumann ordinals [Halbach] |
| Full Idea: For the reduction of Peano Arithmetic to ZF set theory, usually the set of finite von Neumann ordinals is used to represent the non-negative integers. | |
| From: Volker Halbach (Axiomatic Theories of Truth [2011], 6) | |
| A reaction: Halbach makes it clear that this is just one mode of reduction, relative interpretability. |
| 16308 | Set theory was liberated early from types, and recent truth-theories are exploring type-free [Halbach] |
| Full Idea: While set theory was liberated much earlier from type restrictions, interest in type-free theories of truth only developed more recently. | |
| From: Volker Halbach (Axiomatic Theories of Truth [2011], 4) | |
| A reaction: Tarski's theory of truth involves types (or hierarchies). |
| 16345 | That Peano arithmetic is interpretable in ZF set theory is taken by philosophers as a reduction [Halbach] |
| Full Idea: The observation that Peano arithmetic is relatively interpretable in ZF set theory is taken by many philosophers to be a reduction of numbers to sets. | |
| From: Volker Halbach (Axiomatic Theories of Truth [2011], 23) | |
| A reaction: Nice! Being able to express something in a different language is not the same as a reduction. Back to the drawing board. What do you really mean by a reduction? If we model something, we don't 'reduce' it to the model. |
| 10617 | The 'ancestral' of a relation is a new relation which creates a long chain of the original relation [Smith,P] |
| Full Idea: The 'ancestral' of a relation is that relation which holds when there is an indefinitely long chain of things having the initial relation. | |
| From: Peter Smith (Intro to Gödel's Theorems [2007], 23.5) | |
| A reaction: The standard example is spotting the relation 'ancestor' from the receding relation 'parent'. This is a sort of abstraction derived from a relation which is not equivalent (parenthood being transitive but not reflexive). The idea originated with Frege. |
| 16643 | Accidents always remain suited to a subject [Bonaventura] |
| Full Idea: An accident's aptitudinal relationship to a subject is essential, and this is never taken away from accidents….for it is true to say that they are suited to a subject. | |
| From: Bonaventura (Commentary on Sentences [1252], IV.12.1.1.1c) | |
| A reaction: This is the compromise view that allows accidents to be separated, for Transubstantiation, while acknowledging that we identify them with their subjects. |
| 16696 | Successive things reduce to permanent things [Bonaventura] |
| Full Idea: Everything successive reduces to something permanent. | |
| From: Bonaventura (Commentary on Sentences [1252], II.2.1.1.3 ad 5), quoted by Robert Pasnau - Metaphysical Themes 1274-1671 18.2 | |
| A reaction: Avicenna first took successive entities seriously, but Bonaventure and Aquinas seem to have rejected them, or given reductive accounts of them. It resembles modern actualists versus modal realists. |
| 16346 | Maybe necessity is a predicate, not the usual operator, to make it more like truth [Halbach] |
| Full Idea: Should necessity be treated as a predicate rather than (as in modal logic) as a sentential operator? It is odd to assign different status to necessity and truth, hampering their interaction. That all necessities are true can't be expressed by an operator. | |
| From: Volker Halbach (Axiomatic Theories of Truth [2011], 24.2) | |
| A reaction: [compressed] Halbach and Horsten consistently treat truth as a predicate, but maybe truth is an operator. Making necessity a predicate and not an operator would be a huge upheaval in the world of modal logic. Nice move! |
| 16298 | We need propositions to ascribe the same beliefs to people with different languages [Halbach] |
| Full Idea: Being able to ascribe the same proposition as a belief to persons who do not have a common language seems to be one of the main reasons to employ propositions. | |
| From: Volker Halbach (Axiomatic Theories of Truth [2011], 2) | |
| A reaction: Propositions concern beliefs, as well as sentence meanings. I would want to say that a dog and I could believe the same thing, and that is a non-linguistic reason to believe in propositions. Maybe 'translation' cuts out the proposition middleman? |