115 ideas
| 8868 | Objective truth arises from interpersonal communication [Davidson] |
| 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] |
| 9738 | Each line of a truth table is a model [Fitting/Mendelsohn] |
| 10206 | Modal operators are usually treated as quantifiers [Shapiro] |
| 9727 | Modal logic adds □ (necessarily) and ◊ (possibly) to classical logic [Fitting/Mendelsohn] |
| 9726 | We let 'R' be the accessibility relation: xRy is read 'y is accessible from x' [Fitting/Mendelsohn] |
| 9737 | The symbol ||- is the 'forcing' relation; 'Γ ||- P' means that P is true in world Γ [Fitting/Mendelsohn] |
| 13136 | The prefix σ names a possible world, and σ.n names a world accessible from that one [Fitting/Mendelsohn] |
| 13727 | A 'constant' domain is the same for all worlds; 'varying' domains can be entirely separate [Fitting/Mendelsohn] |
| 9734 | Modern modal logic introduces 'accessibility', saying xRy means 'y is accessible from x' [Fitting/Mendelsohn] |
| 9736 | A 'model' is a frame plus specification of propositions true at worlds, written < G,R,||- > [Fitting/Mendelsohn] |
| 9735 | A 'frame' is a set G of possible worlds, with an accessibility relation R, written < G,R > [Fitting/Mendelsohn] |
| 9741 | Accessibility relations can be 'reflexive' (self-referring), 'transitive' (carries over), or 'symmetric' (mutual) [Fitting/Mendelsohn] |
| 13149 | S5: a) if n ◊X then kX b) if n ¬□X then k ¬X c) if n □X then k X d) if n ¬◊X then k ¬X [Fitting/Mendelsohn] |
| 13141 | Negation: if σ ¬¬X then σ X [Fitting/Mendelsohn] |
| 13138 | Disj: a) if σ ¬(X∨Y) then σ ¬X and σ ¬Y b) if σ X∨Y then σ X or σ Y [Fitting/Mendelsohn] |
| 13142 | Existential: a) if σ ◊X then σ.n X b) if σ ¬□X then σ.n ¬X [n is new] [Fitting/Mendelsohn] |
| 13144 | T reflexive: a) if σ □X then σ X b) if σ ¬◊X then σ ¬X [Fitting/Mendelsohn] |
| 13145 | D serial: a) if σ □X then σ ◊X b) if σ ¬◊X then σ ¬□X [Fitting/Mendelsohn] |
| 13146 | B symmetric: a) if σ.n □X then σ X b) if σ.n ¬◊X then σ ¬X [n occurs] [Fitting/Mendelsohn] |
| 13147 | 4 transitive: a) if σ □X then σ.n □X b) if σ ¬◊X then σ.n ¬◊X [n occurs] [Fitting/Mendelsohn] |
| 13148 | 4r rev-trans: a) if σ.n □X then σ □X b) if σ.n ¬◊X then σ ¬◊X [n occurs] [Fitting/Mendelsohn] |
| 9740 | If a proposition is possibly true in a world, it is true in some world accessible from that world [Fitting/Mendelsohn] |
| 9739 | If a proposition is necessarily true in a world, it is true in all worlds accessible from that world [Fitting/Mendelsohn] |
| 13137 | Conj: a) if σ X∧Y then σ X and σ Y b) if σ ¬(X∧Y) then σ ¬X or σ ¬Y [Fitting/Mendelsohn] |
| 13140 | Bicon: a)if σ(X↔Y) then σ(X→Y) and σ(Y→X) b) [not biconditional, one or other fails] [Fitting/Mendelsohn] |
| 13139 | Implic: a) if σ ¬(X→Y) then σ X and σ ¬Y b) if σ X→Y then σ ¬X or σ Y [Fitting/Mendelsohn] |
| 13143 | Universal: a) if σ ¬◊X then σ.m ¬X b) if σ □X then σ.m X [m exists] [Fitting/Mendelsohn] |
| 9742 | The system K has no accessibility conditions [Fitting/Mendelsohn] |
| 13114 | □P → P is not valid in D (Deontic Logic), since an obligatory action may be not performed [Fitting/Mendelsohn] |
| 9743 | The system D has the 'serial' conditon imposed on its accessibility relation [Fitting/Mendelsohn] |
| 9744 | The system T has the 'reflexive' conditon imposed on its accessibility relation [Fitting/Mendelsohn] |
| 9746 | The system K4 has the 'transitive' condition on its accessibility relation [Fitting/Mendelsohn] |
| 9745 | The system B has the 'reflexive' and 'symmetric' conditions on its accessibility relation [Fitting/Mendelsohn] |
| 9747 | The system S4 has the 'reflexive' and 'transitive' conditions on its accessibility relation [Fitting/Mendelsohn] |
| 9748 | System S5 has the 'reflexive', 'symmetric' and 'transitive' conditions on its accessibility relation [Fitting/Mendelsohn] |
| 9404 | Modality affects content, because P→◊P is valid, but ◊P→P isn't [Fitting/Mendelsohn] |
| 13112 | In epistemic logic knowers are logically omniscient, so they know that they know [Fitting/Mendelsohn] |
| 13111 | Read epistemic box as 'a knows/believes P' and diamond as 'for all a knows/believes, P' [Fitting/Mendelsohn] |
| 13113 | F: will sometime, P: was sometime, G: will always, H: was always [Fitting/Mendelsohn] |
| 13728 | The Barcan says nothing comes into existence; the Converse says nothing ceases; the pair imply stability [Fitting/Mendelsohn] |
| 13729 | The Barcan corresponds to anti-monotonicity, and the Converse to monotonicity [Fitting/Mendelsohn] |
| 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] |
| 10259 | The two standard explanations of consequence are semantic (in models) and deductive [Shapiro] |
| 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] |
| 10209 | A function is just an arbitrary correspondence between collections [Shapiro] |
| 9725 | 'Predicate abstraction' abstracts predicates from formulae, giving scope for constants and functions [Fitting/Mendelsohn] |
| 10268 | Maybe plural quantifiers should be understood in terms of classes or sets [Shapiro] |
| 10235 | A sentence is 'satisfiable' if it has a model [Shapiro] |
| 10240 | Model theory deals with relations, reference and extensions [Shapiro] |
| 10239 | The central notion of model theory is the relation of 'satisfaction' [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] |
| 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] |
| 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] |
| 10272 | The notion of 'object' is at least partially structural and mathematical [Shapiro] |
| 10275 | A blurry border is still a border [Shapiro] |
| 13730 | The Indiscernibility of Identicals has been a big problem for modal logic [Fitting/Mendelsohn] |
| 10258 | Logical modalities may be acceptable, because they are reducible to satisfaction in models [Shapiro] |
| 10266 | Why does the 'myth' of possible worlds produce correct modal logic? [Shapiro] |
| 13725 | □ must be sensitive as to whether it picks out an object by essential or by contingent properties [Fitting/Mendelsohn] |
| 13731 | Objects retain their possible properties across worlds, so a bundle theory of them seems best [Fitting/Mendelsohn] |
| 13726 | Counterpart relations are neither symmetric nor transitive, so there is no logic of equality for them [Fitting/Mendelsohn] |
| 8867 | A belief requires understanding the distinctions of true-and-false, and appearance-and-reality [Davidson] |
| 10347 | Objectivity is intersubjectivity [Davidson] |
| 8866 | If we know other minds through behaviour, but not our own, we should assume they aren't like me [Davidson] |
| 10346 | Knowing other minds rests on knowing both one's own mind and the external world [Davidson, by Dummett] |
| 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] |
| 8870 | Content of thought is established through communication, so knowledge needs other minds [Davidson] |
| 8869 | The principle of charity attributes largely consistent logic and largely true beliefs to speakers [Davidson] |