34 ideas
| 4036 | What matters is not how many entities we postulate, but how many kinds of entities [Armstrong, by Mellor/Oliver] |
| 15527 | Defining terms either enables elimination, or shows that they don't require elimination [Lewis] |
| 13838 | A decent modern definition should always imply a semantics [Hacking] |
| 13834 | Gentzen's Cut Rule (or transitivity of deduction) is 'If A |- B and B |- C, then A |- C' [Hacking] |
| 13835 | Only Cut reduces complexity, so logic is constructive without it, and it can be dispensed with [Hacking] |
| 13833 | 'Thinning' ('dilution') is the key difference between deduction (which allows it) and induction [Hacking] |
| 13845 | The various logics are abstractions made from terms like 'if...then' in English [Hacking] |
| 13840 | First-order logic is the strongest complete compact theory with Löwenheim-Skolem [Hacking] |
| 13844 | A limitation of first-order logic is that it cannot handle branching quantifiers [Hacking] |
| 13842 | Second-order completeness seems to need intensional entities and possible worlds [Hacking] |
| 13837 | With a pure notion of truth and consequence, the meanings of connectives are fixed syntactically [Hacking] |
| 13839 | Perhaps variables could be dispensed with, by arrows joining places in the scope of quantifiers [Hacking] |
| 13843 | If it is a logic, the Löwenheim-Skolem theorem holds for it [Hacking] |
| 15754 | Without properties we would be unable to express the laws of nature [Armstrong] |
| 4034 | Whether we apply 'cold' or 'hot' to an object is quite separate from its change of temperature [Armstrong] |
| 8535 | To the claim that every predicate has a property, start by eliminating failure of application of predicate [Armstrong] |
| 8537 | Tropes fall into classes, because exact similarity is symmetrical and transitive [Armstrong] |
| 8538 | Trope theory needs extra commitments, to symmetry and non-transitivity, unless resemblance is exact [Armstrong] |
| 8539 | Universals are required to give a satisfactory account of the laws of nature [Armstrong] |
| 8529 | Deniers of properties and relations rely on either predicates or on classes [Armstrong] |
| 8532 | Resemblances must be in certain 'respects', and they seem awfully like properties [Armstrong] |
| 8530 | Change of temperature in objects is quite independent of the predicates 'hot' and 'cold' [Armstrong] |
| 8536 | We want to know what constituents of objects are grounds for the application of predicates [Armstrong] |
| 8531 | In most sets there is no property common to all the members [Armstrong] |
| 15753 | Essences might support Resemblance Nominalism, but they are too coarse and ill-defined [Armstrong] |
| 15530 | A logically determinate name names the same thing in every possible world [Lewis] |
| 15531 | The Ramsey sentence of a theory says that it has at least one realisation [Lewis] |
| 15528 | A Ramsey sentence just asserts that a theory can be realised, without saying by what [Lewis] |
| 15526 | There is a method for defining new scientific terms just using the terms we already understand [Lewis] |
| 15529 | It is better to have one realisation of a theory than many - but it may not always be possible [Lewis] |
| 8533 | Predicates need ontological correlates to ensure that they apply [Armstrong] |
| 4035 | There must be some explanation of why certain predicates are applicable to certain objects [Armstrong] |
| 8540 | The introduction of sparse properties avoids the regularity theory's problem with 'grue' [Armstrong] |
| 8541 | Regularities theories are poor on causal connections, counterfactuals and probability [Armstrong] |