96 ideas
| 16325 | Analysis rests on natural language, but its ideal is a framework which revises language [Halbach] |
| 6806 | Do not multiply entities beyond necessity [William of Ockham] |
| 16292 | An explicit definition enables the elimination of what is defined [Halbach] |
| 16307 | Don't trust analogies; they are no more than a guideline [Halbach] |
| 16339 | Truth axioms prove objects exist, so truth doesn't seem to be a logical notion [Halbach] |
| 16330 | Truth-value 'gluts' allow two truth values together; 'gaps' give a partial conception of truth [Halbach] |
| 16324 | Any definition of truth requires a metalanguage [Halbach] |
| 16293 | Traditional definitions of truth often make it more obscure, rather than less [Halbach] |
| 16301 | If people have big doubts about truth, a definition might give it more credibility [Halbach] |
| 16297 | Semantic theories avoid Tarski's Theorem by sticking to a sublanguage [Halbach] |
| 16337 | Disquotational truth theories are short of deductive power [Halbach] |
| 16294 | Axiomatic truth doesn't presuppose a truth-definition, though it could admit it at a later stage [Halbach] |
| 16311 | To axiomatise Tarski's truth definition, we need a binary predicate for his 'satisfaction' [Halbach] |
| 16318 | Compositional Truth CT has the truth of a sentence depending of the semantic values of its constituents [Halbach] |
| 16326 | The main semantic theories of truth are Kripke's theory, and revisions semantics [Halbach] |
| 16299 | Gödel numbering means a theory of truth can use Peano Arithmetic as its base theory [Halbach] |
| 16340 | Truth axioms need a base theory, because that is where truth issues arise [Halbach] |
| 16322 | CT proves PA consistent, which PA can't do on its own, so CT is not conservative over PA [Halbach] |
| 16305 | We know a complete axiomatisation of truth is not feasible [Halbach] |
| 16313 | A theory is 'conservative' if it adds no new theorems to its base theory [Halbach, by PG] |
| 16315 | The Tarski Biconditional theory TB is Peano Arithmetic, plus truth, plus all Tarski bi-conditionals [Halbach] |
| 16314 | Theories of truth are 'typed' (truth can't apply to sentences containing 'true'), or 'type-free' [Halbach] |
| 16327 | Friedman-Sheard is type-free Compositional Truth, with two inference rules for truth [Halbach] |
| 16332 | The KF theory is useful, but it is not a theory containing its own truth predicate [Halbach] |
| 16329 | Kripke-Feferman theory KF axiomatises Kripke fixed-points, with Strong Kleene logic with gluts [Halbach] |
| 16331 | The KF is much stronger deductively than FS, which relies on classical truth [Halbach] |
| 16338 | Deflationism says truth is a disquotation device to express generalisations, adding no new knowledge [Halbach] |
| 16317 | The main problem for deflationists is they can express generalisations, but not prove them [Halbach] |
| 16316 | Deflationists say truth is just for expressing infinite conjunctions or generalisations [Halbach] |
| 16319 | Compositional Truth CT proves generalisations, so is preferred in discussions of deflationism [Halbach] |
| 16320 | Some say deflationism is axioms which are conservative over the base theory [Halbach] |
| 16335 | In Strong Kleene logic a disjunction just needs one disjunct to be true [Halbach] |
| 16334 | In Weak Kleene logic there are 'gaps', neither true nor false if one component lacks a truth value [Halbach] |
| 16309 | Every attempt at formal rigour uses some set theory [Halbach] |
| 10073 | There cannot be a set theory which is complete [Smith,P] |
| 16333 | The underestimated costs of giving up classical logic are found in mathematical reasoning [Halbach] |
| 10616 | Second-order arithmetic can prove new sentences of first-order [Smith,P] |
| 10074 | A 'total function' maps every element to one element in another set [Smith,P] |
| 10612 | An argument is a 'fixed point' for a function if it is mapped back to itself [Smith,P] |
| 10605 | Two functions are the same if they have the same extension [Smith,P] |
| 10075 | A 'partial function' maps only some elements to another set [Smith,P] |
| 10076 | The 'range' of a function is the set of elements in the output set created by the function [Smith,P] |
| 10615 | The Comprehension Schema says there is a property only had by things satisfying a condition [Smith,P] |
| 16310 | A theory is some formulae and all of their consequences [Halbach] |
| 10595 | A 'theorem' of a theory is a sentence derived from the axioms using the proof system [Smith,P] |
| 10602 | A 'natural deduction system' has no axioms but many rules [Smith,P] |
| 10613 | No nice theory can define truth for its own language [Smith,P] |
| 10079 | A 'bijective' function has one-to-one correspondence in both directions [Smith,P] |
| 10077 | A 'surjective' ('onto') function creates every element of the output set [Smith,P] |
| 10078 | An 'injective' ('one-to-one') function creates a distinct output element from each original [Smith,P] |
| 10070 | If everything that a theory proves is true, then it is 'sound' [Smith,P] |
| 10086 | Soundness is true axioms and a truth-preserving proof system [Smith,P] |
| 16342 | You cannot just say all of Peano arithmetic is true, as 'true' isn't part of the system [Halbach] |
| 10596 | A theory is 'sound' iff every theorem is true (usually from true axioms and truth-preservation) [Smith,P] |
| 16341 | Normally we only endorse a theory if we believe it to be sound [Halbach] |
| 16344 | Soundness must involve truth; the soundness of PA certainly needs it [Halbach] |
| 10598 | A theory is 'negation complete' if it proves all sentences or their negation [Smith,P] |
| 10597 | 'Complete' applies both to whole logics, and to theories within them [Smith,P] |
| 10069 | A theory is 'negation complete' if one of its sentences or its negation can always be proved [Smith,P] |
| 10609 | Two routes to Incompleteness: semantics of sound/expressible, or syntax of consistency/proof [Smith,P] |
| 10087 | A theory is 'decidable' if all of its sentences could be mechanically proved [Smith,P] |
| 10088 | Any consistent, axiomatized, negation-complete formal theory is decidable [Smith,P] |
| 10080 | 'Effective' means simple, unintuitive, independent, controlled, dumb, and terminating [Smith,P] |
| 10081 | A set is 'enumerable' is all of its elements can result from a natural number function [Smith,P] |
| 10083 | A set is 'effectively enumerable' if a computer could eventually list every member [Smith,P] |
| 10084 | A finite set of finitely specifiable objects is always effectively enumerable (e.g. primes) [Smith,P] |
| 10085 | The set of ordered pairs of natural numbers <i,j> is effectively enumerable [Smith,P] |
| 10601 | The thorems of a nice arithmetic can be enumerated, but not the truths (so they're diffferent) [Smith,P] |
| 10600 | Being 'expressible' depends on language; being 'capture/represented' depends on axioms and proof system [Smith,P] |
| 16347 | Many new paradoxes may await us when we study interactions between frameworks [Halbach] |
| 16336 | The liar paradox applies truth to a negated truth (but the conditional will serve equally) [Halbach] |
| 10599 | For primes we write (x not= 1 ∧ ∀u∀v(u x v = x → (u = 1 ∨ v = 1))) [Smith,P] |
| 10610 | The reals contain the naturals, but the theory of reals doesn't contain the theory of naturals [Smith,P] |
| 10619 | The truths of arithmetic are just true equations and their universally quantified versions [Smith,P] |
| 10618 | All numbers are related to zero by the ancestral of the successor relation [Smith,P] |
| 10608 | The number of Fs is the 'successor' of the Gs if there is a single F that isn't G [Smith,P] |
| 10849 | Baby arithmetic covers addition and multiplication, but no general facts about numbers [Smith,P] |
| 10850 | Baby Arithmetic is complete, but not very expressive [Smith,P] |
| 10851 | Robinson Arithmetic 'Q' has basic axioms, quantifiers and first-order logic [Smith,P] |
| 10852 | Robinson Arithmetic (Q) is not negation complete [Smith,P] |
| 10068 | Natural numbers have zero, unique successors, unending, no circling back, and no strays [Smith,P] |
| 16321 | The compactness theorem can prove nonstandard models of PA [Halbach] |
| 16343 | The global reflection principle seems to express the soundness of Peano Arithmetic [Halbach] |
| 10603 | The logic of arithmetic must quantify over properties of numbers to handle induction [Smith,P] |
| 10604 | Incompleteness results in arithmetic from combining addition and successor with multiplication [Smith,P] |
| 10848 | Multiplication only generates incompleteness if combined with addition and successor [Smith,P] |
| 16312 | To reduce PA to ZF, we represent the non-negative integers with von Neumann ordinals [Halbach] |
| 16308 | Set theory was liberated early from types, and recent truth-theories are exploring type-free [Halbach] |
| 16345 | That Peano arithmetic is interpretable in ZF set theory is taken by philosophers as a reduction [Halbach] |
| 10617 | The 'ancestral' of a relation is a new relation which creates a long chain of the original relation [Smith,P] |
| 22132 | Species and genera are individual concepts which naturally signify many individuals [William of Ockham] |
| 16346 | Maybe necessity is a predicate, not the usual operator, to make it more like truth [Halbach] |
| 16298 | We need propositions to ascribe the same beliefs to people with different languages [Halbach] |
| 19381 | The past has ceased to exist, and the future does not yet exist, so time does not exist [William of Ockham] |
| 8010 | William of Ockham is the main spokesman for God's commands being the source of morality [William of Ockham] |
| 16679 | Even an angel must have some location [William of Ockham, by Pasnau] |