| 2000 | Introduction to the Theory of Logic |
| §1.2 | p.4 | 10886 | Determinacy: an object is either in a set, or it isn't |
| 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) |
| §1.3 | p.5 | 10887 | Specification: Determinate totals of objects always make a set |
| 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. |
| §1.3 | p.6 | 10888 | Sets can be defined by 'enumeration', or by 'abstraction' (based on a property) |
| 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) |
| §1.6 | p.20 | 10889 | The 'Cartesian Product' of two sets relates them by pairing every element with every element |
|
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) |
| §1.6 | p.23 | 10890 | A 'partial ordering' is reflexive, antisymmetric and transitive |
| 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) |
| §2.3 | p.48 | 10891 | If a set is defined by induction, then proof by induction can be applied to it |
| 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) |
| §2.4 | p.50 | 10892 | We make a truth assignment to T and F, which may be true and false, but merely differ from one another |
| 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. |
| §2.4 | p.51 | 10893 | Γ |= φ for sentences if φ is true when all of Γ is true |
| 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. |
| §2.4 | p.53 | 10895 | 'Logically true' (|= φ) is true for every truth-assignment |
| 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) |
| §2.4 | p.53 | 10894 | A sentence-set is 'satisfiable' if at least one truth-assignment makes them all true |
| 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) |
| §2.8 | p.71 | 10896 | Propositional logic just needs ¬, and one of ∧, ∨ and → |
| 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) |
| §3.2 | p.89 | 10897 | A first-order 'sentence' is a formula with no free variables |
| 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) |
| §3.3 | p.90 | 10898 | The semantics shows how truth values depend on instantiations of properties and relations |
| 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'. |
| §3.5 | p.102 | 10899 | Γ |= φ if φ is true when all of Γ is true, for all structures and interpretations |
| 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) |
| §3.5 | p.106 | 10901 | Some formulas are 'satisfiable' if there is a structure and interpretation that makes them true |
| 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) |
| §3.5 | p.106 | 10900 | Logically true sentences are true in all structures |
| 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) |
| §3.6 | p.109 | 10902 | We can do semantics by looking at given propositions, or by building new ones |
| 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. |
| §3.6 | p.110 | 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 |
| 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) |