61 ideas
| 10170 | While true-in-a-model seems relative, true-in-all-models seems not to be [Reck/Price] |
| 10987 | Three traditional names of rules are 'Simplification', 'Addition' and 'Disjunctive Syllogism' [Read] |
| 11004 | Necessity is provability in S4, and true in all worlds in S5 [Read] |
| 11018 | There are fuzzy predicates (and sets), and fuzzy quantifiers and modifiers [Read] |
| 11011 | Same say there are positive, negative and neuter free logics [Read] |
| 10166 | ZFC set theory has only 'pure' sets, without 'urelements' [Reck/Price] |
| 11020 | Realisms like the full Comprehension Principle, that all good concepts determine sets [Read] |
| 10986 | Not all validity is captured in first-order logic [Read] |
| 10972 | The non-emptiness of the domain is characteristic of classical logic [Read] |
| 11024 | Semantics must precede proof in higher-order logics, since they are incomplete [Read] |
| 10985 | We should exclude second-order logic, precisely because it captures arithmetic [Read] |
| 10970 | A theory of logical consequence is a conceptual analysis, and a set of validity techniques [Read] |
| 10984 | Logical consequence isn't just a matter of form; it depends on connections like round-square [Read] |
| 10973 | A theory is logically closed, which means infinite premisses [Read] |
| 11007 | Quantifiers are second-order predicates [Read] |
| 10175 | Three types of variable in second-order logic, for objects, functions, and predicates/sets [Reck/Price] |
| 10978 | In second-order logic the higher-order variables range over all the properties of the objects [Read] |
| 10971 | A logical truth is the conclusion of a valid inference with no premisses [Read] |
| 10988 | Any first-order theory of sets is inadequate [Read] |
| 10975 | Compactness does not deny that an inference can have infinitely many premisses [Read] |
| 10974 | Compactness is when any consequence of infinite propositions is the consequence of a finite subset [Read] |
| 10977 | Compactness blocks the proof of 'for every n, A(n)' (as the proof would be infinite) [Read] |
| 10976 | Compactness makes consequence manageable, but restricts expressive power [Read] |
| 11014 | Self-reference paradoxes seem to arise only when falsity is involved [Read] |
| 10165 | 'Analysis' is the theory of the real numbers [Reck/Price] |
| 11025 | Infinite cuts and successors seems to suggest an actual infinity there waiting for us [Read] |
| 10174 | Mereological arithmetic needs infinite objects, and function definitions [Reck/Price] |
| 10980 | Second-order arithmetic covers all properties, ensuring categoricity [Read] |
| 10164 | Peano Arithmetic can have three second-order axioms, plus '1' and 'successor' [Reck/Price] |
| 10979 | Although second-order arithmetic is incomplete, it can fully model normal arithmetic [Read] |
| 10997 | Von Neumann numbers are helpful, but don't correctly describe numbers [Read] |
| 10172 | Set-theory gives a unified and an explicit basis for mathematics [Reck/Price] |
| 10167 | Structuralism emerged from abstract algebra, axioms, and set theory and its structures [Reck/Price] |
| 10169 | Relativist Structuralism just stipulates one successful model as its arithmetic [Reck/Price] |
| 10179 | There are 'particular' structures, and 'universal' structures (what the former have in common) [Reck/Price] |
| 10181 | Pattern Structuralism studies what isomorphic arithmetic models have in common [Reck/Price] |
| 10182 | There are Formalist, Relativist, Universalist and Pattern structuralism [Reck/Price] |
| 10168 | Formalist Structuralism says the ontology is vacuous, or formal, or inference relations [Reck/Price] |
| 10178 | Maybe we should talk of an infinity of 'possible' objects, to avoid arithmetic being vacuous [Reck/Price] |
| 10176 | Universalist Structuralism is based on generalised if-then claims, not one particular model [Reck/Price] |
| 10177 | Universalist Structuralism eliminates the base element, as a variable, which is then quantified out [Reck/Price] |
| 10171 | The existence of an infinite set is assumed by Relativist Structuralism [Reck/Price] |
| 11016 | Would a language without vagueness be usable at all? [Read] |
| 11019 | Supervaluations say there is a cut-off somewhere, but at no particular place [Read] |
| 11012 | A 'supervaluation' gives a proposition consistent truth-value for classical assignments [Read] |
| 11013 | Identities and the Indiscernibility of Identicals don't work with supervaluations [Read] |
| 10173 | A nominalist might avoid abstract objects by just appealing to mereological sums [Reck/Price] |
| 10995 | A haecceity is a set of individual properties, essential to each thing [Read] |
| 11001 | Equating necessity with truth in every possible world is the S5 conception of necessity [Read] |
| 11017 | Some people even claim that conditionals do not express propositions [Read] |
| 10989 | The standard view of conditionals is that they are truth-functional [Read] |
| 10992 | The point of conditionals is to show that one will accept modus ponens [Read] |
| 10983 | Knowledge of possible worlds is not causal, but is an ontology entailed by semantics [Read] |
| 10982 | How can modal Platonists know the truth of a modal proposition? [Read] |
| 10996 | Actualism is reductionist (to parts of actuality), or moderate realist (accepting real abstractions) [Read] |
| 10981 | A possible world is a determination of the truth-values of all propositions of a domain [Read] |
| 11000 | If worlds are concrete, objects can't be present in more than one, and can only have counterparts [Read] |
| 14366 | An explanation is a table of statistical information [Salmon, by Strevens] |
| 10998 | The mind abstracts ways things might be, which are nonetheless real [Read] |
| 11005 | Negative existentials with compositionality make the whole sentence meaningless [Read] |
| 10966 | A proposition objectifies what a sentence says, as indicative, with secure references [Read] |