25 ideas
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) |
14212 | A consistent theory just needs one model; isomorphic versions will do too, and large domains provide those [Lewis] |
Full Idea: A consistent theory is, by definition, one satisfied by some model; an isomorphic image of a model satisfies the same theories as the original model; to provide the making of an isomorphic image of any given model, a domain need only be large enough. | |
From: David Lewis (Putnam's Paradox [1984], 'Why Model') | |
A reaction: This is laying out the ground for Putnam's model theory argument in favour of anti-realism. If you are chasing the one true model of reality, then formal model theory doesn't seem to offer much encouragement. |
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) |
14213 | Anti-realists see the world as imaginary, or lacking joints, or beyond reference, or beyond truth [Lewis] |
Full Idea: Anti-realists say the only world is imaginary, or only has the parts or classes or relations we divide it into, or doubt that reference to the world is possible, or doubt that our interpretations can achieve truth. | |
From: David Lewis (Putnam's Paradox [1984], 'Why Anti-R') | |
A reaction: [compression of a paragraph on anti-realism] Lewis is a thoroughgoing realist. A nice example of the rhetorical device of ridiculing an opponent by suggesting that they don't even know what they themselves believe. |
14210 | A gerrymandered mereological sum can be a mess, but still have natural joints [Lewis] |
Full Idea: The mereological sum of the coffee in my cup, the ink in this sentence, a nearby sparrow, and my left shoe is a miscellaneous mess of an object, yet its boundaries are by no means unrelated to the joints of nature. | |
From: David Lewis (Putnam's Paradox [1984], 'What Might') | |
A reaction: In that case they do, but if there are no atoms at the root of physics then presumably their could also be thoroughly jointless assemblages, involving probability distributions etc. Even random scattered atoms seem rather short of joints. |
14215 | Causal theories of reference make errors in reference easy [Lewis] |
Full Idea: Whatever happens in special cases, causal theories usually make it easy to be wrong about the thing we refer to. | |
From: David Lewis (Putnam's Paradox [1984], 'What Is') | |
A reaction: I suppose the point of this is that there are no checks and balances to keep reference in focus, but just a requirement to keep connected to an increasingly attenuated causal chain. |
14209 | Descriptive theories remain part of the theory of reference (with seven mild modifications) [Lewis] |
Full Idea: Description theories of reference are supposed to have been well and truly refuted. I think not: ..it is still tenable with my seven points, and part of the truth of reference [7: rigidity, egocentric, tokens, causal, imperfect, indeterminate, families]. | |
From: David Lewis (Putnam's Paradox [1984], 'Glob Desc') | |
A reaction: (The bit at the end refers to his seven points, on p.59). He calls his basic proposal 'causal descriptivism', incorporating his seven slight modifications of traditional descriptivism about reference. |
13304 | Learned men gain more in one day than others do in a lifetime [Posidonius] |
Full Idea: In a single day there lies open to men of learning more than there ever does to the unenlightened in the longest of lifetimes. | |
From: Posidonius (fragments/reports [c.95 BCE]), quoted by Seneca the Younger - Letters from a Stoic 078 | |
A reaction: These remarks endorsing the infinite superiority of the educated to the uneducated seem to have been popular in late antiquity. It tends to be the religions which discourage great learning, especially in their emphasis on a single book. |
20820 | Time is an interval of motion, or the measure of speed [Posidonius, by Stobaeus] |
Full Idea: Posidonius defined time thus: it is an interval of motion, or the measure of speed and slowness. | |
From: report of Posidonius (fragments/reports [c.95 BCE]) by John Stobaeus - Anthology 1.08.42 | |
A reaction: Hm. Can we define motion or speed without alluding to time? Looks like we have to define them as a conjoined pair, which means we cannot fully understand either of them. |