35 ideas
| 18274 | Analysis complicates a statement, but only as far as the complexity of its meaning [Wittgenstein] |
| 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] |
| 23623 | Predicativism says only predicated sets exist [Hossack] |
| 23624 | The iterative conception has to appropriate Replacement, to justify the ordinals [Hossack] |
| 23625 | Limitation of Size justifies Replacement, but then has to appropriate Power Set [Hossack] |
| 16908 | We can dispense with self-evidence, if language itself prevents logical mistakes [Jeshion on Wittgenstein] |
| 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] |
| 18276 | A statement's logical form derives entirely from its constituents [Wittgenstein] |
| 6563 | 'And' and 'not' are non-referring terms, which do not represent anything [Wittgenstein, by Fogelin] |
| 10896 | Propositional logic just needs ¬, and one of ∧, ∨ and → [Zalabardo] |
| 23628 | The connective 'and' can have an order-sensitive meaning, as 'and then' [Hossack] |
| 23627 | 'Before' and 'after' are not two relations, but one relation with two orders [Hossack] |
| 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] |
| 10895 | 'Logically true' (|= φ) is true for every truth-assignment [Zalabardo] |
| 10900 | Logically true sentences are true in all structures [Zalabardo] |
| 10894 | A sentence-set is 'satisfiable' if at least one truth-assignment makes them all true [Zalabardo] |
| 10901 | Some formulas are 'satisfiable' if there is a structure and interpretation that makes them 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] |
| 23626 | Transfinite ordinals are needed in proof theory, and for recursive functions and computability [Hossack] |
| 10891 | If a set is defined by induction, then proof by induction can be applied to it [Zalabardo] |
| 23621 | Numbers are properties, not sets (because numbers are magnitudes) [Hossack] |
| 23622 | We can only mentally construct potential infinities, but maths needs actual infinities [Hossack] |
| 23472 | The sense of propositions relies on the world's basic logical structure [Wittgenstein] |
| 23500 | My main problem is the order of the world, and whether it is knowable a priori [Wittgenstein] |
| 22323 | The philosophical I is the metaphysical subject, the limit - not a part of the world [Wittgenstein] |
| 23481 | Propositions assemble a world experimentally, like the model of a road accident [Wittgenstein] |
| 4678 | Absolute prohibitions are the essence of ethics, and suicide is the most obvious example [Wittgenstein] |