28 ideas
| 14600 | Analysis aims at secure necessary and sufficient conditions [Schaffer,J] |
| Full Idea: An analysis is an attempt at providing finite, non-circular, and intuitively adequate necessary and sufficient conditions. | |
| From: Jonathan Schaffer (Causation and Laws of Nature [2008], 3) | |
| A reaction: Specifying the 'conditions' for something doesn't seem to quite add up to telling you what the thing is. A trivial side-effect might qualify as a sufficient condition for something, if it always happens. |
| 14603 | 'Reification' occurs if we mistake a concept for a thing [Schaffer,J] |
| Full Idea: 'Reification' occurs when a mere concept is mistaken for a thing. We seem generally prone to this sort of error. | |
| From: Jonathan Schaffer (Causation and Laws of Nature [2008], 3.1) | |
| A reaction: Personally I think we should face up to the fact that this is the only way we can think about generalised or abstract entities, and stop thinking of it as an 'error'. We have evolved to think well about objects, so we translate everything that way. |
| 14607 | T adds □p→p for reflexivity, and is ideal for modeling lawhood [Schaffer,J] |
| Full Idea: System T is a normal modal system augmented with the reflexivity-generating axiom □p→p, and is, I think, the best modal logic for modeling lawhood. | |
| From: Jonathan Schaffer (Causation and Laws of Nature [2008], n46) | |
| A reaction: Schaffer shows in the article why transitivity would not be appropriate for lawhood. |
| 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. |
| 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. |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 14604 | If a notion is ontologically basic, it should be needed in our best attempt at science [Schaffer,J] |
| Full Idea: Science represents our best systematic understanding of the world, and if a certain notion proves unneeded in our best attempt at that, this provides strong evidence that what this notion concerns is not ontologically basic. | |
| From: Jonathan Schaffer (Causation and Laws of Nature [2008], 3.2) | |
| A reaction: But is the objective of science to find out what is 'ontologically basic'? If scientists can't get a purchase on a question, they have no interest in it. What are electrons made of? |
| 14599 | Three types of reduction: Theoretical (of terms), Definitional (of concepts), Ontological (of reality) [Schaffer,J] |
| Full Idea: Theoretical reduction concerns terms found in a theory; Definitional reduction concerns concepts found in the mind; Ontological reduction is independent of how we conceptualize entities, or theorize about them, and is about reality. | |
| From: Jonathan Schaffer (Causation and Laws of Nature [2008], 1) | |
| A reaction: An Aristotelian definition refers to reality, rather than to our words or concepts. |
| 14605 | Tropes are the same as events [Schaffer,J] |
| Full Idea: Tropes can be identified with events. | |
| From: Jonathan Schaffer (Causation and Laws of Nature [2008], n17) | |
| A reaction: This is presumably on the view of events, associated with Kim, as instantiations of properties. This idea is a new angle on tropes and events which had never occurred to me. |
| 14601 | Individuation aims to count entities, by saying when there is one [Schaffer,J] |
| Full Idea: Individuation principles are attempts to describe how to count entities in a given domain, by saying when there is one. | |
| From: Jonathan Schaffer (Causation and Laws of Nature [2008], 3) | |
| A reaction: At last, someone tells me what they mean by 'individuation'! So it is just saying what your units are prior to counting, followed (presumably) by successful counting. It seems to aim more at kinds than at particulars. |
| 14606 | Only ideal conceivability could indicate what is possible [Schaffer,J] |
| Full Idea: The only plausible link from conceivability to possibility is via ideal conceivability. | |
| From: Jonathan Schaffer (Causation and Laws of Nature [2008], n22) | |
| A reaction: [He cites Chalmers 2002] I'm not sure what 'via' could mean here. Since I don't know any other way than attempted conceivability for assessing a possibility, I am a bit baffled by this idea. |
| 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. |