110 ideas
| 10237 | Coherence is a primitive, intuitive notion, not reduced to something formal [Shapiro] |
| 10204 | An 'implicit definition' gives a direct description of the relations of an entity [Shapiro] |
| 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] |
| 10206 | Modal operators are usually treated as quantifiers [Shapiro] |
| 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] |
| 10208 | Axiom of Choice: some function has a value for every set in a given set [Shapiro] |
| 10252 | The Axiom of Choice seems to license an infinite amount of choosing [Shapiro] |
| 10207 | Anti-realists reject set theory [Shapiro] |
| 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] |
| 10259 | The two standard explanations of consequence are semantic (in models) and deductive [Shapiro] |
| 13722 | A 'theorem' is an axiom, or the last line of a legitimate proof [Sider] |
| 10257 | Intuitionism only sanctions modus ponens if all three components are proved [Shapiro] |
| 10253 | Either logic determines objects, or objects determine logic, or they are separate [Shapiro] |
| 10251 | The law of excluded middle might be seen as a principle of omniscience [Shapiro] |
| 10212 | Classical connectives differ from their ordinary language counterparts; '∧' is timeless, unlike 'and' [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] |
| 10209 | A function is just an arbitrary correspondence between collections [Shapiro] |
| 13703 | λ can treat 'is cold and hungry' as a single predicate [Sider] |
| 10268 | Maybe plural quantifiers should be understood in terms of classes or sets [Shapiro] |
| 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] |
| 10235 | A sentence is 'satisfiable' if it has a model [Shapiro] |
| 13724 | In model theory, first define truth, then validity as truth in all models, and consequence as truth-preservation [Sider] |
| 10239 | The central notion of model theory is the relation of 'satisfaction' [Shapiro] |
| 10240 | Model theory deals with relations, reference and extensions [Shapiro] |
| 10214 | Theory ontology is never complete, but is only determined 'up to isomorphism' [Shapiro] |
| 10238 | The set-theoretical hierarchy contains as many isomorphism types as possible [Shapiro] |
| 10234 | Any theory with an infinite model has a model of every infinite cardinality [Shapiro] |
| 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] |
| 10201 | Virtually all of mathematics can be modeled in set theory [Shapiro] |
| 10213 | Real numbers are thought of as either Cauchy sequences or Dedekind cuts [Shapiro] |
| 18243 | Understanding the real-number structure is knowing usage of the axiomatic language of analysis [Shapiro] |
| 18245 | Cuts are made by the smallest upper or largest lower number, some of them not rational [Shapiro] |
| 10236 | There is no grounding for mathematics that is more secure than mathematics [Shapiro] |
| 10256 | For intuitionists, proof is inherently informal [Shapiro] |
| 10202 | Natural numbers just need an initial object, successors, and an induction principle [Shapiro] |
| 13701 | A single second-order sentence validates all of arithmetic - but this can't be proved axiomatically [Sider] |
| 10205 | Mathematics originally concerned the continuous (geometry) and the discrete (arithmetic) [Shapiro] |
| 10222 | Mathematical foundations may not be sets; categories are a popular rival [Shapiro] |
| 10218 | Baseball positions and chess pieces depend entirely on context [Shapiro] |
| 10224 | The even numbers have the natural-number structure, with 6 playing the role of 3 [Shapiro] |
| 10228 | Could infinite structures be apprehended by pattern recognition? [Shapiro] |
| 10230 | The 4-pattern is the structure common to all collections of four objects [Shapiro] |
| 10249 | The main mathematical structures are algebraic, ordered, and topological [Shapiro] |
| 10273 | Some structures are exemplified by both abstract and concrete [Shapiro] |
| 10276 | Mathematical structures are defined by axioms, or in set theory [Shapiro] |
| 10270 | The main versions of structuralism are all definitionally equivalent [Shapiro] |
| 10221 | Is there is no more to structures than the systems that exemplify them? [Shapiro] |
| 10248 | Number statements are generalizations about number sequences, and are bound variables [Shapiro] |
| 10220 | Because one structure exemplifies several systems, a structure is a one-over-many [Shapiro] |
| 10223 | There is no 'structure of all structures', just as there is no set of all sets [Shapiro] |
| 8703 | Shapiro's structuralism says model theory (comparing structures) is the essence of mathematics [Shapiro, by Friend] |
| 10274 | Does someone using small numbers really need to know the infinite structure of arithmetic? [Shapiro] |
| 10200 | We distinguish realism 'in ontology' (for objects), and 'in truth-value' (for being either true or false) [Shapiro] |
| 10210 | If mathematical objects are accepted, then a number of standard principles will follow [Shapiro] |
| 10215 | Platonists claim we can state the essence of a number without reference to the others [Shapiro] |
| 10233 | Platonism must accept that the Peano Axioms could all be false [Shapiro] |
| 10244 | Intuition is an outright hindrance to five-dimensional geometry [Shapiro] |
| 10280 | A stone is a position in some pattern, and can be viewed as an object, or as a location [Shapiro] |
| 10254 | Can the ideal constructor also destroy objects? [Shapiro] |
| 10255 | Presumably nothing can block a possible dynamic operation? [Shapiro] |
| 10279 | Can we discover whether a deck is fifty-two cards, or a person is time-slices or molecules? [Shapiro] |
| 10227 | The abstract/concrete boundary now seems blurred, and would need a defence [Shapiro] |
| 10226 | Mathematicians regard arithmetic as concrete, and group theory as abstract [Shapiro] |
| 10262 | Fictionalism eschews the abstract, but it still needs the possible (without model theory) [Shapiro] |
| 10277 | Structuralism blurs the distinction between mathematical and ordinary objects [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] |
| 10272 | The notion of 'object' is at least partially structural and mathematical [Shapiro] |
| 10275 | A blurry border is still a border [Shapiro] |
| 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] |
| 10258 | Logical modalities may be acceptable, because they are reducible to satisfaction in models [Shapiro] |
| 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] |
| 10266 | Why does the 'myth' of possible worlds produce correct modal logic? [Shapiro] |
| 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] |
| 1556 | By nature people are close to one another, but culture drives them apart [Hippias] |
| 10203 | We apprehend small, finite mathematical structures by abstraction from patterns [Shapiro] |
| 10229 | Simple types can be apprehended through their tokens, via abstraction [Shapiro] |
| 10217 | We can apprehend structures by focusing on or ignoring features of patterns [Shapiro] |
| 9554 | We can focus on relations between objects (like baseballers), ignoring their other features [Shapiro] |
| 10231 | Abstract objects might come by abstraction over an equivalence class of base entities [Shapiro] |