26 ideas
| 15842 | An ad hominem refutation is reasonable, if it uses the opponent's assumptions [Harte,V] |
| Full Idea: Judicious use of an opponent's assumptions is quite capable of producing a perfectly reasonable ad hominem refutation of the opponent's thesis. | |
| From: Verity Harte (Plato on Parts and Wholes [2002], 1.6) |
| 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) |
| 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. |
| 15841 | Mereology began as a nominalist revolt against the commitments of set theory [Harte,V] |
| Full Idea: Historically, the evolution of mereology was associated with the desire to find alternatives to set theory for those with nomimalist qualms about the commitment to abstract objects like sets. | |
| From: Verity Harte (Plato on Parts and Wholes [2002], 1.2) | |
| A reaction: Goodman, for example. It is interesting to note that the hardline nominalist Quine, pal of Goodman, eventually accepted set theory. It is difficult to account for things by merely naming their parts. |
| 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) |
| 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) |
| 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. |
| 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) |
| 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) |
| 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) |
| 15858 | Traditionally, the four elements are just what persists through change [Harte,V] |
| Full Idea: Earth, air, fire and water, viewed as elements, are, by tradition, the leading candidates for being the things that persist through change. | |
| From: Verity Harte (Plato on Parts and Wholes [2002], 4.4) | |
| A reaction: Physics still offers us things that persist through change, as conservation laws. |
| 15848 | Mereology treats constitution as a criterion of identity, as shown in the axiom of extensionality [Harte,V] |
| Full Idea: Mereologists do suppose that constitution is a criterion of identity. This view is enshrined in the Mereological axiom of extensionality; that objects with the same parts are identical. | |
| From: Verity Harte (Plato on Parts and Wholes [2002], 3.1) | |
| A reaction: A helpful explanation of why classical mereology is a very confused view of the world. It is at least obvious that a long wall and a house are different things, even if built of identical bricks. |
| 15837 | What exactly is a 'sum', and what exactly is 'composition'? [Harte,V] |
| Full Idea: The difficulty with the claim that a whole is (just) the sum of its parts is what are we to understand by 'the sum'? ...If we say wholes are 'composites' of parts, how are we to understand the relation of composition? | |
| From: Verity Harte (Plato on Parts and Wholes [2002], 1.1) |
| 15839 | If something is 'more than' the sum of its parts, is the extra thing another part, or not? [Harte,V] |
| Full Idea: Holism inherits all the difficulties associated with the term 'sum' and adds one of its own, when it says a whole is 'more than' the sum of its parts. This seems to say it has something extra? Is this something extra a part? | |
| From: Verity Harte (Plato on Parts and Wholes [2002], 1.1) | |
| A reaction: [compressed] Most people take the claim that a thing is more than the sum of its parts as metaphorical, I would think (except perhaps emergentists about the mind, and they are wrong). |
| 15838 | The problem with the term 'sum' is that it is singular [Harte,V] |
| Full Idea: For my money, the real problem with the term 'sum' is that it is singular. | |
| From: Verity Harte (Plato on Parts and Wholes [2002], 1.1) | |
| A reaction: Her point is that the surface grammar makes you accept a unity here, with no account of what unifies it, or even whether there is a unity. Does classical mereology have a concept (as the rest of us do) of 'disunity'? |
| 14080 | Are causal descriptions part of the causal theory of reference, or are they just metasemantic? [Kaplan, by Schaffer,J] |
| Full Idea: Kaplan notes that the causal theory of reference can be understood in two quite different ways, as part of the semantics (involving descriptions of causal processes), or as metasemantics, explaining why a term has the referent it does. | |
| From: report of David Kaplan (Dthat [1970]) by Jonathan Schaffer - Deflationary Metaontology of Thomasson 1 | |
| A reaction: [Kaplan 'Afterthought' 1989] The theory tends to be labelled as 'direct' rather than as 'causal' these days, but causal chains are still at the heart of the story (even if more diffused socially). Nice question. Kaplan takes the meta- version as orthodox. |