display all the ideas for this combination of texts
7 ideas
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) |