Combining Texts

All the ideas for 'Of Civil Liberty', 'Introduction to the Theory of Logic' and 'Plural Quantification'

unexpand these ideas     |    start again     |     specify just one area for these texts


29 ideas

2. Reason / D. Definition / 12. Paraphrase
'Some critics admire only one another' cannot be paraphrased in singular first-order [Linnebo]
     Full Idea: The Geach-Kaplan sentence 'Some critics admire only one another' provably has no singular first-order paraphrase using only its predicates.
     From: Řystein Linnebo (Plural Quantification [2008], 1)
     A reaction: There seems to be a choice of either going second-order (picking out a property), or going plural (collectively quantifying), or maybe both.
4. Formal Logic / F. Set Theory ST / 1. Set Theory
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)
4. Formal Logic / F. Set Theory ST / 2. Mechanics of Set Theory / b. Terminology of ST
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 = { | x ∈ A and y ∈ B}.
     From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §1.6)
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)
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / a. Axioms for sets
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)
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / l. Axiom of Specification
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.
5. Theory of Logic / A. Overview of Logic / 4. Pure Logic
A pure logic is wholly general, purely formal, and directly known [Linnebo]
     Full Idea: The defining features of a pure logic are its absolute generality (the objects of discourse are irrelevant), and its formality (logical truths depend on form, not matter), and its cognitive primacy (no extra-logical understanding is needed to grasp it).
     From: Řystein Linnebo (Plural Quantification [2008], 3)
     A reaction: [compressed] This strikes me as very important. The above description seems to contain no ontological commitment at all, either to the existence of something, or to two things, or to numbers, or to a property. Pure logic seems to be 'if-thenism'.
5. Theory of Logic / A. Overview of Logic / 5. First-Order Logic
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)
5. Theory of Logic / B. Logical Consequence / 4. Semantic Consequence |=
Γ |= φ 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.
Γ |= φ 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)
5. Theory of Logic / E. Structures of Logic / 2. Logical Connectives / b. Basic connectives
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)
5. Theory of Logic / G. Quantification / 6. Plural Quantification
Second-order quantification and plural quantification are different [Linnebo]
     Full Idea: Second-order quantification and plural quantification are generally regarded as different forms of quantification.
     From: Řystein Linnebo (Plural Quantification [2008], 2)
Traditionally we eliminate plurals by quantifying over sets [Linnebo]
     Full Idea: The traditional view in analytic philosophy has been that all plural locutions should be paraphrased away by quantifying over sets, though Boolos and other objected that this is unnatural and unnecessary.
     From: Řystein Linnebo (Plural Quantification [2008], 5)
Instead of complex objects like tables, plurally quantify over mereological atoms tablewise [Linnebo]
     Full Idea: Plural quantification can be used to eliminate the commitment of science and common sense to complex objects. We can use plural quantification over mereological atoms arranged tablewise or chairwise.
     From: Řystein Linnebo (Plural Quantification [2008], 4.5)
     A reaction: [He cites Hossack and van Ingwagen]
Plural plurals are unnatural and need a first-level ontology [Linnebo]
     Full Idea: Higher-order plural quantification (plural plurals) is often rejected because plural quantification is supposedly ontological innocent, with no plural things to be plural, and because it is not found in ordinary English.
     From: Řystein Linnebo (Plural Quantification [2008], 2.4)
     A reaction: [Summary; he cites Boolos as a notable rejector] Linnebo observes that Icelandic contains a word 'tvennir' which means 'two pairs of'.
Plural quantification may allow a monadic second-order theory with first-order ontology [Linnebo]
     Full Idea: Plural quantification seems to offer ontological economy. We can pay the price of a mere first-order theory and then use plural quantification to get for free the corresponding monadic second-order theory, which would be an ontological bargain.
     From: Řystein Linnebo (Plural Quantification [2008], 4.4)
     A reaction: [He mentions Hellman's modal structuralism in mathematics]
5. Theory of Logic / I. Semantics of Logic / 1. Semantics of Logic
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'.
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.
5. Theory of Logic / I. Semantics of Logic / 2. Formal Truth
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.
5. Theory of Logic / I. Semantics of Logic / 3. Logical Truth
'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)
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)
5. Theory of Logic / I. Semantics of Logic / 4. Satisfaction
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)
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)
5. Theory of Logic / J. Model Theory in Logic / 1. Logical Models
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)
6. Mathematics / B. Foundations for Mathematics / 4. Axioms for Number / f. Mathematical induction
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)
7. Existence / D. Theories of Reality / 11. Ontological Commitment / a. Ontological commitment
We speak of a theory's 'ideological commitments' as well as its 'ontological commitments' [Linnebo]
     Full Idea: Some philosophers speak about a theory's 'ideological commitments' and not just about its 'ontological commitments'.
     From: Řystein Linnebo (Plural Quantification [2008], 5.4)
     A reaction: This is a third strategy for possibly evading one's ontological duty, along with fiddling with the words 'exist' or 'object'. An ideological commitment to something to which one is not actually ontologically committed conjures up stupidity and dogma.
7. Existence / D. Theories of Reality / 11. Ontological Commitment / e. Ontological commitment problems
Ordinary speakers posit objects without concern for ontology [Linnebo]
     Full Idea: Maybe ordinary speakers aren't very concerned about their ontological commitments, and sometimes find it convenient to posit objects.
     From: Řystein Linnebo (Plural Quantification [2008], 2.4)
     A reaction: I think this is the whole truth about the ontological commitment of ordinary language. We bring abstraction under control by pretending it is a world of physical objects. The 'left wing' in politics, 'dark deeds', a 'huge difference'.
19. Language / C. Assigning Meanings / 3. Predicates
Predicates are 'distributive' or 'non-distributive'; do individuals do what the group does? [Linnebo]
     Full Idea: The predicate 'is on the table' is 'distributive', since some things are on the table if each one is, whereas the predicate 'form a circle' is 'non-distributive', since it is not analytic that when some things form a circle, each one forms a circle.
     From: Řystein Linnebo (Plural Quantification [2008], 1.1)
     A reaction: The first predicate can have singular or plural subjects, but the second requires a plural subject? Hm. 'The rope forms a circle'. The second is example is not true, as well as not analytic.
24. Political Theory / C. Ruling a State / 2. Leaders / b. Monarchy
Modern monarchies are (like republics) rule by law, rather than by men [Hume]
     Full Idea: In modern times monarchical government seems to have made the greatest advances towards perfection. It may now be affirmed of civilized monarchies, what was formerly said in praise of republics alone, that they are a government of laws, not of men.
     From: David Hume (Of Civil Liberty [1750], p.54)
     A reaction: Dreams of simple 'government by law' disappeared with the rise of modern media, which can be controlled by wealth.