74 ideas
| 15134 | The truthmaker principle requires some specific named thing to make the difference [Williamson] |
| 15141 | Truthmaker is incompatible with modal semantics of varying domains [Williamson] |
| 15140 | The converse Barcan formula will not allow contingent truths to have truthmakers [Williamson] |
| 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] |
| 9065 | S5 collapses iterated modalities (◊□P→□P, and ◊◊P→◊P) [Keefe/Smith] |
| 15131 | If metaphysical possibility is not a contingent matter, then S5 seems to suit it best [Williamson] |
| 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] |
| 15135 | If the domain of propositional quantification is constant, the Barcan formulas hold [Williamson] |
| 13720 | Converse Barcan Formula: □∀αφ→∀α□φ [Sider] |
| 15139 | Converse Barcan: could something fail to meet a condition, if everything meets that condition? [Williamson] |
| 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] |
| 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] |
| 13703 | λ can treat 'is cold and hungry' as a single predicate [Sider] |
| 18492 | Not all quantification is either objectual or substitutional [Williamson] |
| 15136 | Substitutional quantification is metaphysical neutral, and equivalent to a disjunction of instances [Williamson] |
| 15138 | Not all quantification is objectual or substitutional [Williamson] |
| 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] |
| 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] |
| 13701 | A single second-order sentence validates all of arithmetic - but this can't be proved axiomatically [Sider] |
| 15137 | If 'fact' is a noun, can we name the fact that dogs bark 'Mary'? [Williamson] |
| 9064 | Objects such as a cloud or Mount Everest seem to have fuzzy boundaries in nature [Keefe/Smith] |
| 9044 | If someone is borderline tall, no further information is likely to resolve the question [Keefe/Smith] |
| 9048 | The simplest approach, that vagueness is just ignorance, retains classical logic and semantics [Keefe/Smith] |
| 9055 | The epistemic view of vagueness must explain why we don't know the predicate boundary [Keefe/Smith] |
| 9049 | Supervaluationism keeps true-or-false where precision can be produced, but not otherwise [Keefe/Smith] |
| 9056 | Vague statements lack truth value if attempts to make them precise fail [Keefe/Smith] |
| 9058 | Some of the principles of classical logic still fail with supervaluationism [Keefe/Smith] |
| 9059 | The semantics of supervaluation (e.g. disjunction and quantification) is not classical [Keefe/Smith] |
| 9060 | Supervaluation misunderstands vagueness, treating it as a failure to make things precise [Keefe/Smith] |
| 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] |
| 9050 | A third truth-value at borderlines might be 'indeterminate', or a value somewhere between 0 and 1 [Keefe/Smith] |
| 9061 | People can't be placed in a precise order according to how 'nice' they are [Keefe/Smith] |
| 9062 | If truth-values for vagueness range from 0 to 1, there must be someone who is 'completely tall' [Keefe/Smith] |
| 9063 | How do we decide if my coat is red to degree 0.322 or 0.321? [Keefe/Smith] |
| 13683 | A relation is a feature of multiple objects taken together [Sider] |
| 9045 | Vague predicates involve uncertain properties, uncertain objects, and paradoxes of gradual change [Keefe/Smith] |
| 9047 | Many vague predicates are multi-dimensional; 'big' involves height and volume; heaps include arrangement [Keefe/Smith] |
| 9053 | If there is a precise borderline area, that is not a case of vagueness [Keefe/Smith] |
| 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] |
| 15142 | Our ability to count objects across possibilities favours the Barcan formulas [Williamson] |
| 13719 | Barcan Formula problem: there might have been a ghost, despite nothing existing which could be a ghost [Sider] |
| 15133 | A thing can't be the only necessary existent, because its singleton set would be as well [Williamson] |