33 ideas
| 8472 | Sentential logic is consistent (no contradictions) and complete (entirely provable) [Orenstein] |
| Full Idea: Sentential logic has been proved consistent and complete; its consistency means that no contradictions can be derived, and its completeness assures us that every one of the logical truths can be proved. | |
| From: Alex Orenstein (W.V. Quine [2002], Ch.5) | |
| A reaction: The situation for quantificational logic is not quite so clear (Orenstein p.98). I do not presume that being consistent and complete makes it necessarily better as a tool in the real world. |
| 8476 | Axiomatization simply picks from among the true sentences a few to play a special role [Orenstein] |
| Full Idea: In axiomatizing, we are merely sorting out among the truths of a science those which will play a special role, namely, serve as axioms from which we derive the others. The sentences are already true in a non-conventional or ordinary sense. | |
| From: Alex Orenstein (W.V. Quine [2002], Ch.5) | |
| A reaction: If you were starting from scratch, as Euclidean geometers may have felt they were doing, you might want to decide which are the simplest truths. Axiomatizing an established system is a more advanced activity. |
| 8480 | S4: 'poss that poss that p' implies 'poss that p'; S5: 'poss that nec that p' implies 'nec that p' [Orenstein] |
| Full Idea: The five systems of propositional modal logic contain successively stronger conceptions of necessity. In S4 'it is poss that it is poss that p' implies 'it is poss that p'. In S5, 'it is poss that it is nec that p' implies 'it is nec that p'. | |
| From: Alex Orenstein (W.V. Quine [2002], Ch.7) | |
| A reaction: C.I. Lewis originated this stuff. Any serious student of modality is probably going to have to pick a system. E.g. Nathan Salmon says that the correct modal logic is even weaker than S4. |
| 10888 | Sets can be defined by 'enumeration', or by 'abstraction' (based on a property) [Zalabardo] |
| Full Idea: We can define a set by 'enumeration' (by listing the items, within curly brackets), or by 'abstraction' (by specifying the elements as instances of a property), pretending that they form a determinate totality. The latter is written {x | x is P}. | |
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §1.3) |
| 8474 | Unlike elementary logic, set theory is not complete [Orenstein] |
| Full Idea: The incompleteness of set theory contrasts sharply with the completeness of elementary logic. | |
| From: Alex Orenstein (W.V. Quine [2002], Ch.5) | |
| A reaction: This seems to be Quine's reason for abandoning the Frege-Russell logicist programme (quite apart from the problems raised by Gödel. |
| 10889 | The 'Cartesian Product' of two sets relates them by pairing every element with every element [Zalabardo] |
|
Full Idea:
The 'Cartesian Product' of two sets, written A x B, is the relation which pairs every element of A with every element of B. So A x B = { |
|
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §1.6) |
| 10890 | A 'partial ordering' is reflexive, antisymmetric and transitive [Zalabardo] |
| Full Idea: A binary relation in a set is a 'partial ordering' just in case it is reflexive, antisymmetric and transitive. | |
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §1.6) |
| 10886 | Determinacy: an object is either in a set, or it isn't [Zalabardo] |
| Full Idea: Principle of Determinacy: For every object a and every set S, either a is an element of S or a is not an element of S. | |
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §1.2) |
| 10887 | Specification: Determinate totals of objects always make a set [Zalabardo] |
| Full Idea: Principle of Specification: Whenever we can specify a determinate totality of objects, we shall say that there is a set whose elements are precisely the objects that we have specified. | |
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §1.3) | |
| A reaction: Compare the Axiom of Specification. Zalabardo says we may wish to consider sets of which we cannot specify the members. |
| 8465 | Mereology has been exploited by some nominalists to achieve the effects of set theory [Orenstein] |
| Full Idea: The theory of mereology has had a history of being exploited by nominalists to achieve some of the effects of set theory. | |
| From: Alex Orenstein (W.V. Quine [2002], Ch.3) | |
| A reaction: Some writers refer to mereology as a 'theory', and others as an area of study. This appears to be an interesting line of investigation. Orenstein says Quine and Goodman showed its limitations. |
| 10897 | A first-order 'sentence' is a formula with no free variables [Zalabardo] |
| Full Idea: A formula of a first-order language is a 'sentence' just in case it has no free variables. | |
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §3.2) |
| 10893 | Γ |= φ for sentences if φ is true when all of Γ is true [Zalabardo] |
| Full Idea: A propositional logic sentence is a 'logical consequence' of a set of sentences (written Γ |= φ) if for every admissible truth-assignment all the sentences in the set Γ are true, then φ is true. | |
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §2.4) | |
| A reaction: The definition is similar for predicate logic. |
| 10899 | Γ |= φ if φ is true when all of Γ is true, for all structures and interpretations [Zalabardo] |
| Full Idea: A formula is the 'logical consequence' of a set of formulas (Γ |= φ) if for every structure in the language and every variable interpretation of the structure, if all the formulas within the set are true and the formula itself is true. | |
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §3.5) |
| 10896 | Propositional logic just needs ¬, and one of ∧, ∨ and → [Zalabardo] |
| Full Idea: In propositional logic, any set containing ¬ and at least one of ∧, ∨ and → is expressively complete. | |
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §2.8) |
| 8452 | Traditionally, universal sentences had existential import, but were later treated as conditional claims [Orenstein] |
| Full Idea: In traditional logic from Aristotle to Kant, universal sentences have existential import, but Brentano and Boole construed them as universal conditionals (such as 'for anything, if it is a man, then it is mortal'). | |
| From: Alex Orenstein (W.V. Quine [2002], Ch.2) | |
| A reaction: I am sympathetic to the idea that even the 'existential' quantifier should be treated as conditional, or fictional. Modern Christians may well routinely quantify over angels, without actually being committed to them. |
| 8475 | The substitution view of quantification says a sentence is true when there is a substitution instance [Orenstein] |
| Full Idea: The substitution view of quantification explains 'there-is-an-x-such-that x is a man' as true when it has a true substitution instance, as in the case of 'Socrates is a man', so the quantifier can be read as 'it is sometimes true that'. | |
| From: Alex Orenstein (W.V. Quine [2002], Ch.5) | |
| A reaction: The word 'true' crops up twice here. The alternative (existential-referential) view cites objects, so the substitution view is a more linguistic approach. |
| 10898 | The semantics shows how truth values depend on instantiations of properties and relations [Zalabardo] |
| Full Idea: The semantic pattern of a first-order language is the ways in which truth values depend on which individuals instantiate the properties and relations which figure in them. ..So we pair a truth value with each combination of individuals, sets etc. | |
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §3.3) | |
| A reaction: So truth reduces to a combination of 'instantiations', which is rather like 'satisfaction'. |
| 10902 | We can do semantics by looking at given propositions, or by building new ones [Zalabardo] |
| Full Idea: We can look at semantics from the point of view of how truth values are determined by instantiations of properties and relations, or by asking how we can build, using the resources of the language, a proposition corresponding to a given semantic pattern. | |
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §3.6) | |
| A reaction: The second version of semantics is model theory. |
| 10892 | We make a truth assignment to T and F, which may be true and false, but merely differ from one another [Zalabardo] |
| Full Idea: A truth assignment is a function from propositions to the set {T,F}. We will think of T and F as the truth values true and false, but for our purposes all we need to assume about the identity of these objects is that they are different from each other. | |
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §2.4) | |
| A reaction: Note that T and F are 'objects'. This remark is important in understanding modern logical semantics. T and F can be equated to 1 and 0 in the language of a computer. They just mean as much as you want them to mean. |
| 10895 | 'Logically true' (|= φ) is true for every truth-assignment [Zalabardo] |
| Full Idea: A propositional logic sentence is 'logically true', written |= φ, if it is true for every admissible truth-assignment. | |
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §2.4) |
| 10900 | Logically true sentences are true in all structures [Zalabardo] |
| Full Idea: In first-order languages, logically true sentences are true in all structures. | |
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §3.5) |
| 10894 | A sentence-set is 'satisfiable' if at least one truth-assignment makes them all true [Zalabardo] |
| Full Idea: A propositional logic set of sentences Γ is 'satisfiable' if there is at least one admissible truth-assignment that makes all of its sentences true. | |
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §2.4) |
| 10901 | Some formulas are 'satisfiable' if there is a structure and interpretation that makes them true [Zalabardo] |
| Full Idea: A set of formulas of a first-order language is 'satisfiable' if there is a structure and a variable interpretation in that structure such that all the formulas of the set are true. | |
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §3.5) |
| 10903 | A structure models a sentence if it is true in the model, and a set of sentences if they are all true in the model [Zalabardo] |
| Full Idea: A structure is a model of a sentence if the sentence is true in the model; a structure is a model of a set of sentences if they are all true in the structure. | |
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §3.6) |
| 9159 | You can't simply convert geometry into algebra, as some spatial content is lost [Burge] |
| Full Idea: Although one can translate geometrical propositions into algebraic ones and produce equivalent models, the meaning of geometrical propositions seems to me to be thereby lost. Pure geometry involves spatial content, even if abstracted from physical space. | |
| From: Tyler Burge (Frege on Apriority [2000], IV) | |
| A reaction: This supports Frege's view (against Quine) that geometry won't easily fit into the programme of logicism. I agree with Burge. You would be focusing on the syntax of geometry, and leaving out the semantics. |
| 8454 | The whole numbers are 'natural'; 'rational' numbers include fractions; the 'reals' include root-2 etc. [Orenstein] |
| Full Idea: The 'natural' numbers are the whole numbers 1, 2, 3 and so on. The 'rational' numbers consist of the natural numbers plus the fractions. The 'real' numbers include the others, plus numbers such a pi and root-2, which cannot be expressed as fractions. | |
| From: Alex Orenstein (W.V. Quine [2002], Ch.2) | |
| A reaction: The 'irrational' numbers involved entities such as root-minus-1. Philosophical discussions in ontology tend to focus on the existence of the real numbers. |
| 10891 | If a set is defined by induction, then proof by induction can be applied to it [Zalabardo] |
| Full Idea: Defining a set by induction enables us to use the method of proof by induction to establish that all the elements of the set have a certain property. | |
| From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §2.3) |
| 8473 | The logicists held that is-a-member-of is a logical constant, making set theory part of logic [Orenstein] |
| Full Idea: The question to be posed is whether is-a-member-of should be considered a logical constant, that is, does logic include set theory. Frege, Russell and Whitehead held that it did. | |
| From: Alex Orenstein (W.V. Quine [2002], Ch.5) | |
| A reaction: This is obviously the key element in the logicist programme. The objection seems to be that while first-order logic is consistent and complete, set theory is not at all like that, and so is part of a different world. |
| 8458 | Just individuals in Nominalism; add sets for Extensionalism; add properties, concepts etc for Intensionalism [Orenstein] |
| Full Idea: Modest ontologies are Nominalism (Goodman), admitting only concrete individuals; and Extensionalism (Quine/Davidson) which admits individuals and sets; but Intensionalists (Frege/Carnap/Church/Marcus/Kripke) may have propositions, properties, concepts. | |
| From: Alex Orenstein (W.V. Quine [2002], Ch.3) | |
| A reaction: I don't like sets, because of Idea 7035. Even the ontology of individuals could collapse dramatically (see the ideas of Merricks, e.g. 6124). The intensional items may be real enough, but needn't have a place at the ontological high table. |
| 8457 | The Principle of Conservatism says we should violate the minimum number of background beliefs [Orenstein] |
| Full Idea: The principle of conservatism in choosing between theories is a maxim of minimal mutilation, stating that of competing theories, all other things being equal, choose the one that violates the fewest background beliefs held. | |
| From: Alex Orenstein (W.V. Quine [2002], Ch.2) | |
| A reaction: In this sense, all rational people should be conservatives. The idea is a modern variant of Hume's objection to miracles (Idea 2227). A Kuhnian 'paradigm shift' is the dramatic moment when this principle no longer seems appropriate. |
| 8477 | People presume meanings exist because they confuse meaning and reference [Orenstein] |
| Full Idea: A good part of the confidence people have that there are meanings rests on the confusion of meaning and reference. | |
| From: Alex Orenstein (W.V. Quine [2002], Ch.6) | |
| A reaction: An important point. Everyone assumes that sentences link to the world, but Frege shows that that is not part of meaning. Words like prepositions and conjunctions ('to', 'and') don't have 'a meaning' apart from their function and use. |
| 8471 | Three ways for 'Socrates is human' to be true are nominalist, platonist, or Montague's way [Orenstein] |
| Full Idea: 'Socrates is human' is true if 1) subject referent is identical with a predicate referent (Nominalism), 2) subject reference member of the predicate set, or the subject has that property (Platonism), 3) predicate set a member of the subject set (Montague) | |
| From: Alex Orenstein (W.V. Quine [2002], Ch.3) | |
| A reaction: Orenstein offers these as alternatives to Quine's 'inscrutability of reference' thesis, which makes the sense unanalysable. |
| 8484 | If two people believe the same proposition, this implies the existence of propositions [Orenstein] |
| Full Idea: If we can say 'there exists a p such that John believes p and Barbara believes p', logical forms such as this are cited as evidence for our ontological commitment to propositions. | |
| From: Alex Orenstein (W.V. Quine [2002], Ch.7) | |
| A reaction: Opponents of propositions (such as Quine) will, of course, attempt to revise the logical form to eliminate the quantification over propositions. See Orenstein's outline on p.171. |