more on this theme     |     more from this text


Single Idea 10899

[filed under theme 5. Theory of Logic / B. Logical Consequence / 4. Semantic Consequence |= ]

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.

Gist of Idea

Γ |= φ if φ is true when all of Γ is true, for all structures and interpretations

Source

José L. Zalabardo (Introduction to the Theory of Logic [2000], §3.5)

Book Ref

Zalabardo,José L.: 'Introduction to the Theory of Logic' [Westview 2000], p.102


The 18 ideas from José L. Zalabardo

Determinacy: an object is either in a set, or it isn't [Zalabardo]
Specification: Determinate totals of objects always make a set [Zalabardo]
Sets can be defined by 'enumeration', or by 'abstraction' (based on a property) [Zalabardo]
The 'Cartesian Product' of two sets relates them by pairing every element with every element [Zalabardo]
A 'partial ordering' is reflexive, antisymmetric and transitive [Zalabardo]
If a set is defined by induction, then proof by induction can be applied to it [Zalabardo]
Γ |= φ for sentences if φ is true when all of Γ is true [Zalabardo]
We make a truth assignment to T and F, which may be true and false, but merely differ from one another [Zalabardo]
A sentence-set is 'satisfiable' if at least one truth-assignment makes them all true [Zalabardo]
'Logically true' (|= φ) is true for every truth-assignment [Zalabardo]
Propositional logic just needs ¬, and one of ∧, ∨ and → [Zalabardo]
A first-order 'sentence' is a formula with no free variables [Zalabardo]
The semantics shows how truth values depend on instantiations of properties and relations [Zalabardo]
Some formulas are 'satisfiable' if there is a structure and interpretation that makes them true [Zalabardo]
Logically true sentences are true in all structures [Zalabardo]
Γ |= φ if φ is true when all of Γ is true, for all structures and interpretations [Zalabardo]
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]
We can do semantics by looking at given propositions, or by building new ones [Zalabardo]