Combining Texts
Ideas for
'In Defense of Essentialism', 'The Problem of Possibilia' and 'Introduction to the Theory of Logic'
expand these ideas
|
start again
|
choose
another area for these texts
display all the ideas for this combination of texts
12 ideas
5. Theory of Logic / A. Overview of Logic / 5. First-Order Logic
10897
|
A first-order 'sentence' is a formula with no free variables [Zalabardo]
|
5. Theory of Logic / B. Logical Consequence / 4. Semantic Consequence |=
10893
|
Γ |= φ for sentences if φ is true when all of Γ is true [Zalabardo]
|
10899
|
Γ |= φ if φ is true when all of Γ is true, for all structures and interpretations [Zalabardo]
|
5. Theory of Logic / E. Structures of Logic / 2. Logical Connectives / b. Basic connectives
10896
|
Propositional logic just needs ¬, and one of ∧, ∨ and → [Zalabardo]
|
5. Theory of Logic / I. Semantics of Logic / 1. Semantics of Logic
10898
|
The semantics shows how truth values depend on instantiations of properties and relations [Zalabardo]
|
10902
|
We can do semantics by looking at given propositions, or by building new ones [Zalabardo]
|
5. Theory of Logic / I. Semantics of Logic / 2. Formal Truth
10892
|
We make a truth assignment to T and F, which may be true and false, but merely differ from one another [Zalabardo]
|
5. Theory of Logic / I. Semantics of Logic / 3. Logical Truth
10900
|
Logically true sentences are true in all structures [Zalabardo]
|
10895
|
'Logically true' (|= φ) is true for every truth-assignment [Zalabardo]
|
5. Theory of Logic / I. Semantics of Logic / 4. Satisfaction
10894
|
A sentence-set is 'satisfiable' if at least one truth-assignment makes them all true [Zalabardo]
|
10901
|
Some formulas are 'satisfiable' if there is a structure and interpretation that makes them true [Zalabardo]
|
5. Theory of Logic / J. Model Theory in Logic / 1. Logical Models
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 [Zalabardo]
|