92 ideas
| 8721 | An 'impredicative' definition seems circular, because it uses the term being defined [Friend] |
| 8680 | Classical definitions attempt to refer, but intuitionist/constructivist definitions actually create objects [Friend] |
| 3678 | Reductio ad absurdum proves an idea by showing that its denial produces contradiction [Friend] |
| 8705 | Anti-realists see truth as our servant, and epistemically contrained [Friend] |
| 13634 | Satisfaction is 'truth in a model', which is a model of 'truth' [Shapiro] |
| 13643 | Aristotelian logic is complete [Shapiro] |
| 8713 | In classical/realist logic the connectives are defined by truth-tables [Friend] |
| 8708 | Double negation elimination is not valid in intuitionist logic [Friend] |
| 8694 | Free logic was developed for fictional or non-existent objects [Friend] |
| 8665 | A 'proper subset' of A contains only members of A, but not all of them [Friend] |
| 8672 | A 'powerset' is all the subsets of a set [Friend] |
| 13651 | A set is 'transitive' if contains every member of each of its members [Shapiro] |
| 8677 | Set theory makes a minimum ontological claim, that the empty set exists [Friend] |
| 8666 | Infinite sets correspond one-to-one with a subset [Friend] |
| 8682 | Major set theories differ in their axioms, and also over the additional axioms of choice and infinity [Friend] |
| 13647 | Choice is essential for proving downward Löwenheim-Skolem [Shapiro] |
| 13631 | Are sets part of logic, or part of mathematics? [Shapiro] |
| 13654 | It is central to the iterative conception that membership is well-founded, with no infinite descending chains [Shapiro] |
| 13640 | Russell's paradox shows that there are classes which are not iterative sets [Shapiro] |
| 13666 | Iterative sets are not Boolean; the complement of an iterative set is not an iterative sets [Shapiro] |
| 13653 | 'Well-ordering' of a set is an irreflexive, transitive, and binary relation with a least element [Shapiro] |
| 13627 | There is no 'correct' logic for natural languages [Shapiro] |
| 13642 | Logic is the ideal for learning new propositions on the basis of others [Shapiro] |
| 13668 | Bernays (1918) formulated and proved the completeness of propositional logic [Shapiro] |
| 13669 | Can one develop set theory first, then derive numbers, or are numbers more basic? [Shapiro] |
| 13667 | Skolem and Gödel championed first-order, and Zermelo, Hilbert, and Bernays championed higher-order [Shapiro] |
| 13662 | First-order logic was an afterthought in the development of modern logic [Shapiro] |
| 13624 | The 'triumph' of first-order logic may be related to logicism and the Hilbert programme, which failed [Shapiro] |
| 13660 | Maybe compactness, semantic effectiveness, and the Löwenheim-Skolem properties are desirable [Shapiro] |
| 13673 | The notion of finitude is actually built into first-order languages [Shapiro] |
| 15944 | Second-order logic is better than set theory, since it only adds relations and operations, and nothing else [Shapiro, by Lavine] |
| 13629 | Broad standard semantics, or Henkin semantics with a subclass, or many-sorted first-order semantics? [Shapiro] |
| 13650 | Henkin semantics has separate variables ranging over the relations and over the functions [Shapiro] |
| 13645 | In standard semantics for second-order logic, a single domain fixes the ranges for the variables [Shapiro] |
| 13649 | Completeness, Compactness and Löwenheim-Skolem fail in second-order standard semantics [Shapiro] |
| 13626 | Semantic consequence is ineffective in second-order logic [Shapiro] |
| 13637 | If a logic is incomplete, its semantic consequence relation is not effective [Shapiro] |
| 8709 | The law of excluded middle is syntactic; it just says A or not-A, not whether they are true or false [Friend] |
| 13632 | Finding the logical form of a sentence is difficult, and there are no criteria of correctness [Shapiro] |
| 13674 | We might reduce ontology by using truth of sentences and terms, instead of using objects satisfying models [Shapiro] |
| 8711 | Intuitionists read the universal quantifier as "we have a procedure for checking every..." [Friend] |
| 13633 | 'Satisfaction' is a function from models, assignments, and formulas to {true,false} [Shapiro] |
| 13644 | Semantics for models uses set-theory [Shapiro] |
| 13670 | Categoricity can't be reached in a first-order language [Shapiro] |
| 13636 | An axiomatization is 'categorical' if its models are isomorphic, so there is really only one interpretation [Shapiro] |
| 13658 | Downward Löwenheim-Skolem: each satisfiable countable set always has countable models [Shapiro] |
| 13659 | Upward Löwenheim-Skolem: each infinite model has infinite models of all sizes [Shapiro] |
| 13648 | The Löwenheim-Skolem theorems show an explosion of infinite models, so 1st-order is useless for infinity [Shapiro] |
| 13675 | Substitutional semantics only has countably many terms, so Upward Löwenheim-Skolem trivially fails [Shapiro] |
| 13635 | 'Weakly sound' if every theorem is a logical truth; 'sound' if every deduction is a semantic consequence [Shapiro] |
| 13628 | We can live well without completeness in logic [Shapiro] |
| 13630 | Non-compactness is a strength of second-order logic, enabling characterisation of infinite structures [Shapiro] |
| 13646 | Compactness is derived from soundness and completeness [Shapiro] |
| 13661 | A language is 'semantically effective' if its logical truths are recursively enumerable [Shapiro] |
| 8675 | Paradoxes can be solved by talking more loosely of 'classes' instead of 'sets' [Friend] |
| 8674 | The Burali-Forti paradox asks whether the set of all ordinals is itself an ordinal [Friend] |
| 13641 | Complex numbers can be defined as reals, which are defined as rationals, then integers, then naturals [Shapiro] |
| 8667 | The 'integers' are the positive and negative natural numbers, plus zero [Friend] |
| 8668 | The 'rational' numbers are those representable as fractions [Friend] |
| 8670 | A number is 'irrational' if it cannot be represented as a fraction [Friend] |
| 8661 | The natural numbers are primitive, and the ordinals are up one level of abstraction [Friend] |
| 13676 | Only higher-order languages can specify that 0,1,2,... are all the natural numbers that there are [Shapiro] |
| 13677 | Natural numbers are the finite ordinals, and integers are equivalence classes of pairs of finite ordinals [Shapiro] |
| 8664 | Cardinal numbers answer 'how many?', with the order being irrelevant [Friend] |
| 8671 | The 'real' numbers (rationals and irrationals combined) is the Continuum, which has no gaps [Friend] |
| 13652 | The 'continuum' is the cardinality of the powerset of a denumerably infinite set [Shapiro] |
| 8663 | Raising omega to successive powers of omega reveal an infinity of infinities [Friend] |
| 8662 | The first limit ordinal is omega (greater, but without predecessor), and the second is twice-omega [Friend] |
| 8669 | Between any two rational numbers there is an infinite number of rational numbers [Friend] |
| 8676 | Is mathematics based on sets, types, categories, models or topology? [Friend] |
| 13657 | First-order arithmetic can't even represent basic number theory [Shapiro] |
| 13656 | Some sets of natural numbers are definable in set-theory but not in arithmetic [Shapiro] |
| 8678 | Most mathematical theories can be translated into the language of set theory [Friend] |
| 8701 | The number 8 in isolation from the other numbers is of no interest [Friend] |
| 8702 | In structuralism the number 8 is not quite the same in different structures, only equivalent [Friend] |
| 8699 | Are structures 'ante rem' (before reality), or are they 'in re' (grounded in physics)? [Friend] |
| 8696 | Structuralist says maths concerns concepts about base objects, not base objects themselves [Friend] |
| 8695 | Structuralism focuses on relations, predicates and functions, with objects being inessential [Friend] |
| 8700 | 'In re' structuralism says that the process of abstraction is pattern-spotting [Friend] |
| 8681 | The big problem for platonists is epistemic: how do we perceive, intuit, know or detect mathematical facts? [Friend] |
| 8712 | Mathematics should be treated as true whenever it is indispensable to our best physical theory [Friend] |
| 13664 | Logicism is distinctive in seeking a universal language, and denying that logic is a series of abstractions [Shapiro] |
| 13625 | Mathematics and logic have no border, and logic must involve mathematics and its ontology [Shapiro] |
| 8716 | Formalism is unconstrained, so cannot indicate importance, or directions for research [Friend] |
| 8706 | Constructivism rejects too much mathematics [Friend] |
| 8707 | Intuitionists typically retain bivalence but reject the law of excluded middle [Friend] |
| 13663 | Some reject formal properties if they are not defined, or defined impredicatively [Shapiro] |
| 13638 | Properties are often seen as intensional; equiangular and equilateral are different, despite identity of objects [Shapiro] |
| 8704 | Structuralists call a mathematical 'object' simply a 'place in a structure' [Friend] |
| 8685 | Studying biology presumes the laws of chemistry, and it could never contradict them [Friend] |
| 8688 | Concepts can be presented extensionally (as objects) or intensionally (as a characterization) [Friend] |
| 468 | Musical performance can reveal a range of virtues [Damon of Ath.] |