80 ideas
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] |
13710 | In D we add that 'what is necessary is possible'; then tautologies are possible, and contradictions not necessary [Sider] |
13706 | Intuitively, deontic accessibility seems not to be reflexive, but to be serial [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] |
15413 | With four tense operators, all complex tenses reduce to fourteen basic cases [Burgess] |
13714 | We can treat modal worlds as different times [Sider] |
15415 | The temporal Barcan formulas fix what exists, which seems absurd [Burgess] |
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] |
15430 | Is classical logic a part of intuitionist logic, or vice versa? [Burgess] |
15431 | It is still unsettled whether standard intuitionist logic is complete [Burgess] |
13715 | You can employ intuitionist logic without intuitionism about mathematics [Sider] |
15429 | Relevance logic's → is perhaps expressible by 'if A, then B, for that reason' [Burgess] |
15404 | Technical people see logic as any formal system that can be studied, not a study of argument validity [Burgess] |
15405 | Classical logic neglects the non-mathematical, such as temporality or modality [Burgess] |
15421 | Classical logic neglects counterfactuals, temporality and modality, because maths doesn't use them [Burgess] |
15427 | The Cut Rule expresses the classical idea that entailment is transitive [Burgess] |
15403 | Philosophical logic is a branch of logic, and is now centred in computer science [Burgess] |
13680 | Maybe logical consequence is a primitive notion [Sider] |
13679 | Maybe logical consequence is more a matter of provability than of truth-preservation [Sider] |
13678 | The most popular account of logical consequence is the semantic or model-theoretic one [Sider] |
13682 | Maybe logical consequence is impossibility of the premises being true and the consequent false [Sider] |
13722 | A 'theorem' is an axiom, or the last line of a legitimate proof [Sider] |
15407 | Formalising arguments favours lots of connectives; proving things favours having very few [Burgess] |
15424 | Asserting a disjunction from one disjunct seems odd, but can be sensible, and needed in maths [Burgess] |
15409 | All occurrences of variables in atomic formulas are free [Burgess] |
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] |
15414 | The denotation of a definite description is flexible, rather than rigid [Burgess] |
13703 | λ can treat 'is cold and hungry' as a single predicate [Sider] |
15406 | 'Induction' and 'recursion' on complexity prove by connecting a formula to its atomic components [Burgess] |
13687 | No assumptions in axiomatic proofs, so no conditional proof or reductio [Sider] |
13688 | Good axioms should be indisputable logical truths [Sider] |
13691 | Induction has a 'base case', then an 'inductive hypothesis', and then the 'inductive step' [Sider] |
13690 | Proof by induction 'on the length of the formula' deconstructs a formula into its accepted atoms [Sider] |
13685 | Natural deduction helpfully allows reasoning with assumptions [Sider] |
15426 | We can build one expanding sequence, instead of a chain of deductions [Burgess] |
15425 | The sequent calculus makes it possible to have proof without transitivity of entailment [Burgess] |
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] |
15408 | 'Tautologies' are valid formulas of classical sentential logic - or substitution instances in other logics [Burgess] |
15418 | Validity (for truth) and demonstrability (for proof) have correlates in satisfiability and consistency [Burgess] |
15411 | We only need to study mathematical models, since all other models are isomorphic to these [Burgess] |
15412 | Models leave out meaning, and just focus on truth values [Burgess] |
13724 | In model theory, first define truth, then validity as truth in all models, and consequence as truth-preservation [Sider] |
15416 | We aim to get the technical notion of truth in all models matching intuitive truth in all instances [Burgess] |
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] |
15428 | The Liar seems like a truth-value 'gap', but dialethists see it as a 'glut' [Burgess] |
13701 | A single second-order sentence validates all of arithmetic - but this can't be proved axiomatically [Sider] |
13692 | A 'precisification' of a trivalent interpretation reduces it to a bivalent interpretation [Sider] |
13693 | A 'supervaluation' assigns further Ts and Fs, if they have been assigned in every precisification [Sider] |
13695 | Supervaluational logic is classical, except when it adds the 'Definitely' operator [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] |
16066 | Additional or removal of any part changes a thing, so people are never the same person [Epicharmus] |
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] |
15420 | De re modality seems to apply to objects a concept intended for sentences [Burgess] |
13707 | Maybe metaphysical accessibility is intransitive, if a world in which I am a frog is impossible [Sider] |
15417 | Logical necessity has two sides - validity and demonstrability - which coincide in classical logic [Burgess] |
15419 | General consensus is S5 for logical modality of validity, and S4 for proof [Burgess] |
13709 | Logical truths must be necessary if anything is [Sider] |
15423 | It is doubtful whether the negation of a conditional has any clear meaning [Burgess] |
15422 | Three conditionals theories: Materialism (material conditional), Idealism (true=assertable), Nihilism (no truth) [Burgess] |
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] |
436 | A dog seems handsome to another a dog, and even a pig to another pig [Epicharmus] |
442 | Pleasures are like pirates - if you are caught they drown you in a sea of pleasures [Epicharmus] |
440 | Hands wash hands; give that you may get [Epicharmus] |
441 | Against a villain, villainy is not a useless weapon [Epicharmus] |
439 | God knows everything, and nothing is impossible for him [Epicharmus] |
443 | Human logos is an aspect of divine logos, and is sufficient for successful living [Epicharmus] |