86 ideas
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] |
18074 | Intuitionists rely on assertability instead of truth, but assertability relies on truth [Kitcher] |
9520 | The paradoxes of material implication are P |- Q → P, and ¬P |- P → Q [Lemmon] |
6298 | Kitcher says maths is an idealisation of the world, and our operations in dealing with it [Kitcher, by Resnik] |
12392 | Mathematical a priorism is conceptualist, constructivist or realist [Kitcher] |
18078 | The interest or beauty of mathematics is when it uses current knowledge to advance undestanding [Kitcher] |
12426 | The 'beauty' or 'interest' of mathematics is just explanatory power [Kitcher] |
12395 | Real numbers stand to measurement as natural numbers stand to counting [Kitcher] |
12425 | Complex numbers were only accepted when a geometrical model for them was found [Kitcher] |
18071 | A one-operation is the segregation of a single object [Kitcher] |
18066 | The old view is that mathematics is useful in the world because it describes the world [Kitcher] |
18083 | With infinitesimals, you divide by the time, then set the time to zero [Kitcher] |
18061 | Mathematical intuition is not the type platonism needs [Kitcher] |
12420 | If mathematics comes through intuition, that is either inexplicable, or too subjective [Kitcher] |
12393 | Intuition is no basis for securing a priori knowledge, because it is fallible [Kitcher] |
12387 | Mathematical knowledge arises from basic perception [Kitcher] |
12412 | My constructivism is mathematics as an idealization of collecting and ordering objects [Kitcher] |
18065 | We derive limited mathematics from ordinary things, and erect powerful theories on their basis [Kitcher] |
18077 | The defenders of complex numbers had to show that they could be expressed in physical terms [Kitcher] |
12423 | Analyticity avoids abstract entities, but can there be truth without reference? [Kitcher] |
18069 | Arithmetic is an idealizing theory [Kitcher] |
18068 | Arithmetic is made true by the world, but is also made true by our constructions [Kitcher] |
18070 | We develop a language for correlations, and use it to perform higher level operations [Kitcher] |
18072 | Constructivism is ontological (that it is the work of an agent) and epistemological (knowable a priori) [Kitcher] |
18063 | Conceptualists say we know mathematics a priori by possessing mathematical concepts [Kitcher] |
18064 | If meaning makes mathematics true, you still need to say what the meanings refer to [Kitcher] |
18067 | Abstract objects were a bad way of explaining the structure in mathematics [Kitcher] |
12390 | A priori knowledge comes from available a priori warrants that produce truth [Kitcher] |
12418 | In long mathematical proofs we can't remember the original a priori basis [Kitcher] |
12389 | Knowledge is a priori if the experience giving you the concepts thus gives you the knowledge [Kitcher] |
12416 | We have some self-knowledge a priori, such as knowledge of our own existence [Kitcher] |
12413 | A 'warrant' is a process which ensures that a true belief is knowledge [Kitcher] |
20473 | If experiential can defeat a belief, then its justification depends on the defeater's absence [Kitcher, by Casullo] |
18075 | Idealisation trades off accuracy for simplicity, in varying degrees [Kitcher] |
13304 | Learned men gain more in one day than others do in a lifetime [Posidonius] |
20820 | Time is an interval of motion, or the measure of speed [Posidonius, by Stobaeus] |