119 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] |
10237 | Coherence is a primitive, intuitive notion, not reduced to something formal [Shapiro] |
10204 | An 'implicit definition' gives a direct description of the relations of an entity [Shapiro] |
19125 | If we define truth, we can eliminate it [Halbach/Leigh] |
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] |
19128 | If a language cannot name all objects, then satisfaction must be used, instead of unary truth [Halbach/Leigh] |
19120 | Semantic theories need a powerful metalanguage, typically including set theory [Halbach/Leigh] |
13503 | A first-order language has an infinity of T-sentences, which cannot add up to a definition of truth [Hart,WD] |
19127 | The T-sentences are deductively weak, and also not deductively conservative [Halbach/Leigh] |
19124 | A natural theory of truth plays the role of reflection principles, establishing arithmetic's soundness [Halbach/Leigh] |
19126 | If deflationary truth is not explanatory, truth axioms should be 'conservative', proving nothing new [Halbach/Leigh] |
19129 | The FS axioms use classical logical, but are not fully consistent [Halbach/Leigh] |
19130 | KF is formulated in classical logic, but describes non-classical truth, which allows truth-value gluts [Halbach/Leigh] |
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] |
10206 | Modal operators are usually treated as quantifiers [Shapiro] |
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] |
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] |
10208 | Axiom of Choice: some function has a value for every set in a given set [Shapiro] |
10252 | The Axiom of Choice seems to license an infinite amount of choosing [Shapiro] |
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] |
13490 | Von Neumann defines α<β as α∈β [Hart,WD] |
13460 | 'Well-ordering' must have a least member, so it does the natural numbers but not the integers [Hart,WD] |
13481 | Maybe sets should be rethought in terms of the even more basic categories [Hart,WD] |
10207 | Anti-realists reject set theory [Shapiro] |
10259 | The two standard explanations of consequence are semantic (in models) and deductive [Shapiro] |
10257 | Intuitionism only sanctions modus ponens if all three components are proved [Shapiro] |
10253 | Either logic determines objects, or objects determine logic, or they are separate [Shapiro] |
10251 | The law of excluded middle might be seen as a principle of omniscience [Shapiro] |
10212 | Classical connectives differ from their ordinary language counterparts; '∧' is timeless, unlike 'and' [Shapiro] |
10209 | A function is just an arbitrary correspondence between collections [Shapiro] |
13506 | The universal quantifier can't really mean 'all', because there is no universal set [Hart,WD] |
10268 | Maybe plural quantifiers should be understood in terms of classes or sets [Shapiro] |
10235 | A sentence is 'satisfiable' if it has a model [Shapiro] |
13512 | Modern model theory begins with the proof of Los's Conjecture in 1962 [Hart,WD] |
10239 | The central notion of model theory is the relation of 'satisfaction' [Shapiro] |
13513 | Models are ways the world might be from a first-order point of view [Hart,WD] |
10240 | Model theory deals with relations, reference and extensions [Shapiro] |
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] |
10238 | The set-theoretical hierarchy contains as many isomorphism types as possible [Shapiro] |
10214 | Theory ontology is never complete, but is only determined 'up to isomorphism' [Shapiro] |
10234 | Any theory with an infinite model has a model of every infinite cardinality [Shapiro] |
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] |
10201 | Virtually all of mathematics can be modeled in set theory [Shapiro] |
13492 | Von Neumann's ordinals generalise into the transfinite better, because Zermelo's ω is a singleton [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] |
13446 | 19th century arithmetization of analysis isolated the real numbers from geometry [Hart,WD] |
10213 | Real numbers are thought of as either Cauchy sequences or Dedekind cuts [Shapiro] |
18243 | Understanding the real-number structure is knowing usage of the axiomatic language of analysis [Shapiro] |
18245 | Cuts are made by the smallest upper or largest lower number, some of them not rational [Shapiro] |
13509 | We can establish truths about infinite numbers by means of induction [Hart,WD] |
10236 | There is no grounding for mathematics that is more secure than mathematics [Shapiro] |
10256 | For intuitionists, proof is inherently informal [Shapiro] |
13474 | Euclid has a unique parallel, spherical geometry has none, and saddle geometry has several [Hart,WD] |
10202 | Natural numbers just need an initial object, successors, and an induction principle [Shapiro] |
10205 | Mathematics originally concerned the continuous (geometry) and the discrete (arithmetic) [Shapiro] |
10222 | Mathematical foundations may not be sets; categories are a popular rival [Shapiro] |
10218 | Baseball positions and chess pieces depend entirely on context [Shapiro] |
10224 | The even numbers have the natural-number structure, with 6 playing the role of 3 [Shapiro] |
10228 | Could infinite structures be apprehended by pattern recognition? [Shapiro] |
10230 | The 4-pattern is the structure common to all collections of four objects [Shapiro] |
10249 | The main mathematical structures are algebraic, ordered, and topological [Shapiro] |
10273 | Some structures are exemplified by both abstract and concrete [Shapiro] |
10276 | Mathematical structures are defined by axioms, or in set theory [Shapiro] |
10270 | The main versions of structuralism are all definitionally equivalent [Shapiro] |
10221 | Is there is no more to structures than the systems that exemplify them? [Shapiro] |
10248 | Number statements are generalizations about number sequences, and are bound variables [Shapiro] |
10220 | Because one structure exemplifies several systems, a structure is a one-over-many [Shapiro] |
10223 | There is no 'structure of all structures', just as there is no set of all sets [Shapiro] |
8703 | Shapiro's structuralism says model theory (comparing structures) is the essence of mathematics [Shapiro, by Friend] |
10274 | Does someone using small numbers really need to know the infinite structure of arithmetic? [Shapiro] |
10200 | We distinguish realism 'in ontology' (for objects), and 'in truth-value' (for being either true or false) [Shapiro] |
10210 | If mathematical objects are accepted, then a number of standard principles will follow [Shapiro] |
10215 | Platonists claim we can state the essence of a number without reference to the others [Shapiro] |
10233 | Platonism must accept that the Peano Axioms could all be false [Shapiro] |
10244 | Intuition is an outright hindrance to five-dimensional geometry [Shapiro] |
10280 | A stone is a position in some pattern, and can be viewed as an object, or as a location [Shapiro] |
13471 | Mathematics makes existence claims, but philosophers usually say those are never analytic [Hart,WD] |
10254 | Can the ideal constructor also destroy objects? [Shapiro] |
10255 | Presumably nothing can block a possible dynamic operation? [Shapiro] |
10279 | Can we discover whether a deck is fifty-two cards, or a person is time-slices or molecules? [Shapiro] |
10227 | The abstract/concrete boundary now seems blurred, and would need a defence [Shapiro] |
10226 | Mathematicians regard arithmetic as concrete, and group theory as abstract [Shapiro] |
13488 | Mass words do not have plurals, or numerical adjectives, or use 'fewer' [Hart,WD] |
10262 | Fictionalism eschews the abstract, but it still needs the possible (without model theory) [Shapiro] |
10277 | Structuralism blurs the distinction between mathematical and ordinary objects [Shapiro] |
19121 | We can reduce properties to true formulas [Halbach/Leigh] |
19122 | Nominalists can reduce theories of properties or sets to harmless axiomatic truth theories [Halbach/Leigh] |
10272 | The notion of 'object' is at least partially structural and mathematical [Shapiro] |
10275 | A blurry border is still a border [Shapiro] |
10258 | Logical modalities may be acceptable, because they are reducible to satisfaction in models [Shapiro] |
10266 | Why does the 'myth' of possible worlds produce correct modal logic? [Shapiro] |
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] |
10203 | We apprehend small, finite mathematical structures by abstraction from patterns [Shapiro] |
13475 | The Fregean concept of GREEN is a function assigning true to green things, and false to the rest [Hart,WD] |
10229 | Simple types can be apprehended through their tokens, via abstraction [Shapiro] |
10217 | We can apprehend structures by focusing on or ignoring features of patterns [Shapiro] |
9554 | We can focus on relations between objects (like baseballers), ignoring their other features [Shapiro] |
10231 | Abstract objects might come by abstraction over an equivalence class of base entities [Shapiro] |