64 ideas
| 10987 | Three traditional names of rules are 'Simplification', 'Addition' and 'Disjunctive Syllogism' [Read] |
| 11004 | Necessity is provability in S4, and true in all worlds in S5 [Read] |
| 17925 | Showing a disproof is impossible is not a proof, so don't eliminate double negation [Colyvan] |
| 17926 | Rejecting double negation elimination undermines reductio proofs [Colyvan] |
| 11018 | There are fuzzy predicates (and sets), and fuzzy quantifiers and modifiers [Read] |
| 11011 | Same say there are positive, negative and neuter free logics [Read] |
| 11020 | Realisms like the full Comprehension Principle, that all good concepts determine sets [Read] |
| 10986 | Not all validity is captured in first-order logic [Read] |
| 10972 | The non-emptiness of the domain is characteristic of classical logic [Read] |
| 11024 | Semantics must precede proof in higher-order logics, since they are incomplete [Read] |
| 10985 | We should exclude second-order logic, precisely because it captures arithmetic [Read] |
| 10970 | A theory of logical consequence is a conceptual analysis, and a set of validity techniques [Read] |
| 10984 | Logical consequence isn't just a matter of form; it depends on connections like round-square [Read] |
| 17924 | Excluded middle says P or not-P; bivalence says P is either true or false [Colyvan] |
| 10973 | A theory is logically closed, which means infinite premisses [Read] |
| 11007 | Quantifiers are second-order predicates [Read] |
| 10978 | In second-order logic the higher-order variables range over all the properties of the objects [Read] |
| 10971 | A logical truth is the conclusion of a valid inference with no premisses [Read] |
| 17929 | Löwenheim proved his result for a first-order sentence, and Skolem generalised it [Colyvan] |
| 10988 | Any first-order theory of sets is inadequate [Read] |
| 17930 | Axioms are 'categorical' if all of their models are isomorphic [Colyvan] |
| 10975 | Compactness does not deny that an inference can have infinitely many premisses [Read] |
| 10974 | Compactness is when any consequence of infinite propositions is the consequence of a finite subset [Read] |
| 10977 | Compactness blocks the proof of 'for every n, A(n)' (as the proof would be infinite) [Read] |
| 10976 | Compactness makes consequence manageable, but restricts expressive power [Read] |
| 11014 | Self-reference paradoxes seem to arise only when falsity is involved [Read] |
| 17928 | Ordinal numbers represent order relations [Colyvan] |
| 17923 | Intuitionists only accept a few safe infinities [Colyvan] |
| 11025 | Infinite cuts and successors seems to suggest an actual infinity there waiting for us [Read] |
| 17941 | Infinitesimals were sometimes zero, and sometimes close to zero [Colyvan] |
| 17922 | Reducing real numbers to rationals suggested arithmetic as the foundation of maths [Colyvan] |
| 10980 | Second-order arithmetic covers all properties, ensuring categoricity [Read] |
| 10979 | Although second-order arithmetic is incomplete, it can fully model normal arithmetic [Read] |
| 17936 | Transfinite induction moves from all cases, up to the limit ordinal [Colyvan] |
| 10997 | Von Neumann numbers are helpful, but don't correctly describe numbers [Read] |
| 17940 | Most mathematical proofs are using set theory, but without saying so [Colyvan] |
| 10190 | From the axiomatic point of view, mathematics is a storehouse of abstract structures [Bourbaki] |
| 17931 | Structuralism say only 'up to isomorphism' matters because that is all there is to it [Colyvan] |
| 17932 | If 'in re' structures relies on the world, does the world contain rich enough structures? [Colyvan] |
| 11016 | Would a language without vagueness be usable at all? [Read] |
| 11019 | Supervaluations say there is a cut-off somewhere, but at no particular place [Read] |
| 11012 | A 'supervaluation' gives a proposition consistent truth-value for classical assignments [Read] |
| 11013 | Identities and the Indiscernibility of Identicals don't work with supervaluations [Read] |
| 10995 | A haecceity is a set of individual properties, essential to each thing [Read] |
| 11001 | Equating necessity with truth in every possible world is the S5 conception of necessity [Read] |
| 10989 | The standard view of conditionals is that they are truth-functional [Read] |
| 10992 | The point of conditionals is to show that one will accept modus ponens [Read] |
| 11017 | Some people even claim that conditionals do not express propositions [Read] |
| 10983 | Knowledge of possible worlds is not causal, but is an ontology entailed by semantics [Read] |
| 10982 | How can modal Platonists know the truth of a modal proposition? [Read] |
| 10996 | Actualism is reductionist (to parts of actuality), or moderate realist (accepting real abstractions) [Read] |
| 10981 | A possible world is a determination of the truth-values of all propositions of a domain [Read] |
| 11000 | If worlds are concrete, objects can't be present in more than one, and can only have counterparts [Read] |
| 17943 | Probability supports Bayesianism better as degrees of belief than as ratios of frequencies [Colyvan] |
| 17939 | Mathematics can reveal structural similarities in diverse systems [Colyvan] |
| 17938 | Mathematics can show why some surprising events have to occur [Colyvan] |
| 17934 | Proof by cases (by 'exhaustion') is said to be unexplanatory [Colyvan] |
| 17933 | Reductio proofs do not seem to be very explanatory [Colyvan] |
| 17935 | If inductive proofs hold because of the structure of natural numbers, they may explain theorems [Colyvan] |
| 17942 | Can a proof that no one understands (of the four-colour theorem) really be a proof? [Colyvan] |
| 10998 | The mind abstracts ways things might be, which are nonetheless real [Read] |
| 17937 | Mathematical generalisation is by extending a system, or by abstracting away from it [Colyvan] |
| 11005 | Negative existentials with compositionality make the whole sentence meaningless [Read] |
| 10966 | A proposition objectifies what a sentence says, as indicative, with secure references [Read] |