37 ideas
| 7786 | Propositional logic handles negation, disjunction, conjunction; predicate logic adds quantifiers, predicates, relations [Girle] |
| 7798 | There are three axiom schemas for propositional logic [Girle] |
| 7799 | Proposition logic has definitions for its three operators: or, and, and identical [Girle] |
| 7797 | Axiom systems of logic contain axioms, inference rules, and definitions of proof and theorems [Girle] |
| 7794 | There are seven modalities in S4, each with its negation [Girle] |
| 7793 | ◊p → □◊p is the hallmark of S5 [Girle] |
| 7795 | S5 has just six modalities, and all strings can be reduced to those [Girle] |
| 7787 | Possible worlds logics use true-in-a-world rather than true [Girle] |
| 7788 | Modal logic has four basic modal negation equivalences [Girle] |
| 7796 | Modal logics were studied in terms of axioms, but now possible worlds semantics is added [Girle] |
| 17926 | Rejecting double negation elimination undermines reductio proofs [Colyvan] |
| 17925 | Showing a disproof is impossible is not a proof, so don't eliminate double negation [Colyvan] |
| 7789 | Necessary implication is called 'strict implication'; if successful, it is called 'entailment' [Girle] |
| 17924 | Excluded middle says P or not-P; bivalence says P is either true or false [Colyvan] |
| 7790 | If an argument is invalid, a truth tree will indicate a counter-example [Girle] |
| 17929 | Löwenheim proved his result for a first-order sentence, and Skolem generalised it [Colyvan] |
| 17930 | Axioms are 'categorical' if all of their models are isomorphic [Colyvan] |
| 17928 | Ordinal numbers represent order relations [Colyvan] |
| 17923 | Intuitionists only accept a few safe infinities [Colyvan] |
| 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] |
| 17936 | Transfinite induction moves from all cases, up to the limit ordinal [Colyvan] |
| 17940 | Most mathematical proofs are using set theory, but without saying so [Colyvan] |
| 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] |
| 7800 | Analytic truths are divided into logically and conceptually necessary [Girle] |
| 7801 | Possibilities can be logical, theoretical, physical, economic or human [Girle] |
| 7792 | A world has 'access' to a world it generates, which is important in possible worlds semantics [Girle] |
| 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] |
| 4741 | A very powerful computer might have its operations restricted by the addition of consciousness [Clark,T] |
| 17937 | Mathematical generalisation is by extending a system, or by abstracting away from it [Colyvan] |