28 ideas
9470 | Modal logic is not an extensional language [Parsons,C] |
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] |
13418 | The old problems with the axiom of choice are probably better ascribed to the law of excluded middle [Parsons,C] |
10887 | Specification: Determinate totals of objects always make a set [Zalabardo] |
10897 | A first-order 'sentence' is a formula with no free variables [Zalabardo] |
10899 | Γ |= φ if φ is true when all of Γ is true, for all structures and interpretations [Zalabardo] |
10893 | Γ |= φ for sentences if φ is true when all of Γ is true [Zalabardo] |
10896 | Propositional logic just needs ¬, and one of ∧, ∨ and → [Zalabardo] |
9469 | Substitutional existential quantifier may explain the existence of linguistic entities [Parsons,C] |
9468 | On the substitutional interpretation, '(∃x) Fx' is true iff a closed term 't' makes Ft true [Parsons,C] |
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] |
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] |
17447 | Parsons says counting is tagging as first, second, third..., and converting the last to a cardinal [Parsons,C, by Heck] |
10891 | If a set is defined by induction, then proof by induction can be applied to it [Zalabardo] |
18201 | General principles can be obvious in mathematics, but bold speculations in empirical science [Parsons,C] |
13419 | If functions are transfinite objects, finitists can have no conception of them [Parsons,C] |
13417 | If a mathematical structure is rejected from a physical theory, it retains its mathematical status [Parsons,C] |
21912 | Fichte, Schelling and Hegel rejected transcendental idealism [Lewis,PB] |
21911 | Fichte, Hegel and Schelling developed versions of Absolute Idealism [Lewis,PB] |