63 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] |
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] |
19370 | 'Blind thought' is reasoning without recognition of the ingredients of the reasoning [Leibniz, by Arthur,R] |
13680 | Maybe logical consequence is a primitive notion [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] |
13722 | A 'theorem' is an axiom, or the last line of a legitimate proof [Sider] |
8729 | Intuitionists deny excluded middle, because it is committed to transcendent truth or objects [Shapiro] |
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] |
13687 | No assumptions in axiomatic proofs, so no conditional proof or reductio [Sider] |
13688 | Good axioms should be indisputable logical truths [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] |
19391 | We can assign a characteristic number to every single object [Leibniz] |
13699 | Compactness surprisingly says that no contradictions can emerge when the set goes infinite [Sider] |
8763 | The number 3 is presumably identical as a natural, an integer, a rational, a real, and complex [Shapiro] |
18249 | Cauchy gave a formal definition of a converging sequence. [Shapiro] |
19390 | Everything is subsumed under number, which is a metaphysical statics of the universe, revealing powers [Leibniz] |
8764 | Categories are the best foundation for mathematics [Shapiro] |
13701 | A single second-order sentence validates all of arithmetic - but this can't be proved axiomatically [Sider] |
8762 | Two definitions of 3 in terms of sets disagree over whether 1 is a member of 3 [Shapiro] |
8760 | Numbers do not exist independently; the essence of a number is its relations to other numbers [Shapiro] |
8761 | A 'system' is related objects; a 'pattern' or 'structure' abstracts the pure relations from them [Shapiro] |
8744 | Logicism seems to be a non-starter if (as is widely held) logic has no ontology of its own [Shapiro] |
8749 | Term Formalism says mathematics is just about symbols - but real numbers have no names [Shapiro] |
8750 | Game Formalism is just a matter of rules, like chess - but then why is it useful in science? [Shapiro] |
8752 | Deductivism says mathematics is logical consequences of uninterpreted axioms [Shapiro] |
8753 | Critics resent the way intuitionism cripples mathematics, but it allows new important distinctions [Shapiro] |
8731 | Conceptualist are just realists or idealist or nominalists, depending on their view of concepts [Shapiro] |
8730 | 'Impredicative' definitions refer to the thing being described [Shapiro] |
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] |
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] |
8725 | Rationalism tries to apply mathematical methodology to all of knowledge [Shapiro] |