40 ideas
| 16943 | Philosophy is continuous with science, and has no external vantage point [Quine] |
| 10888 | Sets can be defined by 'enumeration', or by 'abstraction' (based on a property) [Zalabardo] |
| 10889 | The 'Cartesian Product' of two sets relates them by pairing every element with every element [Zalabardo] |
| 10890 | A 'partial ordering' is reflexive, antisymmetric and transitive [Zalabardo] |
| 10886 | Determinacy: an object is either in a set, or it isn't [Zalabardo] |
| 10887 | Specification: Determinate totals of objects always make a set [Zalabardo] |
| 10897 | A first-order 'sentence' is a formula with no free variables [Zalabardo] |
| 10893 | Γ |= φ for sentences if φ is true when all of Γ is true [Zalabardo] |
| 10899 | Γ |= φ if φ is true when all of Γ is true, for all structures and interpretations [Zalabardo] |
| 10896 | Propositional logic just needs ¬, and one of ∧, ∨ and → [Zalabardo] |
| 10898 | The semantics shows how truth values depend on instantiations of properties and relations [Zalabardo] |
| 10902 | We can do semantics by looking at given propositions, or by building new ones [Zalabardo] |
| 10892 | We make a truth assignment to T and F, which may be true and false, but merely differ from one another [Zalabardo] |
| 10900 | Logically true sentences are true in all structures [Zalabardo] |
| 10895 | 'Logically true' (|= φ) is true for every truth-assignment [Zalabardo] |
| 10901 | Some formulas are 'satisfiable' if there is a structure and interpretation that makes them true [Zalabardo] |
| 10894 | A sentence-set is 'satisfiable' if at least one truth-assignment makes them all true [Zalabardo] |
| 10903 | A structure models a sentence if it is true in the model, and a set of sentences if they are all true in the model [Zalabardo] |
| 16949 | Klein summarised geometry as grouped together by transformations [Quine] |
| 10891 | If a set is defined by induction, then proof by induction can be applied to it [Zalabardo] |
| 16939 | Mass terms just concern spread, but other terms involve both spread and individuation [Quine] |
| 16948 | Once we know the mechanism of a disposition, we can eliminate 'similarity' [Quine] |
| 16945 | We judge things to be soluble if they are the same kind as, or similar to, things that do dissolve [Quine] |
| 16944 | Science is common sense, with a sophisticated method [Quine] |
| 16940 | Induction is just more of the same: animal expectations [Quine] |
| 16941 | Induction relies on similar effects following from each cause [Quine] |
| 16933 | Grue is a puzzle because the notions of similarity and kind are dubious in science [Quine] |
| 7522 | A full neural account of qualia will give new epistemic access to them, beyond private experience [Churchlands] |
| 7521 | It is question-begging to assume that qualia are totally simple, hence irreducible [Churchlands] |
| 7523 | The qualia Hard Problem is easy, in comparison with the co-ordination of mental states [Churchlands] |
| 16934 | General terms depend on similarities among things [Quine] |
| 16938 | To learn yellow by observation, must we be told to look at the colour? [Quine] |
| 8486 | Standards of similarity are innate, and the spacing of qualities such as colours can be mapped [Quine] |
| 16947 | Similarity is just interchangeability in the cosmic machine [Quine] |
| 16932 | Projectible predicates can be universalised about the kind to which they refer [Quine] |
| 7375 | Quine probably regrets natural kinds now being treated as essences [Quine, by Dennett] |
| 16935 | If similarity has no degrees, kinds cannot be contained within one another [Quine] |
| 16936 | Comparative similarity allows the kind 'colored' to contain the kind 'red' [Quine] |
| 16937 | You can't base kinds just on resemblance, because chains of resemblance are a muddle [Quine] |
| 16942 | It is hard to see how regularities could be explained [Quine] |