54 ideas
10170 | While true-in-a-model seems relative, true-in-all-models seems not to be [Reck/Price] |
15413 | With four tense operators, all complex tenses reduce to fourteen basic cases [Burgess] |
15415 | The temporal Barcan formulas fix what exists, which seems absurd [Burgess] |
15430 | Is classical logic a part of intuitionist logic, or vice versa? [Burgess] |
15431 | It is still unsettled whether standard intuitionist logic is complete [Burgess] |
15429 | Relevance logic's → is perhaps expressible by 'if A, then B, for that reason' [Burgess] |
10166 | ZFC set theory has only 'pure' sets, without 'urelements' [Reck/Price] |
23445 | Naïve set theory says any formula defines a set, and coextensive sets are identical [Linnebo] |
15404 | Technical people see logic as any formal system that can be studied, not a study of argument validity [Burgess] |
15405 | Classical logic neglects the non-mathematical, such as temporality or modality [Burgess] |
15427 | The Cut Rule expresses the classical idea that entailment is transitive [Burgess] |
15421 | Classical logic neglects counterfactuals, temporality and modality, because maths doesn't use them [Burgess] |
15403 | Philosophical logic is a branch of logic, and is now centred in computer science [Burgess] |
15407 | Formalising arguments favours lots of connectives; proving things favours having very few [Burgess] |
15424 | Asserting a disjunction from one disjunct seems odd, but can be sensible, and needed in maths [Burgess] |
15409 | All occurrences of variables in atomic formulas are free [Burgess] |
15414 | The denotation of a definite description is flexible, rather than rigid [Burgess] |
10175 | Three types of variable in second-order logic, for objects, functions, and predicates/sets [Reck/Price] |
15406 | 'Induction' and 'recursion' on complexity prove by connecting a formula to its atomic components [Burgess] |
15426 | We can build one expanding sequence, instead of a chain of deductions [Burgess] |
15425 | The sequent calculus makes it possible to have proof without transitivity of entailment [Burgess] |
23447 | In classical semantics singular terms refer, and quantifiers range over domains [Linnebo] |
15408 | 'Tautologies' are valid formulas of classical sentential logic - or substitution instances in other logics [Burgess] |
15418 | Validity (for truth) and demonstrability (for proof) have correlates in satisfiability and consistency [Burgess] |
15411 | We only need to study mathematical models, since all other models are isomorphic to these [Burgess] |
15412 | Models leave out meaning, and just focus on truth values [Burgess] |
15416 | We aim to get the technical notion of truth in all models matching intuitive truth in all instances [Burgess] |
23444 | To investigate axiomatic theories, mathematics needs its own foundational axioms [Linnebo] |
23443 | The axioms of group theory are not assertions, but a definition of a structure [Linnebo] |
15428 | The Liar seems like a truth-value 'gap', but dialethists see it as a 'glut' [Burgess] |
10165 | 'Analysis' is the theory of the real numbers [Reck/Price] |
10174 | Mereological arithmetic needs infinite objects, and function definitions [Reck/Price] |
10164 | Peano Arithmetic can have three second-order axioms, plus '1' and 'successor' [Reck/Price] |
23446 | You can't prove consistency using a weaker theory, but you can use a consistent theory [Linnebo] |
10172 | Set-theory gives a unified and an explicit basis for mathematics [Reck/Price] |
10167 | Structuralism emerged from abstract algebra, axioms, and set theory and its structures [Reck/Price] |
23448 | Mathematics is the study of all possible patterns, and is thus bound to describe the world [Linnebo] |
10169 | Relativist Structuralism just stipulates one successful model as its arithmetic [Reck/Price] |
10179 | There are 'particular' structures, and 'universal' structures (what the former have in common) [Reck/Price] |
10181 | Pattern Structuralism studies what isomorphic arithmetic models have in common [Reck/Price] |
10182 | There are Formalist, Relativist, Universalist and Pattern structuralism [Reck/Price] |
10168 | Formalist Structuralism says the ontology is vacuous, or formal, or inference relations [Reck/Price] |
10178 | Maybe we should talk of an infinity of 'possible' objects, to avoid arithmetic being vacuous [Reck/Price] |
10176 | Universalist Structuralism is based on generalised if-then claims, not one particular model [Reck/Price] |
10177 | Universalist Structuralism eliminates the base element, as a variable, which is then quantified out [Reck/Price] |
10171 | The existence of an infinite set is assumed by Relativist Structuralism [Reck/Price] |
23441 | Logical truth is true in all models, so mathematical objects can't be purely logical [Linnebo] |
23442 | Game Formalism has no semantics, and Term Formalism reduces the semantics [Linnebo] |
10173 | A nominalist might avoid abstract objects by just appealing to mereological sums [Reck/Price] |
15420 | De re modality seems to apply to objects a concept intended for sentences [Burgess] |
15419 | General consensus is S5 for logical modality of validity, and S4 for proof [Burgess] |
15417 | Logical necessity has two sides - validity and demonstrability - which coincide in classical logic [Burgess] |
15422 | Three conditionals theories: Materialism (material conditional), Idealism (true=assertable), Nihilism (no truth) [Burgess] |
15423 | It is doubtful whether the negation of a conditional has any clear meaning [Burgess] |