104 ideas
| 13466 | We are all post-Kantians, because he set the current agenda for philosophy [Hart,WD] |
| 13477 | The problems are the monuments of philosophy [Hart,WD] |
| 13515 | To study abstract problems, some knowledge of set theory is essential [Hart,WD] |
| 11178 | The essence or definition of an essence involves either a class of properties or a class of propositions [Fine,K] |
| 13469 | Tarski showed how we could have a correspondence theory of truth, without using 'facts' [Hart,WD] |
| 13504 | Truth for sentences is satisfaction of formulae; for sentences, either all sequences satisfy it (true) or none do [Hart,WD] |
| 13503 | A first-order language has an infinity of T-sentences, which cannot add up to a definition of truth [Hart,WD] |
| 9535 | 'Contradictory' propositions always differ in truth-value [Lemmon] |
| 9509 | That proposition that both P and Q is their 'conjunction', written P∧Q [Lemmon] |
| 9508 | The sign |- may be read as 'therefore' [Lemmon] |
| 9514 | If A and B are 'interderivable' from one another we may write A -||- B [Lemmon] |
| 9511 | We write the conditional 'if P (antecedent) then Q (consequent)' as P→Q [Lemmon] |
| 9512 | We write the 'negation' of P (not-P) as ¬ [Lemmon] |
| 9510 | That proposition that either P or Q is their 'disjunction', written P∨Q [Lemmon] |
| 9513 | We write 'P if and only if Q' as P↔Q; it is also P iff Q, or (P→Q)∧(Q→P) [Lemmon] |
| 9516 | A 'well-formed formula' follows the rules for variables, ¬, →, ∧, ∨, and ↔ [Lemmon] |
| 9519 | A 'substitution-instance' is a wff formed by consistent replacing variables with wffs [Lemmon] |
| 9529 | A wff is 'inconsistent' if all assignments to variables result in the value F [Lemmon] |
| 9534 | Two propositions are 'equivalent' if they mirror one another's truth-value [Lemmon] |
| 9517 | The 'scope' of a connective is the connective, the linked formulae, and the brackets [Lemmon] |
| 9518 | A 'theorem' is the conclusion of a provable sequent with zero assumptions [Lemmon] |
| 9533 | A 'implies' B if B is true whenever A is true (so that A→B is tautologous) [Lemmon] |
| 9530 | A wff is 'contingent' if produces at least one T and at least one F [Lemmon] |
| 9532 | 'Subcontrary' propositions are never both false, so that A∨B is a tautology [Lemmon] |
| 9531 | 'Contrary' propositions are never both true, so that ¬(A∧B) is a tautology [Lemmon] |
| 9528 | A wff is a 'tautology' if all assignments to variables result in the value T [Lemmon] |
| 9399 | ∧E: Given A∧B, we may derive either A or B separately [Lemmon] |
| 9401 | ∨E: Derive C from A∨B, if C can be derived both from A and from B [Lemmon] |
| 9395 | MTT: Given ¬B and A→B, we derive ¬A [Lemmon] |
| 9398 | ∧I: Given A and B, we may derive A∧B [Lemmon] |
| 9394 | MPP: Given A and A→B, we may derive B [Lemmon] |
| 9396 | DN: Given A, we may derive ¬¬A [Lemmon] |
| 13500 | Conditional Proof: infer a conditional, if the consequent can be deduced from the antecedent [Hart,WD] |
| 9393 | A: we may assume any proposition at any stage [Lemmon] |
| 9400 | ∨I: Given either A or B separately, we may derive A∨B [Lemmon] |
| 9402 | RAA: If assuming A will prove B∧¬B, then derive ¬A [Lemmon] |
| 9397 | CP: Given a proof of B from A as assumption, we may derive A→B [Lemmon] |
| 9522 | 'Modus ponendo tollens' (MPT) says P, ¬(P ∧ Q) |- ¬Q [Lemmon] |
| 9526 | We can change conjunctions into negated conditionals with P→Q -||- ¬(P → ¬Q) [Lemmon] |
| 9527 | The Distributive Laws can rearrange a pair of conjunctions or disjunctions [Lemmon] |
| 9523 | De Morgan's Laws make negated conjunctions/disjunctions into non-negated disjunctions/conjunctions [Lemmon] |
| 9524 | We can change conditionals into disjunctions with P→Q -||- ¬P ∨ Q [Lemmon] |
| 9525 | We can change conditionals into negated conjunctions with P→Q -||- ¬(P ∧ ¬Q) [Lemmon] |
| 9521 | 'Modus tollendo ponens' (MTP) says ¬P, P ∨ Q |- Q [Lemmon] |
| 9537 | Truth-tables are good for showing invalidity [Lemmon] |
| 9538 | A truth-table test is entirely mechanical, but this won't work for more complex logic [Lemmon] |
| 9536 | If any of the nine rules of propositional logic are applied to tautologies, the result is a tautology [Lemmon] |
| 9539 | Propositional logic is complete, since all of its tautologous sequents are derivable [Lemmon] |
| 13909 | Write '(∀x)(...)' to mean 'take any x: then...', and '(∃x)(...)' to mean 'there is an x such that....' [Lemmon] |
| 13902 | 'Gm' says m has property G, and 'Pmn' says m has relation P to n [Lemmon] |
| 13911 | The 'symbols' are bracket, connective, term, variable, predicate letter, reverse-E [Lemmon] |
| 13910 | Our notation uses 'predicate-letters' (for 'properties'), 'variables', 'proper names', 'connectives' and 'quantifiers' [Lemmon] |
| 13904 | Universal Elimination (UE) lets us infer that an object has F, from all things having F [Lemmon] |
| 13901 | Predicate logic uses propositional connectives and variables, plus new introduction and elimination rules [Lemmon] |
| 13903 | Universal elimination if you start with the universal, introduction if you want to end with it [Lemmon] |
| 13906 | With finite named objects, we can generalise with &-Intro, but otherwise we need ∀-Intro [Lemmon] |
| 13908 | UE all-to-one; UI one-to-all; EI arbitrary-to-one; EE proof-to-one [Lemmon] |
| 13905 | If there is a finite domain and all objects have names, complex conjunctions can replace universal quantifiers [Lemmon] |
| 13900 | 'Some Frenchmen are generous' is rendered by (∃x)(Fx→Gx), and not with the conditional → [Lemmon] |
| 13502 | ∃y... is read as 'There exists an individual, call it y, such that...', and not 'There exists a y such that...' [Hart,WD] |
| 13456 | Set theory articulates the concept of order (through relations) [Hart,WD] |
| 13497 | Nowadays ZFC and NBG are the set theories; types are dead, and NF is only useful for the whole universe [Hart,WD] |
| 13443 | ∈ relates across layers, while ⊆ relates within layers [Hart,WD] |
| 13442 | Without the empty set we could not form a∩b without checking that a and b meet [Hart,WD] |
| 13493 | In the modern view, foundation is the heart of the way to do set theory [Hart,WD] |
| 13495 | Foundation Axiom: an nonempty set has a member disjoint from it [Hart,WD] |
| 13462 | With the Axiom of Choice every set can be well-ordered [Hart,WD] |
| 13461 | We can choose from finite and evident sets, but not from infinite opaque ones [Hart,WD] |
| 13516 | If we accept that V=L, it seems to settle all the open questions of set theory [Hart,WD] |
| 13441 | Naïve set theory has trouble with comprehension, the claim that every predicate has an extension [Hart,WD] |
| 13494 | The iterative conception may not be necessary, and may have fixed points or infinitely descending chains [Hart,WD] |
| 13460 | 'Well-ordering' must have a least member, so it does the natural numbers but not the integers [Hart,WD] |
| 13458 | A partial ordering becomes 'total' if any two members of its field are comparable [Hart,WD] |
| 13457 | A 'partial ordering' is irreflexive and transitive; the sets are ordered, but not the subsets [Hart,WD] |
| 13490 | Von Neumann defines α<β as α∈β [Hart,WD] |
| 13481 | Maybe sets should be rethought in terms of the even more basic categories [Hart,WD] |
| 9520 | The paradoxes of material implication are P |- Q → P, and ¬P |- P → Q [Lemmon] |
| 11175 | Logical concepts rest on certain inferences, not on facts about implications [Fine,K] |
| 11176 | The property of Property Abstraction says any suitable condition must imply a property [Fine,K] |
| 13506 | The universal quantifier can't really mean 'all', because there is no universal set [Hart,WD] |
| 11174 | A logical truth is true in virtue of the nature of the logical concepts [Fine,K] |
| 13505 | Model theory studies how set theory can model sets of sentences [Hart,WD] |
| 13511 | Model theory is mostly confined to first-order theories [Hart,WD] |
| 13513 | Models are ways the world might be from a first-order point of view [Hart,WD] |
| 13512 | Modern model theory begins with the proof of Los's Conjecture in 1962 [Hart,WD] |
| 13496 | First-order logic is 'compact': consequences of a set are consequences of a finite subset [Hart,WD] |
| 13484 | Berry's Paradox: we succeed in referring to a number, with a term which says we can't do that [Hart,WD] |
| 13482 | The Burali-Forti paradox is a crisis for Cantor's ordinals [Hart,WD] |
| 13507 | The machinery used to solve the Liar can be rejigged to produce a new Liar [Hart,WD] |
| 13459 | The less-than relation < well-orders, and partially orders, and totally orders the ordinal numbers [Hart,WD] |
| 13463 | There are at least as many infinite cardinals as transfinite ordinals (because they will map) [Hart,WD] |
| 13491 | The axiom of infinity with separation gives a least limit ordinal ω [Hart,WD] |
| 13492 | Von Neumann's ordinals generalise into the transfinite better, because Zermelo's ω is a singleton [Hart,WD] |
| 13446 | 19th century arithmetization of analysis isolated the real numbers from geometry [Hart,WD] |
| 13509 | We can establish truths about infinite numbers by means of induction [Hart,WD] |
| 13474 | Euclid has a unique parallel, spherical geometry has none, and saddle geometry has several [Hart,WD] |
| 13471 | Mathematics makes existence claims, but philosophers usually say those are never analytic [Hart,WD] |
| 13488 | Mass words do not have plurals, or numerical adjectives, or use 'fewer' [Hart,WD] |
| 11177 | Can the essence of an object circularly involve itself, or involve another object? [Fine,K] |
| 11173 | Being a man is a consequence of his essence, not constitutive of it [Fine,K] |
| 11179 | If there are alternative definitions, then we have three possibilities for essence [Fine,K] |
| 13480 | Fregean self-evidence is an intrinsic property of basic truths, rules and definitions [Hart,WD] |
| 13476 | The failure of key assumptions in geometry, mereology and set theory throw doubt on the a priori [Hart,WD] |
| 13475 | The Fregean concept of GREEN is a function assigning true to green things, and false to the rest [Hart,WD] |