63 ideas
17749 | Post proved the consistency of propositional logic in 1921 [Walicki] |
17765 | Propositional language can only relate statements as the same or as different [Walicki] |
10987 | Three traditional names of rules are 'Simplification', 'Addition' and 'Disjunctive Syllogism' [Read] |
17764 | Boolean connectives are interpreted as functions on the set {1,0} [Walicki] |
11004 | Necessity is provability in S4, and true in all worlds in S5 [Read] |
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] |
17752 | The empty set is useful for defining sets by properties, when the members are not yet known [Walicki] |
17753 | The empty set avoids having to take special precautions in case members vanish [Walicki] |
11020 | Realisms like the full Comprehension Principle, that all good concepts determine sets [Read] |
17759 | Ordinals play the central role in set theory, providing the model of well-ordering [Walicki] |
17741 | To determine the patterns in logic, one must identify its 'building blocks' [Walicki] |
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] |
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] |
17747 | A 'model' of a theory specifies interpreting a language in a domain to make all theorems true [Walicki] |
10988 | Any first-order theory of sets is inadequate [Read] |
17748 | The L-S Theorem says no theory (even of reals) says more than a natural number theory [Walicki] |
17761 | A compact axiomatisation makes it possible to understand a field as a whole [Walicki] |
17763 | Axiomatic systems are purely syntactic, and do not presuppose any interpretation [Walicki] |
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] |
17758 | Ordinals are transitive sets of transitive sets; or transitive sets totally ordered by inclusion [Walicki] |
17755 | Ordinals are the empty set, union with the singleton, and any arbitrary union of ordinals [Walicki] |
17756 | The union of finite ordinals is the first 'limit ordinal'; 2ω is the second... [Walicki] |
17760 | Two infinite ordinals can represent a single infinite cardinal [Walicki] |
17757 | Members of ordinals are ordinals, and also subsets of ordinals [Walicki] |
11025 | Infinite cuts and successors seems to suggest an actual infinity there waiting for us [Read] |
17762 | In non-Euclidean geometry, all Euclidean theorems are valid that avoid the fifth postulate [Walicki] |
10979 | Although second-order arithmetic is incomplete, it can fully model normal arithmetic [Read] |
10980 | Second-order arithmetic covers all properties, ensuring categoricity [Read] |
17754 | Inductive proof depends on the choice of the ordering [Walicki] |
10997 | Von Neumann numbers are helpful, but don't correctly describe numbers [Read] |
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] |
17742 | Scotus based modality on semantic consistency, instead of on what the future could allow [Walicki] |
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] |
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] |
13304 | Learned men gain more in one day than others do in a lifetime [Posidonius] |
20820 | Time is an interval of motion, or the measure of speed [Posidonius, by Stobaeus] |