79 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. |
| 17774 | Definitions make our intuitions mathematically useful [Mayberry] |
| Full Idea: Definition provides us with the means for converting our intuitions into mathematically usable concepts. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.405-1) |
| 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) |
| 17773 | Proof shows that it is true, but also why it must be true [Mayberry] |
| Full Idea: When you have proved something you know not only that it is true, but why it must be true. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.405-2) | |
| A reaction: Note the word 'must'. Presumably both the grounding and the necessitation of the truth are revealed. |
| 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. |
| 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. |
| 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) |
| 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) |
| 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. |
| 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) |
| 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. |
| 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. |
| 17795 | Set theory can't be axiomatic, because it is needed to express the very notion of axiomatisation [Mayberry] |
| Full Idea: Set theory cannot be an axiomatic theory, because the very notion of an axiomatic theory makes no sense without it. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.413-2) | |
| A reaction: This will come as a surprise to Penelope Maddy, who battles with ways to accept the set theory axioms as the foundation of mathematics. Mayberry says that the basic set theory required is much more simple and intuitive. |
| 17796 | There is a semi-categorical axiomatisation of set-theory [Mayberry] |
| Full Idea: We can give a semi-categorical axiomatisation of set-theory (all that remains undetermined is the size of the set of urelements and the length of the sequence of ordinals). The system is second-order in formalisation. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.413-2) | |
| A reaction: I gather this means the models may not be isomorphic to one another (because they differ in size), but can be shown to isomorphic to some third ingredient. I think. Mayberry says this shows there is no such thing as non-Cantorian set theory. |
| 17800 | The misnamed Axiom of Infinity says the natural numbers are finite in size [Mayberry] |
| Full Idea: The (misnamed!) Axiom of Infinity expresses Cantor's fundamental assumption that the species of natural numbers is finite in size. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.414-2) |
| 17801 | The set hierarchy doesn't rely on the dubious notion of 'generating' them [Mayberry] |
| Full Idea: The idea of 'generating' sets is only a metaphor - the existence of the hierarchy is established without appealing to such dubious notions. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.414-2) | |
| A reaction: Presumably there can be a 'dependence' or 'determination' relation which does not involve actual generation. |
| 17803 | Limitation of size is part of the very conception of a set [Mayberry] |
| Full Idea: Our very notion of a set is that of an extensional plurality limited in size. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.415-2) |
| 17786 | The mainstream of modern logic sees it as a branch of mathematics [Mayberry] |
| Full Idea: In the mainstream tradition of modern logic, beginning with Boole, Peirce and Schröder, descending through Löwenheim and Skolem to reach maturity with Tarski and his school ...saw logic as a branch of mathematics. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.410-1) | |
| A reaction: [The lesser tradition, of Frege and Russell, says mathematics is a branch of logic]. Mayberry says the Fregean tradition 'has almost died out'. |
| 17788 | First-order logic only has its main theorems because it is so weak [Mayberry] |
| Full Idea: First-order logic is very weak, but therein lies its strength. Its principle tools (Compactness, Completeness, Löwenheim-Skolem Theorems) can be established only because it is too weak to axiomatize either arithmetic or analysis. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.411-2) | |
| A reaction: He adds the proviso that this is 'unless we are dealing with structures on whose size we have placed an explicit, finite bound' (p.412-1). |
| 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. |
| 17791 | Only second-order logic can capture mathematical structure up to isomorphism [Mayberry] |
| Full Idea: Second-order logic is a powerful tool of definition: by means of it alone we can capture mathematical structure up to isomorphism using simple axiom systems. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.412-1) |
| 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) |
| 17787 | Big logic has one fixed domain, but standard logic has a domain for each interpretation [Mayberry] |
| Full Idea: The 'logica magna' [of the Fregean tradition] has quantifiers ranging over a fixed domain, namely everything there is. In the Boolean tradition the domains differ from interpretation to interpretation. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.410-2) | |
| A reaction: Modal logic displays both approaches, with different systems for global and local domains. |
| 17790 | No Löwenheim-Skolem logic can axiomatise real analysis [Mayberry] |
| Full Idea: No logic which can axiomatize real analysis can have the Löwenheim-Skolem property. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.412-1) |
| 17779 | 'Classificatory' axioms aim at revealing similarity in morphology of structures [Mayberry] |
| Full Idea: The purpose of a 'classificatory' axiomatic theory is to single out an otherwise disparate species of structures by fixing certain features of morphology. ...The aim is to single out common features. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.406-2) |
| 17778 | Axiomatiation relies on isomorphic structures being essentially the same [Mayberry] |
| Full Idea: The central dogma of the axiomatic method is this: isomorphic structures are mathematically indistinguishable in their essential properties. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.406-2) | |
| A reaction: Hence it is not that we have to settle for the success of a system 'up to isomorphism', since that was the original aim. The structures must differ in their non-essential properties, or they would be the same system. |
| 17780 | 'Eliminatory' axioms get rid of traditional ideal and abstract objects [Mayberry] |
| Full Idea: The purpose of what I am calling 'eliminatory' axiomatic theories is precisely to eliminate from mathematics those peculiar ideal and abstract objects that, on the traditional view, constitute its subject matter. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.407-1) | |
| A reaction: A very interesting idea. I have a natural antipathy to 'abstract objects', because they really mess up what could otherwise be a very tidy ontology. What he describes might be better called 'ignoring' axioms. The objects may 'exist', but who cares? |
| 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. |
| 17789 | No logic which can axiomatise arithmetic can be compact or complete [Mayberry] |
| Full Idea: No logic which can axiomatise arithmetic can be compact or complete. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.412-1) | |
| A reaction: I take this to be because there are new truths in the transfinite level (as well as the problem of incompleteness). |
| 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) |
| 17784 | Real numbers can be eliminated, by axiom systems for complete ordered fields [Mayberry] |
| Full Idea: We eliminate the real numbers by giving an axiomatic definition of the species of complete ordered fields. These axioms are categorical (mutually isomorphic), and thus are mathematically indistinguishable. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.408-2) | |
| A reaction: Hence my clever mathematical friend says that it is a terrible misunderstanding to think that mathematics is about numbers. Mayberry says the reals are one ordered field, but mathematics now studies all ordered fields together. |
| 17782 | Greek quantities were concrete, and ratio and proportion were their science [Mayberry] |
| Full Idea: Quantities for Greeks were concrete things - lines, surfaces, solids, times, weights. At the centre of their science of quantity was the beautiful theory of ratio and proportion (...in which the notion of number does not appear!). | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.407-2) | |
| A reaction: [He credits Eudoxus, and cites Book V of Euclid] |
| 17781 | Real numbers were invented, as objects, to simplify and generalise 'quantity' [Mayberry] |
| Full Idea: The abstract objects of modern mathematics, the real numbers, were invented by the mathematicians of the seventeenth century in order to simplify and to generalize the Greek science of quantity. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.407-2) |
| 17799 | Cantor's infinite is an absolute, of all the sets or all the ordinal numbers [Mayberry] |
| Full Idea: In Cantor's new vision, the infinite, the genuine infinite, does not disappear, but presents itself in the guise of the absolute, as manifested in the species of all sets or the species of all ordinal numbers. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.414-2) |
| 17797 | Cantor extended the finite (rather than 'taming the infinite') [Mayberry] |
| Full Idea: We may describe Cantor's achievement by saying, not that he tamed the infinite, but that he extended the finite. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.414-2) |
| 17775 | If proof and definition are central, then mathematics needs and possesses foundations [Mayberry] |
| Full Idea: If we grant, as surely we must, the central importance of proof and definition, then we must also grant that mathematics not only needs, but in fact has, foundations. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.405-1) |
| 17776 | The ultimate principles and concepts of mathematics are presumed, or grasped directly [Mayberry] |
| Full Idea: The ultimate principles upon which mathematics rests are those to which mathematicians appeal without proof; and the primitive concepts of mathematics ...themselves are grasped directly, if grasped at all, without the mediation of definition. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.405-1) | |
| A reaction: This begs the question of whether the 'grasping' is purely a priori, or whether it derives from experience. I defend the latter, and Jenkins puts the case well. |
| 17777 | Foundations need concepts, definition rules, premises, and proof rules [Mayberry] |
| Full Idea: An account of the foundations of mathematics must specify four things: the primitive concepts for use in definitions, the rules governing definitions, the ultimate premises of proofs, and rules allowing advance from premises to conclusions. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.405-2) |
| 17804 | Axiom theories can't give foundations for mathematics - that's using axioms to explain axioms [Mayberry] |
| Full Idea: No axiomatic theory, formal or informal, of first or of higher order can logically play a foundational role in mathematics. ...It is obvious that you cannot use the axiomatic method to explain what the axiomatic method is. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.415-2) |
| 17792 | 1st-order PA is only interesting because of results which use 2nd-order PA [Mayberry] |
| Full Idea: The sole theoretical interest of first-order Peano arithmetic derives from the fact that it is a first-order reduct of a categorical second-order theory. Its axioms can be proved incomplete only because the second-order theory is categorical. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.412-1) |
| 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. |
| 17793 | It is only 2nd-order isomorphism which suggested first-order PA completeness [Mayberry] |
| Full Idea: If we did not know that the second-order axioms characterise the natural numbers up to isomorphism, we should have no reason to suppose, a priori, that first-order Peano Arithmetic should be complete. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.412-1) |
| 17794 | Set theory is not just first-order ZF, because that is inadequate for mathematics [Mayberry] |
| Full Idea: The idea that set theory must simply be identified with first-order Zermelo-Fraenkel is surprisingly widespread. ...The first-order axiomatic theory of sets is clearly inadequate as a foundation of mathematics. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.412-2) | |
| A reaction: [He is agreeing with a quotation from Skolem]. |
| 17802 | We don't translate mathematics into set theory, because it comes embodied in that way [Mayberry] |
| Full Idea: One does not have to translate 'ordinary' mathematics into the Zermelo-Fraenkel system: ordinary mathematics comes embodied in that system. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.415-1) | |
| A reaction: Mayberry seems to be a particular fan of set theory as spelling out the underlying facts of mathematics, though it has to be second-order. |
| 17805 | Set theory is not just another axiomatised part of mathematics [Mayberry] |
| Full Idea: The fons et origo of all confusion is the view that set theory is just another axiomatic theory and the universe of sets just another mathematical structure. ...The universe of sets ...is the world that all mathematical structures inhabit. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.416-1) |
| 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. |
| 17785 | Real numbers as abstracted objects are now treated as complete ordered fields [Mayberry] |
| Full Idea: The abstractness of the old fashioned real numbers has been replaced by generality in the modern theory of complete ordered fields. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.408-2) | |
| A reaction: In philosophy, I'm increasingly thinking that we should talk much more of 'generality', and a great deal less about 'universals'. (By which I don't mean that redness is just the set of red things). |
| 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! |
| 14080 | Are causal descriptions part of the causal theory of reference, or are they just metasemantic? [Kaplan, by Schaffer,J] |
| Full Idea: Kaplan notes that the causal theory of reference can be understood in two quite different ways, as part of the semantics (involving descriptions of causal processes), or as metasemantics, explaining why a term has the referent it does. | |
| From: report of David Kaplan (Dthat [1970]) by Jonathan Schaffer - Deflationary Metaontology of Thomasson 1 | |
| A reaction: [Kaplan 'Afterthought' 1989] The theory tends to be labelled as 'direct' rather than as 'causal' these days, but causal chains are still at the heart of the story (even if more diffused socially). Nice question. Kaplan takes the meta- version as orthodox. |
| 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? |