26 ideas
| 17749 | Post proved the consistency of propositional logic in 1921 [Walicki] |
| Full Idea: A proof of the consistency of propositional logic was given by Emil Post in 1921. | |
| From: Michal Walicki (Introduction to Mathematical Logic [2012], History E.2.1) |
| 17765 | Propositional language can only relate statements as the same or as different [Walicki] |
| Full Idea: Propositional language is very rudimentary and has limited powers of expression. The only relation between various statements it can handle is that of identity and difference. As are all the same, but Bs can be different from As. | |
| From: Michal Walicki (Introduction to Mathematical Logic [2012], 7 Intro) | |
| A reaction: [second sentence a paraphrase] In predicate logic you could represent two statements as being the same except for one element (an object or predicate or relation or quantifier). |
| 17764 | Boolean connectives are interpreted as functions on the set {1,0} [Walicki] |
| Full Idea: Boolean connectives are interpreted as functions on the set {1,0}. | |
| From: Michal Walicki (Introduction to Mathematical Logic [2012], 5.1) | |
| A reaction: 1 and 0 are normally taken to be true (T) and false (F). Thus the functions output various combinations of true and false, which are truth tables. |
| 17752 | The empty set is useful for defining sets by properties, when the members are not yet known [Walicki] |
| Full Idea: The empty set is mainly a mathematical convenience - defining a set by describing the properties of its members in an involved way, we may not know from the very beginning what its members are. | |
| From: Michal Walicki (Introduction to Mathematical Logic [2012], 1.1) |
| 17753 | The empty set avoids having to take special precautions in case members vanish [Walicki] |
| Full Idea: Without the assumption of the empty set, one would often have to take special precautions for the case where a set happened to contain no elements. | |
| From: Michal Walicki (Introduction to Mathematical Logic [2012], 1.1) | |
| A reaction: Compare the introduction of the concept 'zero', where special precautions are therefore required. ...But other special precautions are needed without zero. Either he pays us, or we pay him, or ...er. Intersecting sets need the empty set. |
| 17759 | Ordinals play the central role in set theory, providing the model of well-ordering [Walicki] |
| Full Idea: Ordinals play the central role in set theory, providing the paradigmatic well-orderings. | |
| From: Michal Walicki (Introduction to Mathematical Logic [2012], 2.3) | |
| A reaction: When you draw the big V of the iterative hierarchy of sets (built from successive power sets), the ordinals are marked as a single line up the middle, one ordinal for each level. |
| 17741 | To determine the patterns in logic, one must identify its 'building blocks' [Walicki] |
| Full Idea: In order to construct precise and valid patterns of arguments one has to determine their 'building blocks'. One has to identify the basic terms, their kinds and means of combination. | |
| From: Michal Walicki (Introduction to Mathematical Logic [2012], History Intro) | |
| A reaction: A deceptively simple and important idea. All explanation requires patterns and levels, and it is the idea of building blocks which makes such things possible. It is right at the centre of our grasp of everything. |
| 17747 | A 'model' of a theory specifies interpreting a language in a domain to make all theorems true [Walicki] |
| Full Idea: A specification of a domain of objects, and of the rules for interpreting the symbols of a logical language in this domain such that all the theorems of the logical theory are true is said to be a 'model' of the theory. | |
| From: Michal Walicki (Introduction to Mathematical Logic [2012], History E.1.3) | |
| A reaction: The basic ideas of this emerged 1915-30, but it needed Tarski's account of truth to really get it going. |
| 17748 | The L-S Theorem says no theory (even of reals) says more than a natural number theory [Walicki] |
| Full Idea: The L-S Theorem is ...a shocking result, since it implies that any consistent formal theory of everything - even about biology, physics, sets or the real numbers - can just as well be understood as being about natural numbers. It says nothing more. | |
| From: Michal Walicki (Introduction to Mathematical Logic [2012], History E.2) | |
| A reaction: Illuminating. Particularly the point that no theory about the real numbers can say anything more than a theory about the natural numbers. So the natural numbers contain all the truths we can ever express? Eh????? |
| 17761 | A compact axiomatisation makes it possible to understand a field as a whole [Walicki] |
| Full Idea: Having such a compact [axiomatic] presentation of a complicated field [such as Euclid's], makes it possible to relate not only to particular theorems but also to the whole field as such. | |
| From: Michal Walicki (Introduction to Mathematical Logic [2012], 4.1) |
| 17763 | Axiomatic systems are purely syntactic, and do not presuppose any interpretation [Walicki] |
| Full Idea: Axiomatic systems, their primitive terms and proofs, are purely syntactic, that is, do not presuppose any interpretation. ...[142] They never address the world directly, but address a possible semantic model which formally represents the world. | |
| From: Michal Walicki (Introduction to Mathematical Logic [2012], 4.1) |
| 17758 | Ordinals are transitive sets of transitive sets; or transitive sets totally ordered by inclusion [Walicki] |
| Full Idea: An ordinal can be defined as a transitive set of transitive sets, or else, as a transitive set totally ordered by set inclusion. | |
| From: Michal Walicki (Introduction to Mathematical Logic [2012], 2.3) |
| 17755 | Ordinals are the empty set, union with the singleton, and any arbitrary union of ordinals [Walicki] |
| Full Idea: The collection of ordinals is defined inductively: Basis: the empty set is an ordinal; Ind: for an ordinal x, the union with its singleton is also an ordinal; and any arbitrary (possibly infinite) union of ordinals is an ordinal. | |
| From: Michal Walicki (Introduction to Mathematical Logic [2012], 2.3) | |
| A reaction: [symbolism translated into English] Walicki says they are called 'ordinal numbers', but are in fact a set. |
| 17756 | The union of finite ordinals is the first 'limit ordinal'; 2ω is the second... [Walicki] |
| Full Idea: We can form infinite ordinals by taking unions of ordinals. We can thus form 'limit ordinals', which have no immediate predecessor. ω is the first (the union of all finite ordinals), ω + ω = sω is second, 3ω the third.... | |
| From: Michal Walicki (Introduction to Mathematical Logic [2012], 2.3) |
| 17760 | Two infinite ordinals can represent a single infinite cardinal [Walicki] |
| Full Idea: There may be several ordinals for the same cardinality. ...Two ordinals can represent different ways of well-ordering the same number (aleph-0) of elements. | |
| From: Michal Walicki (Introduction to Mathematical Logic [2012], 2.3) | |
| A reaction: This only applies to infinite ordinals and cardinals. For the finite, the two coincide. In infinite arithmetic the rules are different. |
| 17757 | Members of ordinals are ordinals, and also subsets of ordinals [Walicki] |
| Full Idea: Every member of an ordinal is itself an ordinal, and every ordinal is a transitive set (its members are also its subsets; a member of a member of an ordinal is also a member of the ordinal). | |
| From: Michal Walicki (Introduction to Mathematical Logic [2012], 2.3) |
| 17762 | In non-Euclidean geometry, all Euclidean theorems are valid that avoid the fifth postulate [Walicki] |
| Full Idea: Since non-Euclidean geometry preserves all Euclid's postulates except the fifth one, all the theorems derived without the use of the fifth postulate remain valid. | |
| From: Michal Walicki (Introduction to Mathematical Logic [2012], 4.1) |
| 17754 | Inductive proof depends on the choice of the ordering [Walicki] |
| Full Idea: Inductive proof is not guaranteed to work in all cases and, particularly, it depends heavily on the choice of the ordering. | |
| From: Michal Walicki (Introduction to Mathematical Logic [2012], 2.1.1) | |
| A reaction: There has to be an well-founded ordering for inductive proofs to be possible. |
| 17742 | Scotus based modality on semantic consistency, instead of on what the future could allow [Walicki] |
| Full Idea: The link between time and modality was severed by Duns Scotus, who proposed a notion of possibility based purely on the notion of semantic consistency. 'Possible' means for him logically possible, that is, not involving contradiction. | |
| From: Michal Walicki (Introduction to Mathematical Logic [2012], History B.4) |
| 12899 | The timid student has knowledge without belief, lacking confidence in their correct answer [Lewis] |
| Full Idea: I allow knowledge without belief, as in the case of the timid student who knows the answer but has no confidence that he has it right, and so does not believe what he knows. | |
| From: David Lewis (Elusive Knowledge [1996], p.429) | |
| A reaction: [He cites Woozley 1953 for the timid student] I don't accept this example (since my views on knowledge are rather traditional, I find). Why would the student give that answer if they didn't believe it? Sustained timid correctness never happens. |
| 12897 | To say S knows P, but cannot eliminate not-P, sounds like a contradiction [Lewis] |
| Full Idea: If you claim that S knows that P, and yet grant that S cannot eliminate a certain possibility of not-P, it certainly seems as if you have granted that S does not after all know that P. To speak of fallible knowledge just sounds contradictory. | |
| From: David Lewis (Elusive Knowledge [1996], p.419) | |
| A reaction: Starting from this point, fallibilism seems to be a rather bold move. The only sensible response seems to be to relax the requirement that not-P must be eliminable. Best: in one epistemic context P, in another not-P. |
| 12898 | Justification is neither sufficient nor necessary for knowledge [Lewis] |
| Full Idea: I don't agree that the mark of knowledge is justification, first because justification isn't sufficient - your true opinion that you will lose the lottery isn't knowledge, whatever the odds; and also not necessary - for what supports perception or memory? | |
| From: David Lewis (Elusive Knowledge [1996]) | |
| A reaction: I don't think I agree. The point about the lottery is that an overwhelming reason will never get you to knowing that you won't win. But good reasons are coherent, not statistical. If perceptions are dubious, justification must be available. |
| 12895 | Knowing is context-sensitive because the domain of quantification varies [Lewis, by Cohen,S] |
| Full Idea: The context-sensitivity of 'knows' is a function of contextual restrictions on the domain of quantification. | |
| From: report of David Lewis (Elusive Knowledge [1996]) by Stewart Cohen - Contextualism Defended p.68 | |
| A reaction: I think the shifting 'domain of quantification' is one of the most interesting features of ordinary talk. Or, more plainly. 'what are you actually talking about?' is the key question in any fruitful dialogue. Sophisticated speakers tacitly shift domain. |
| 19562 | We have knowledge if alternatives are eliminated, but appropriate alternatives depend on context [Lewis, by Cohen,S] |
| Full Idea: S knows P if S's evidence eliminates every alternative. But the nature of the alternatives depends on context. So for Lewis, the context sensitivity of 'knows' is a function of contextual restrictions ln the domain of quantification. | |
| From: report of David Lewis (Elusive Knowledge [1996]) by Stewart Cohen - Contextualism Defended (and reply) 1 | |
| A reaction: A typical modern attempt to 'regiment' a loose term like 'context'. That said, I like the idea. I'm struck by how the domain varies during a conversation (as in 'what we are talking about'). Domains standardly contain 'objects', though. |
| 1748 | Archelaus was the first person to say that the universe is boundless [Archelaus, by Diog. Laertius] |
| Full Idea: Archelaus was the first person to say that the universe is boundless. | |
| From: report of Archelaus (fragments/reports [c.450 BCE]) by Diogenes Laertius - Lives of Eminent Philosophers 02.Ar.3 |
| 5989 | Archelaus said life began in a primeval slime [Archelaus, by Schofield] |
| Full Idea: Archelaus wrote that life on Earth began in a primeval slime. | |
| From: report of Archelaus (fragments/reports [c.450 BCE]) by Malcolm Schofield - Archelaus | |
| A reaction: This sounds like a fairly clearcut assertion of the production of life by evolution. Darwin's contribution was to propose the mechanism for achieving it. We should honour the name of Archelaus for this idea. |