99 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] |
8952 | We reach 'reflective equilibrium' when intuitions and theory completely align [Fisher] |
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] |
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] |
8943 | Three-valued logic says excluded middle and non-contradition are not tautologies [Fisher] |
8945 | Fuzzy logic has many truth values, ranging in fractions from 0 to 1 [Fisher] |
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] |
10073 | There cannot be a set theory which is complete [Smith,P] |
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] |
8951 | Classical logic is: excluded middle, non-contradiction, contradictions imply all, disjunctive syllogism [Fisher] |
10616 | Second-order arithmetic can prove new sentences of first-order [Smith,P] |
8950 | Logic formalizes how we should reason, but it shouldn't determine whether we are realists [Fisher] |
10076 | The 'range' of a function is the set of elements in the output set created by the function [Smith,P] |
10605 | Two functions are the same if they have the same extension [Smith,P] |
10075 | A 'partial function' maps only some elements to another set [Smith,P] |
10074 | A 'total function' maps every element to one element in another set [Smith,P] |
10612 | An argument is a 'fixed point' for a function if it is mapped back to itself [Smith,P] |
10615 | The Comprehension Schema says there is a property only had by things satisfying a condition [Smith,P] |
10595 | A 'theorem' of a theory is a sentence derived from the axioms using the proof system [Smith,P] |
13506 | The universal quantifier can't really mean 'all', because there is no universal set [Hart,WD] |
10602 | A 'natural deduction system' has no axioms but many rules [Smith,P] |
10613 | No nice theory can define truth for its own language [Smith,P] |
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] |
10079 | A 'bijective' function has one-to-one correspondence in both directions [Smith,P] |
10077 | A 'surjective' ('onto') function creates every element of the output set [Smith,P] |
10078 | An 'injective' ('one-to-one') function creates a distinct output element from each original [Smith,P] |
10070 | If everything that a theory proves is true, then it is 'sound' [Smith,P] |
10086 | Soundness is true axioms and a truth-preserving proof system [Smith,P] |
10596 | A theory is 'sound' iff every theorem is true (usually from true axioms and truth-preservation) [Smith,P] |
10598 | A theory is 'negation complete' if it proves all sentences or their negation [Smith,P] |
10597 | 'Complete' applies both to whole logics, and to theories within them [Smith,P] |
10069 | A theory is 'negation complete' if one of its sentences or its negation can always be proved [Smith,P] |
10609 | Two routes to Incompleteness: semantics of sound/expressible, or syntax of consistency/proof [Smith,P] |
13496 | First-order logic is 'compact': consequences of a set are consequences of a finite subset [Hart,WD] |
10080 | 'Effective' means simple, unintuitive, independent, controlled, dumb, and terminating [Smith,P] |
10087 | A theory is 'decidable' if all of its sentences could be mechanically proved [Smith,P] |
10088 | Any consistent, axiomatized, negation-complete formal theory is decidable [Smith,P] |
10081 | A set is 'enumerable' is all of its elements can result from a natural number function [Smith,P] |
10083 | A set is 'effectively enumerable' if a computer could eventually list every member [Smith,P] |
10084 | A finite set of finitely specifiable objects is always effectively enumerable (e.g. primes) [Smith,P] |
10085 | The set of ordered pairs of natural numbers <i,j> is effectively enumerable [Smith,P] |
10601 | The thorems of a nice arithmetic can be enumerated, but not the truths (so they're diffferent) [Smith,P] |
10600 | Being 'expressible' depends on language; being 'capture/represented' depends on axioms and proof system [Smith,P] |
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] |
10599 | For primes we write (x not= 1 ∧ ∀u∀v(u x v = x → (u = 1 ∨ v = 1))) [Smith,P] |
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] |
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] |
10610 | The reals contain the naturals, but the theory of reals doesn't contain the theory of naturals [Smith,P] |
13446 | 19th century arithmetization of analysis isolated the real numbers from geometry [Hart,WD] |
10619 | The truths of arithmetic are just true equations and their universally quantified versions [Smith,P] |
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] |
10618 | All numbers are related to zero by the ancestral of the successor relation [Smith,P] |
10608 | The number of Fs is the 'successor' of the Gs if there is a single F that isn't G [Smith,P] |
10849 | Baby arithmetic covers addition and multiplication, but no general facts about numbers [Smith,P] |
10850 | Baby Arithmetic is complete, but not very expressive [Smith,P] |
10851 | Robinson Arithmetic 'Q' has basic axioms, quantifiers and first-order logic [Smith,P] |
10852 | Robinson Arithmetic (Q) is not negation complete [Smith,P] |
10068 | Natural numbers have zero, unique successors, unending, no circling back, and no strays [Smith,P] |
10603 | The logic of arithmetic must quantify over properties of numbers to handle induction [Smith,P] |
10848 | Multiplication only generates incompleteness if combined with addition and successor [Smith,P] |
10604 | Incompleteness results in arithmetic from combining addition and successor with multiplication [Smith,P] |
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] |
8946 | We could make our intuitions about heaps precise with a million-valued logic [Fisher] |
10617 | The 'ancestral' of a relation is a new relation which creates a long chain of the original relation [Smith,P] |
8944 | Vagueness can involve components (like baldness), or not (like boredom) [Fisher] |
8941 | We can't explain 'possibility' in terms of 'possible' worlds [Fisher] |
8947 | If all truths are implied by a falsehood, then not-p might imply both q and not-q [Fisher] |
8949 | In relevance logic, conditionals help information to flow from antecedent to consequent [Fisher] |
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] |