64 ideas
16877 | A 'constructive' (as opposed to 'analytic') definition creates a new sign [Frege] |
11219 | Frege suggested that mathematics should only accept stipulative definitions [Frege, by Gupta] |
16878 | We must be clear about every premise and every law used in a proof [Frege] |
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] |
14263 | Strong Kleene disjunction just needs one true disjunct; Weak needs the other to have some value [Fine,K] |
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] |
16867 | Logic not only proves things, but also reveals logical relations between them [Frege] |
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] |
16863 | Does some mathematical reasoning (such as mathematical induction) not belong to logic? [Frege] |
16862 | The closest subject to logic is mathematics, which does little apart from drawing inferences [Frege] |
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] |
16865 | 'Theorems' are both proved, and used in proofs [Frege] |
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] |
10988 | Any first-order theory of sets is inadequate [Read] |
16866 | Tracing inference backwards closes in on a small set of axioms and postulates [Frege] |
16868 | The essence of mathematics is the kernel of primitive truths on which it rests [Frege] |
16871 | A truth can be an axiom in one system and not in another [Frege] |
16870 | Axioms are truths which cannot be doubted, and for which no proof is needed [Frege] |
10974 | Compactness is when any consequence of infinite propositions is the consequence of a finite subset [Read] |
10975 | Compactness does not deny that an inference can have infinitely many premisses [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] |
16869 | To create order in mathematics we need a full system, guided by patterns of inference [Frege] |
11025 | Infinite cuts and successors seems to suggest an actual infinity there waiting for us [Read] |
16864 | If principles are provable, they are theorems; if not, they are axioms [Frege] |
10979 | Although second-order arithmetic is incomplete, it can fully model normal arithmetic [Read] |
10980 | Second-order arithmetic covers all properties, ensuring categoricity [Read] |
10997 | Von Neumann numbers are helpful, but don't correctly describe numbers [Read] |
14262 | Formal grounding needs transitivity of grounding, no self-grounding, and the existence of both parties [Fine,K] |
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] |
9388 | Every concept must have a sharp boundary; we cannot allow an indeterminate third case [Frege] |
11001 | Equating necessity with truth in every possible world is the S5 conception of necessity [Read] |
10992 | The point of conditionals is to show that one will accept modus ponens [Read] |
10989 | The standard view of conditionals is that they are truth-functional [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] |
10998 | The mind abstracts ways things might be, which are nonetheless real [Read] |
16876 | We need definitions to cram retrievable sense into a signed receptacle [Frege] |
16875 | We use signs to mark receptacles for complex senses [Frege] |
16879 | A sign won't gain sense just from being used in sentences with familiar components [Frege] |
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] |
16873 | Thoughts are not subjective or psychological, because some thoughts are the same for us all [Frege] |
16872 | A thought is the sense expressed by a sentence, and is what we prove [Frege] |
16874 | The parts of a thought map onto the parts of a sentence [Frege] |