83 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] |
18835 | Logic doesn't have a metaphysical basis, but nor can logic give rise to the metaphysics [Rumfitt] |
13515 | To study abstract problems, some knowledge of set theory is essential [Hart,WD] |
15927 | Definition just needs negation, known variables, conjunction, disjunction, substitution and quantification [Weyl, by Lavine] |
18819 | The idea that there are unrecognised truths is basic to our concept of truth [Rumfitt] |
18826 | 'True at a possibility' means necessarily true if what is said had obtained [Rumfitt] |
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] |
18803 | Semantics for propositions: 1) validity preserves truth 2) non-contradition 3) bivalence 4) truth tables [Rumfitt] |
13500 | Conditional Proof: infer a conditional, if the consequent can be deduced from the antecedent [Hart,WD] |
13502 | ∃y... is read as 'There exists an individual, call it y, such that...', and not 'There exists a y such that...' [Hart,WD] |
18814 | 'Absolute necessity' would have to rest on S5 [Rumfitt] |
18798 | It is the second-order part of intuitionistic logic which actually negates some classical theorems [Rumfitt] |
18799 | Intuitionists can accept Double Negation Elimination for decidable propositions [Rumfitt] |
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] |
18830 | Most set theorists doubt bivalence for the Continuum Hypothesis, but still use classical logic [Rumfitt] |
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] |
18843 | The iterated conception of set requires continual increase in axiom strength [Rumfitt] |
18836 | A set may well not consist of its members; the empty set, for example, is a problem [Rumfitt] |
18837 | A set can be determinate, because of its concept, and still have vague membership [Rumfitt] |
18845 | If the totality of sets is not well-defined, there must be doubt about the Power Set Axiom [Rumfitt] |
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] |
13461 | We can choose from finite and evident sets, but not from infinite opaque ones [Hart,WD] |
13462 | With the Axiom of Choice every set can be well-ordered [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] |
13457 | A 'partial ordering' is irreflexive and transitive; the sets are ordered, but not the subsets [Hart,WD] |
13458 | A partial ordering becomes 'total' if any two members of its field are comparable [Hart,WD] |
13460 | 'Well-ordering' must have a least member, so it does the natural numbers but not the integers [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] |
18815 | Logic is higher-order laws which can expand the range of any sort of deduction [Rumfitt] |
18804 | The case for classical logic rests on its rules, much more than on the Principle of Bivalence [Rumfitt] |
18805 | Classical logic rules cannot be proved, but various lines of attack can be repelled [Rumfitt] |
18827 | If truth-tables specify the connectives, classical logic must rely on Bivalence [Rumfitt] |
18813 | Logical consequence is a relation that can extended into further statements [Rumfitt] |
18808 | Normal deduction presupposes the Cut Law [Rumfitt] |
18840 | When faced with vague statements, Bivalence is not a compelling principle [Rumfitt] |
18802 | In specifying a logical constant, use of that constant is quite unavoidable [Rumfitt] |
13506 | The universal quantifier can't really mean 'all', because there is no universal set [Hart,WD] |
18800 | Introduction rules give deduction conditions, and Elimination says what can be deduced [Rumfitt] |
18809 | Logical truths are just the assumption-free by-products of logical rules [Rumfitt] |
13512 | Modern model theory begins with the proof of Los's Conjecture in 1962 [Hart,WD] |
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] |
13496 | First-order logic is 'compact': consequences of a set are consequences of a finite subset [Hart,WD] |
18807 | Monotonicity means there is a guarantee, rather than mere inductive support [Rumfitt] |
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] |
13491 | The axiom of infinity with separation gives a least limit ordinal ω [Hart,WD] |
18842 | Maybe an ordinal is a property of isomorphic well-ordered sets, and not itself a set [Rumfitt] |
13463 | There are at least as many infinite cardinals as transfinite ordinals (because they will map) [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] |
18834 | Infinitesimals do not stand in a determinate order relation to zero [Rumfitt] |
18846 | Cantor and Dedekind aimed to give analysis a foundation in set theory (rather than geometry) [Rumfitt] |
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] |
18839 | An object that is not clearly red or orange can still be red-or-orange, which sweeps up problem cases [Rumfitt] |
18838 | The extension of a colour is decided by a concept's place in a network of contraries [Rumfitt] |
18816 | Metaphysical modalities respect the actual identities of things [Rumfitt] |
18825 | S5 is the logic of logical necessity [Rumfitt] |
18824 | Since possibilities are properties of the world, calling 'red' the determination of a determinable seems right [Rumfitt] |
18828 | If two possibilities can't share a determiner, they are incompatible [Rumfitt] |
18821 | Possibilities are like possible worlds, but not fully determinate or complete [Rumfitt] |
18831 | Medieval logicians said understanding A also involved understanding not-A [Rumfitt] |
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] |
18820 | In English 'evidence' is a mass term, qualified by 'little' and 'more' [Rumfitt] |
13475 | The Fregean concept of GREEN is a function assigning true to green things, and false to the rest [Hart,WD] |
18817 | We understand conditionals, but disagree over their truth-conditions [Rumfitt] |
18829 | The truth grounds for 'not A' are the possibilities incompatible with truth grounds for A [Rumfitt] |