33 ideas
8472 | Sentential logic is consistent (no contradictions) and complete (entirely provable) [Orenstein] |
8476 | Axiomatization simply picks from among the true sentences a few to play a special role [Orenstein] |
8480 | S4: 'poss that poss that p' implies 'poss that p'; S5: 'poss that nec that p' implies 'nec that p' [Orenstein] |
10888 | Sets can be defined by 'enumeration', or by 'abstraction' (based on a property) [Zalabardo] |
8474 | Unlike elementary logic, set theory is not complete [Orenstein] |
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] |
8465 | Mereology has been exploited by some nominalists to achieve the effects of set theory [Orenstein] |
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] |
10896 | Propositional logic just needs ¬, and one of ∧, ∨ and → [Zalabardo] |
8452 | Traditionally, universal sentences had existential import, but were later treated as conditional claims [Orenstein] |
8475 | The substitution view of quantification says a sentence is true when there is a substitution instance [Orenstein] |
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] |
9159 | You can't simply convert geometry into algebra, as some spatial content is lost [Burge] |
8454 | The whole numbers are 'natural'; 'rational' numbers include fractions; the 'reals' include root-2 etc. [Orenstein] |
10891 | If a set is defined by induction, then proof by induction can be applied to it [Zalabardo] |
8473 | The logicists held that is-a-member-of is a logical constant, making set theory part of logic [Orenstein] |
8458 | Just individuals in Nominalism; add sets for Extensionalism; add properties, concepts etc for Intensionalism [Orenstein] |
8457 | The Principle of Conservatism says we should violate the minimum number of background beliefs [Orenstein] |
8477 | People presume meanings exist because they confuse meaning and reference [Orenstein] |
8471 | Three ways for 'Socrates is human' to be true are nominalist, platonist, or Montague's way [Orenstein] |
8484 | If two people believe the same proposition, this implies the existence of propositions [Orenstein] |