103 ideas
| 17713 | After 1903, Husserl avoids metaphysical commitments [Mares] |
| 18781 | Inconsistency doesn't prevent us reasoning about some system [Mares] |
| 4456 | Epistemological Ockham's Razor demands good reasons, but the ontological version says reality is simple [Moreland] |
| 9535 | 'Contradictory' propositions always differ in truth-value [Lemmon] |
| 9511 | We write the conditional 'if P (antecedent) then Q (consequent)' as P→Q [Lemmon] |
| 9510 | That proposition that either P or Q is their 'disjunction', written P∨Q [Lemmon] |
| 9512 | We write the 'negation' of P (not-P) as ¬ [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] |
| 9514 | If A and B are 'interderivable' from one another we may write A -||- B [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] |
| 9516 | A 'well-formed formula' follows the rules for variables, ¬, →, ∧, ∨, and ↔ [Lemmon] |
| 9517 | The 'scope' of a connective is the connective, the linked formulae, and the brackets [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] |
| 9531 | 'Contrary' propositions are never both true, so that ¬(A∧B) is a tautology [Lemmon] |
| 9534 | Two propositions are 'equivalent' if they mirror one another's truth-value [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] |
| 9533 | A 'implies' B if B is true whenever A is true (so that A→B is tautologous) [Lemmon] |
| 9528 | A wff is a 'tautology' if all assignments to variables result in the value T [Lemmon] |
| 9518 | A 'theorem' is the conclusion of a provable sequent with zero assumptions [Lemmon] |
| 9398 | ∧I: Given A and B, we may derive A∧B [Lemmon] |
| 9397 | CP: Given a proof of B from A as assumption, we may derive A→B [Lemmon] |
| 9394 | MPP: Given A and A→B, we may derive B [Lemmon] |
| 9402 | RAA: If assuming A will prove B∧¬B, then derive ¬A [Lemmon] |
| 9395 | MTT: Given ¬B and A→B, we derive ¬A [Lemmon] |
| 9400 | ∨I: Given either A or B separately, we may derive A∨B [Lemmon] |
| 9401 | ∨E: Derive C from A∨B, if C can be derived both from A and from B [Lemmon] |
| 9396 | DN: Given A, we may derive ¬¬A [Lemmon] |
| 9393 | A: we may assume any proposition at any stage [Lemmon] |
| 9399 | ∧E: Given A∧B, we may derive either A or B separately [Lemmon] |
| 9521 | 'Modus tollendo ponens' (MTP) says ¬P, P ∨ Q |- Q [Lemmon] |
| 9522 | 'Modus ponendo tollens' (MPT) says P, ¬(P ∧ Q) |- ¬Q [Lemmon] |
| 9525 | We can change conditionals into negated conjunctions with P→Q -||- ¬(P ∧ ¬Q) [Lemmon] |
| 9524 | We can change conditionals into disjunctions with P→Q -||- ¬P ∨ Q [Lemmon] |
| 9523 | De Morgan's Laws make negated conjunctions/disjunctions into non-negated disjunctions/conjunctions [Lemmon] |
| 9527 | The Distributive Laws can rearrange a pair of conjunctions or disjunctions [Lemmon] |
| 9526 | We can change conjunctions into negated conditionals with P→Q -||- ¬(P → ¬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] |
| 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] |
| 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] |
| 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] |
| 18789 | Intuitionist logic looks best as natural deduction [Mares] |
| 18790 | Intuitionism as natural deduction has no rule for negation [Mares] |
| 18787 | Three-valued logic is useful for a theory of presupposition [Mares] |
| 18793 | Material implication (and classical logic) considers nothing but truth values for implications [Mares] |
| 18784 | In classical logic the connectives can be related elegantly, as in De Morgan's laws [Mares] |
| 9520 | The paradoxes of material implication are P |- Q → P, and ¬P |- P → Q [Lemmon] |
| 18786 | Excluded middle standardly implies bivalence; attacks use non-contradiction, De M 3, or double negation [Mares] |
| 18780 | Standard disjunction and negation force us to accept the principle of bivalence [Mares] |
| 18782 | The connectives are studied either through model theory or through proof theory [Mares] |
| 18783 | Many-valued logics lack a natural deduction system [Mares] |
| 18792 | Situation semantics for logics: not possible worlds, but information in situations [Mares] |
| 18785 | Consistency is semantic, but non-contradiction is syntactic [Mares] |
| 17715 | The truth of the axioms doesn't matter for pure mathematics, but it does for applied [Mares] |
| 17716 | Mathematics is relations between properties we abstract from experience [Mares] |
| 18788 | For intuitionists there are not numbers and sets, but processes of counting and collecting [Mares] |
| 4474 | Existence theories must match experience, possibility, logic and knowledge, and not be self-defeating [Moreland] |
| 4461 | Tropes are like Hume's 'impressions', conceived as real rather than as ideal [Moreland] |
| 4462 | A colour-trope cannot be simple (as required), because it is spread in space, and so it is complex [Moreland] |
| 4463 | In 'four colours were used in the decoration', colours appear to be universals, not tropes [Moreland] |
| 4451 | If properties are universals, what distinguishes two things which have identical properties? [Moreland] |
| 4453 | One realism is one-over-many, which may be the model/copy view, which has the Third Man problem [Moreland] |
| 4464 | Realists see properties as universals, which are single abstract entities which are multiply exemplifiable [Moreland] |
| 4449 | Evidence for universals can be found in language, communication, natural laws, classification and ideals [Moreland] |
| 4450 | The traditional problem of universals centres on the "One over Many", which is the unity of natural classes [Moreland] |
| 4454 | The One-In-Many view says universals have abstract existence, but exist in particulars [Moreland] |
| 4468 | How could 'being even', or 'being a father', or a musical interval, exist naturally in space? [Moreland] |
| 4452 | Maybe universals are real, if properties themselves have properties, and relate to other properties [Moreland] |
| 4467 | A naturalist and realist about universals is forced to say redness can be both moving and stationary [Moreland] |
| 4469 | There are spatial facts about red particulars, but not about redness itself [Moreland] |
| 4472 | Redness is independent of red things, can do without them, has its own properties, and has identity [Moreland] |
| 4459 | Moderate nominalism attempts to embrace the existence of properties while avoiding universals [Moreland] |
| 4458 | Unlike Class Nominalism, Resemblance Nominalism can distinguish natural from unnatural classes [Moreland] |
| 4457 | There can be predicates with no property, and there are properties with no predicate [Moreland] |
| 4471 | We should abandon the concept of a property since (unlike sets) their identity conditions are unclear [Moreland] |
| 4476 | Most philosophers think that the identity of indiscernibles is false [Moreland] |
| 17703 | Light in straight lines is contingent a priori; stipulated as straight, because they happen to be so [Mares] |
| 17714 | Aristotelians dislike the idea of a priori judgements from pure reason [Mares] |
| 17705 | Empiricists say rationalists mistake imaginative powers for modal insights [Mares] |
| 17700 | The most popular view is that coherent beliefs explain one another [Mares] |
| 17704 | Operationalism defines concepts by our ways of measuring them [Mares] |
| 4460 | Abstractions are formed by the mind when it concentrates on some, but not all, the features of a thing [Moreland] |
| 17710 | Aristotelian justification uses concepts abstracted from experience [Mares] |
| 4455 | It is always open to a philosopher to claim that some entity or other is unanalysable [Moreland] |
| 17706 | The essence of a concept is either its definition or its conceptual relations? [Mares] |
| 18791 | In 'situation semantics' our main concepts are abstracted from situations [Mares] |
| 17701 | Possible worlds semantics has a nice compositional account of modal statements [Mares] |
| 17702 | Unstructured propositions are sets of possible worlds; structured ones have components [Mares] |
| 17708 | Maybe space has points, but processes always need regions with a size [Mares] |
| 4473 | 'Presentism' is the view that only the present moment exists [Moreland] |