88 ideas
| 9641 | Definitions should be replaceable by primitives, and should not be creative [Brown,JR] |
| 13634 | Satisfaction is 'truth in a model', which is a model of 'truth' [Shapiro] |
| 13643 | Aristotelian logic is complete [Shapiro] |
| 13651 | A set is 'transitive' if contains every member of each of its members [Shapiro] |
| 9634 | Set theory says that natural numbers are an actual infinity (to accommodate their powerset) [Brown,JR] |
| 13647 | Choice is essential for proving downward Löwenheim-Skolem [Shapiro] |
| 13631 | Are sets part of logic, or part of mathematics? [Shapiro] |
| 9613 | Naïve set theory assumed that there is a set for every condition [Brown,JR] |
| 9615 | Nowadays conditions are only defined on existing sets [Brown,JR] |
| 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] |
| 9617 | The 'iterative' view says sets start with the empty set and build up [Brown,JR] |
| 13653 | 'Well-ordering' of a set is an irreflexive, transitive, and binary relation with a least element [Shapiro] |
| 9642 | A flock of birds is not a set, because a set cannot go anywhere [Brown,JR] |
| 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] |
| 9605 | If a proposition is false, then its negation is true [Brown,JR] |
| 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] |
| 13633 | 'Satisfaction' is a function from models, assignments, and formulas to {true,false} [Shapiro] |
| 13644 | Semantics for models uses set-theory [Shapiro] |
| 13636 | An axiomatization is 'categorical' if its models are isomorphic, so there is really only one interpretation [Shapiro] |
| 13670 | Categoricity can't be reached in a first-order language [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] |
| 9649 | Axioms are either self-evident, or stipulations, or fallible attempts [Brown,JR] |
| 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] |
| 9638 | Berry's Paradox finds a contradiction in the naming of huge numbers [Brown,JR] |
| 9604 | Mathematics is the only place where we are sure we are right [Brown,JR] |
| 9622 | 'There are two apples' can be expressed logically, with no mention of numbers [Brown,JR] |
| 13641 | Complex numbers can be defined as reals, which are defined as rationals, then integers, then naturals [Shapiro] |
| 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] |
| 9648 | π is a 'transcendental' number, because it is not the solution of an equation [Brown,JR] |
| 9621 | Mathematics represents the world through structurally similar models. [Brown,JR] |
| 13652 | The 'continuum' is the cardinality of the powerset of a denumerably infinite set [Shapiro] |
| 9646 | There is no limit to how many ways something can be proved in mathematics [Brown,JR] |
| 9647 | Computers played an essential role in proving the four-colour theorem of maps [Brown,JR] |
| 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] |
| 9643 | Set theory may represent all of mathematics, without actually being mathematics [Brown,JR] |
| 9644 | When graphs are defined set-theoretically, that won't cover unlabelled graphs [Brown,JR] |
| 9625 | To see a structure in something, we must already have the idea of the structure [Brown,JR] |
| 9628 | Sets seem basic to mathematics, but they don't suit structuralism [Brown,JR] |
| 9606 | The irrationality of root-2 was achieved by intellect, not experience [Brown,JR] |
| 9612 | There is an infinity of mathematical objects, so they can't be physical [Brown,JR] |
| 9610 | Numbers are not abstracted from particulars, because each number is a particular [Brown,JR] |
| 9620 | Empiricists base numbers on objects, Platonists base them on properties [Brown,JR] |
| 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] |
| 9629 | For nomalists there are no numbers, only numerals [Brown,JR] |
| 9639 | Does some mathematics depend entirely on notation? [Brown,JR] |
| 9630 | The most brilliant formalist was Hilbert [Brown,JR] |
| 9608 | There are no constructions for many highly desirable results in mathematics [Brown,JR] |
| 9645 | Constructivists say p has no value, if the value depends on Goldbach's Conjecture [Brown,JR] |
| 13663 | Some reject formal properties if they are not defined, or defined impredicatively [Shapiro] |
| 9619 | David's 'Napoleon' is about something concrete and something abstract [Brown,JR] |
| 13638 | Properties are often seen as intensional; equiangular and equilateral are different, despite identity of objects [Shapiro] |
| 9611 | 'Abstract' nowadays means outside space and time, not concrete, not physical [Brown,JR] |
| 9609 | The older sense of 'abstract' is where 'redness' or 'group' is abstracted from particulars [Brown,JR] |
| 9640 | A term can have not only a sense and a reference, but also a 'computational role' [Brown,JR] |
| 9635 | Given atomism at one end, and a finite universe at the other, there are no physical infinities [Brown,JR] |
| 8430 | Causal statements are used to explain, to predict, to control, to attribute responsibility, and in theories [Kim] |
| 8396 | Many counterfactuals have nothing to do with causation [Kim, by Tooley] |
| 8429 | Counterfactuals can express four other relations between events, apart from causation [Kim] |
| 8428 | Causation is not the only dependency relation expressed by counterfactuals [Kim] |
| 4781 | Many counterfactual truths do not imply causation ('if yesterday wasn't Monday, it isn't Tuesday') [Kim, by Psillos] |