97 ideas
| 16325 | Analysis rests on natural language, but its ideal is a framework which revises language [Halbach] |
| 16292 | An explicit definition enables the elimination of what is defined [Halbach] |
| 16307 | Don't trust analogies; they are no more than a guideline [Halbach] |
| 16330 | Truth-value 'gluts' allow two truth values together; 'gaps' give a partial conception of truth [Halbach] |
| 16339 | Truth axioms prove objects exist, so truth doesn't seem to be a logical notion [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] |
| 16322 | CT proves PA consistent, which PA can't do on its own, so CT is not conservative over PA [Halbach] |
| 16294 | Axiomatic truth doesn't presuppose a truth-definition, though it could admit it at a later stage [Halbach] |
| 16326 | The main semantic theories of truth are Kripke's theory, and revisions semantics [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] |
| 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] |
| 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] |
| 16329 | Kripke-Feferman theory KF axiomatises Kripke fixed-points, with Strong Kleene logic with gluts [Halbach] |
| 16332 | The KF theory is useful, but it is not a theory containing its own truth predicate [Halbach] |
| 16331 | The KF is much stronger deductively than FS, which relies on classical truth [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] |
| 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] |
| 13689 | 'Theorems' are formulas provable from no premises at all [Sider] |
| 13705 | Truth tables assume truth functionality, and are just pictures of truth functions [Sider] |
| 13706 | Intuitively, deontic accessibility seems not to be reflexive, but to be serial [Sider] |
| 13710 | In D we add that 'what is necessary is possible'; then tautologies are possible, and contradictions not necessary [Sider] |
| 13711 | System B introduces iterated modalities [Sider] |
| 13708 | S5 is the strongest system, since it has the most valid formulas, because it is easy to be S5-valid [Sider] |
| 13712 | Epistemic accessibility is reflexive, and allows positive and negative introspection (KK and K¬K) [Sider] |
| 13714 | We can treat modal worlds as different times [Sider] |
| 13720 | Converse Barcan Formula: □∀αφ→∀α□φ [Sider] |
| 13718 | The Barcan Formula ∀x□Fx→□∀xFx may be a defect in modal logic [Sider] |
| 13723 | System B is needed to prove the Barcan Formula [Sider] |
| 13715 | You can employ intuitionist logic without intuitionism about mathematics [Sider] |
| 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] |
| 16333 | The underestimated costs of giving up classical logic are found in mathematical reasoning [Halbach] |
| 13678 | The most popular account of logical consequence is the semantic or model-theoretic one [Sider] |
| 13679 | Maybe logical consequence is more a matter of provability than of truth-preservation [Sider] |
| 13682 | Maybe logical consequence is impossibility of the premises being true and the consequent false [Sider] |
| 13680 | Maybe logical consequence is a primitive notion [Sider] |
| 13722 | A 'theorem' is an axiom, or the last line of a legitimate proof [Sider] |
| 13696 | When a variable is 'free' of the quantifier, the result seems incapable of truth or falsity [Sider] |
| 13700 | A 'total' function must always produce an output for a given domain [Sider] |
| 16310 | A theory is some formulae and all of their consequences [Halbach] |
| 13703 | λ can treat 'is cold and hungry' as a single predicate [Sider] |
| 13688 | Good axioms should be indisputable logical truths [Sider] |
| 13687 | No assumptions in axiomatic proofs, so no conditional proof or reductio [Sider] |
| 13690 | Proof by induction 'on the length of the formula' deconstructs a formula into its accepted atoms [Sider] |
| 13691 | Induction has a 'base case', then an 'inductive hypothesis', and then the 'inductive step' [Sider] |
| 13685 | Natural deduction helpfully allows reasoning with assumptions [Sider] |
| 13686 | We can build proofs just from conclusions, rather than from plain formulae [Sider] |
| 13697 | Valuations in PC assign truth values to formulas relative to variable assignments [Sider] |
| 13684 | The semantical notion of a logical truth is validity, being true in all interpretations [Sider] |
| 13704 | It is hard to say which are the logical truths in modal logic, especially for iterated modal operators [Sider] |
| 13724 | In model theory, first define truth, then validity as truth in all models, and consequence as truth-preservation [Sider] |
| 16342 | You cannot just say all of Peano arithmetic is true, as 'true' isn't part of the system [Halbach] |
| 16341 | Normally we only endorse a theory if we believe it to be sound [Halbach] |
| 16344 | Soundness must involve truth; the soundness of PA certainly needs it [Halbach] |
| 13698 | In a complete logic you can avoid axiomatic proofs, by using models to show consequences [Sider] |
| 13699 | Compactness surprisingly says that no contradictions can emerge when the set goes infinite [Sider] |
| 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] |
| 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] |
| 13701 | A single second-order sentence validates all of arithmetic - but this can't be proved axiomatically [Sider] |
| 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] |
| 13692 | A 'precisification' of a trivalent interpretation reduces it to a bivalent interpretation [Sider] |
| 13695 | Supervaluational logic is classical, except when it adds the 'Definitely' operator [Sider] |
| 13693 | A 'supervaluation' assigns further Ts and Fs, if they have been assigned in every precisification [Sider] |
| 13694 | We can 'sharpen' vague terms, and then define truth as true-on-all-sharpenings [Sider] |
| 13683 | A relation is a feature of multiple objects taken together [Sider] |
| 13702 | The identity of indiscernibles is necessarily true, if being a member of some set counts as a property [Sider] |
| 16346 | Maybe necessity is a predicate, not the usual operator, to make it more like truth [Halbach] |
| 13721 | 'Strong' necessity in all possible worlds; 'weak' necessity in the worlds where the relevant objects exist [Sider] |
| 13707 | Maybe metaphysical accessibility is intransitive, if a world in which I am a frog is impossible [Sider] |
| 13709 | Logical truths must be necessary if anything is [Sider] |
| 13716 | 'If B hadn't shot L someone else would have' if false; 'If B didn't shoot L, someone else did' is true [Sider] |
| 13717 | Transworld identity is not a problem in de dicto sentences, which needn't identify an individual [Sider] |
| 13719 | Barcan Formula problem: there might have been a ghost, despite nothing existing which could be a ghost [Sider] |
| 16298 | We need propositions to ascribe the same beliefs to people with different languages [Halbach] |
| 6613 | The natural kinds are objects, processes and properties/relations [Ellis] |
| 6616 | Least action is not a causal law, but a 'global law', describing a global essence [Ellis] |
| 6615 | A species requires a genus, and its essence includes the essence of the genus [Ellis] |
| 6614 | A hierarchy of natural kinds is elaborate ontology, but needed to explain natural laws [Ellis] |
| 6612 | Without general principles, we couldn't predict the behaviour of dispositional properties [Ellis] |