13 ideas
| 8758 | We could talk of open sentences, instead of sets [Chihara, by Shapiro] |
| 10282 | Logic is the study of sound argument, or of certain artificial languages (or applying the latter to the former) [Hodges,W] |
| 10283 | A formula needs an 'interpretation' of its constants, and a 'valuation' of its variables [Hodges,W] |
| 10284 | There are three different standard presentations of semantics [Hodges,W] |
| 10285 | I |= φ means that the formula φ is true in the interpretation I [Hodges,W] |
| 10288 | Down Löwenheim-Skolem: if a countable language has a consistent theory, that has a countable model [Hodges,W] |
| 10289 | Up Löwenheim-Skolem: if infinite models, then arbitrarily large models [Hodges,W] |
| 10287 | If a first-order theory entails a sentence, there is a finite subset of the theory which entails it [Hodges,W] |
| 10286 | A 'set' is a mathematically well-behaved class [Hodges,W] |
| 10265 | Chihara's system is a variant of type theory, from which he can translate sentences [Chihara, by Shapiro] |
| 8759 | We can replace type theory with open sentences and a constructibility quantifier [Chihara, by Shapiro] |
| 10264 | Introduce a constructibility quantifiers (Cx)Φ - 'it is possible to construct an x such that Φ' [Chihara, by Shapiro] |
| 7482 | Resurrection developed in Judaism as a response to martyrdoms, in about 160 BCE [Anon (Dan), by Watson] |