Combining Texts

All the ideas for 'That Politics may be reduced to a Science', 'On the Elements of Being: I' and 'Introduction to the Theory of Logic'

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


24 ideas

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 / 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 / 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 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)
'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)
5. Theory of Logic / I. Semantics of Logic / 4. Satisfaction
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)
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)
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)
8. Modes of Existence / B. Properties / 13. Tropes / a. Nature of tropes
'Socrates is wise' means a concurrence sum contains a member of a similarity set [Williams,DC]
     Full Idea: 'Socrates is wise' means that the concurrence sum (Socrates) includes a trope which is a member of the similarity set (Wisdom).
     From: Donald C. Williams (On the Elements of Being: I [1953], p.119)
     A reaction: Resemblance has to be taken as a basic (and presumably unanalysable) concept, which invites Russell's objection (Idea 4441).
A 'trope' is an abstract particular, the occurrence of an essence [Williams,DC]
     Full Idea: I shall divert the word 'trope' to stand for the abstract particular which is, so to speak, the occurrence of an essence.
     From: Donald C. Williams (On the Elements of Being: I [1953], p.115)
     A reaction: Thus tropes entered philosophical discussion. Presumably the precedent for an 'abstract particular' would be a particular occurrence of the number 7.
A world is completely constituted by its tropes and their connections [Williams,DC]
     Full Idea: Any possible world, and hence, of course, this one, is completely constituted by its tropes and connections of location and similarity.
     From: Donald C. Williams (On the Elements of Being: I [1953], p.116)
     A reaction: Note that Williams regularly referred to possible worlds in 1953. This is a full-blooded trope theory, which asserts that objects are bundles of tropes, so that both particulars and universals are ontologically taken care of.
23. Ethics / C. Virtue Theory / 4. External Goods / d. Friendship
Friendship without community spirit misses out on the main part of virtue [Hume]
     Full Idea: A man who is only susceptible of friendship, without public spirit or a regard to the community, is deficient in the most material part of virtue.
     From: David Hume (That Politics may be reduced to a Science [1750], p.21)
     A reaction: I think this is aimed at the epicureans. If the highest virtues are focused on one's friends that can easily lead to injustice, because it can tolerate prejudice against people who are very unlike one's friends.
24. Political Theory / B. Nature of a State / 3. Constitutions
It would be absurd if even a free constitution did not impose restraints, for the public good [Hume]
     Full Idea: A republican and free form of government would be an obvious absurdity, if the particular checks and controls, provided by the constitution, had really no influence, and made it not the interest, even of bad men, to act for the public good.
     From: David Hume (That Politics may be reduced to a Science [1750], p.14)
     A reaction: Presumably if you attain absolute power you can write any old constitution you like (Clause 1: the presidency is for life). But there does seem much point in doing it - unless it is to facilitate the use of the law for persecutions.
24. Political Theory / C. Ruling a State / 2. Leaders / d. Elites
Nobility either share in the power of the whole, or they compose the power of the whole [Hume]
     Full Idea: A nobility may possess power in two different ways. Either every nobleman shares the power as part of the whole body, or the whole body enjoys the power as composed of parts, which each have a distinct power and authority.
     From: David Hume (That Politics may be reduced to a Science [1750], p.15)
     A reaction: He says the first type is found in Venice, and is preferable to the second type, which is found in Poland. Presumably in the shared version there is some restraint on depraved nobles. The danger is each noble being an autocrat.