92 ideas
| 23367 | Even pointing a finger should only be done for a reason [Epictetus] |
| 15357 | Philosophy is the most general intellectual discipline [Horsten] |
| 15352 | A definition should allow the defined term to be eliminated [Horsten] |
| 15324 | Semantic theories of truth seek models; axiomatic (syntactic) theories seek logical principles [Horsten] |
| 15323 | Truth is a property, because the truth predicate has an extension [Horsten] |
| 15374 | Truth has no 'nature', but we should try to describe its behaviour in inferences [Horsten] |
| 15348 | Propositions have sentence-like structures, so it matters little which bears the truth [Horsten] |
| 15333 | Modern correspondence is said to be with the facts, not with true propositions [Horsten] |
| 15337 | The correspondence 'theory' is too vague - about both 'correspondence' and 'facts' [Horsten] |
| 15334 | The coherence theory allows multiple coherent wholes, which could contradict one another [Horsten] |
| 15336 | The pragmatic theory of truth is relative; useful for group A can be useless for group B [Horsten] |
| 15354 | Tarski's hierarchy lacks uniform truth, and depends on contingent factors [Horsten] |
| 15340 | Tarski Bi-conditional: if you'll assert φ you'll assert φ-is-true - and also vice versa [Horsten] |
| 15345 | Semantic theories have a regress problem in describing truth in the languages for the models [Horsten] |
| 15373 | Axiomatic approaches avoid limiting definitions to avoid the truth predicate, and limited sizes of models [Horsten] |
| 15346 | Axiomatic approaches to truth avoid the regress problem of semantic theories [Horsten] |
| 15371 | An axiomatic theory needs to be of maximal strength, while being natural and sound [Horsten] |
| 15332 | 'Reflexive' truth theories allow iterations (it is T that it is T that p) [Horsten] |
| 15361 | A good theory of truth must be compositional (as well as deriving biconditionals) [Horsten] |
| 15350 | The Naïve Theory takes the bi-conditionals as axioms, but it is inconsistent, and allows the Liar [Horsten] |
| 15351 | Axiomatic theories take truth as primitive, and propose some laws of truth as axioms [Horsten] |
| 15367 | By adding truth to Peano Arithmetic we increase its power, so truth has mathematical content! [Horsten] |
| 15330 | Friedman-Sheard theory keeps classical logic and aims for maximum strength [Horsten] |
| 15331 | Kripke-Feferman has truth gaps, instead of classical logic, and aims for maximum strength [Horsten] |
| 15325 | Inferential deflationism says truth has no essence because no unrestricted logic governs the concept [Horsten] |
| 15344 | Deflationism skips definitions and models, and offers just accounts of basic laws of truth [Horsten] |
| 15356 | Deflationism concerns the nature and role of truth, but not its laws [Horsten] |
| 15368 | This deflationary account says truth has a role in generality, and in inference [Horsten] |
| 15358 | Deflationism says truth isn't a topic on its own - it just concerns what is true [Horsten] |
| 15359 | Deflation: instead of asserting a sentence, we can treat it as an object with the truth-property [Horsten] |
| 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] |
| 15329 | Nonclassical may accept T/F but deny applicability, or it may deny just T or F as well [Horsten] |
| 13715 | You can employ intuitionist logic without intuitionism about mathematics [Sider] |
| 15326 | Doubt is thrown on classical logic by the way it so easily produces the liar paradox [Horsten] |
| 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] |
| 15341 | Deduction Theorem: ψ only derivable from φ iff φ→ψ are axioms [Horsten] |
| 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] |
| 15328 | A theory is 'non-conservative' if it facilitates new mathematical proofs [Horsten] |
| 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] |
| 15349 | It is easier to imagine truth-value gaps (for the Liar, say) than for truth-value gluts (both T and F) [Horsten] |
| 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] |
| 15366 | Satisfaction is a primitive notion, and very liable to semantical paradoxes [Horsten] |
| 13724 | In model theory, first define truth, then validity as truth in all models, and consequence as truth-preservation [Sider] |
| 13698 | In a complete logic you can avoid axiomatic proofs, by using models to show consequences [Sider] |
| 15353 | The first incompleteness theorem means that consistency does not entail soundness [Horsten] |
| 13699 | Compactness surprisingly says that no contradictions can emerge when the set goes infinite [Sider] |
| 15355 | Strengthened Liar: 'this sentence is not true in any context' - in no context can this be evaluated [Horsten] |
| 15364 | English expressions are denumerably infinite, but reals are nondenumerable, so many are unnameable [Horsten] |
| 13701 | A single second-order sentence validates all of arithmetic - but this can't be proved axiomatically [Sider] |
| 15360 | ZFC showed that the concept of set is mathematical, not logical, because of its existence claims [Horsten] |
| 15369 | Set theory is substantial over first-order arithmetic, because it enables new proofs [Horsten] |
| 15370 | Predicativism says mathematical definitions must not include the thing being defined [Horsten] |
| 15338 | We may believe in atomic facts, but surely not complex disjunctive ones? [Horsten] |
| 15363 | In the supervaluationist account, disjunctions are not determined by their disjuncts [Horsten] |
| 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] |
| 15362 | If 'Italy is large' lacks truth, so must 'Italy is not large'; but classical logic says it's large or it isn't [Horsten] |
| 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] |
| 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] |
| 15372 | Some claim that indicative conditionals are believed by people, even though they are not actually held true [Horsten] |
| 15347 | A theory of syntax can be based on Peano arithmetic, thanks to the translation by Gödel coding [Horsten] |