more on this theme     |     more from this thinker


Single Idea 10887

[filed under theme 4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / l. Axiom of Specification ]

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.

Gist of Idea

Specification: Determinate totals of objects always make a set

Source

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

Book Ref

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


A Reaction

Compare the Axiom of Specification. Zalabardo says we may wish to consider sets of which we cannot specify the members.


The 18 ideas from 'Introduction to the Theory of Logic'

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]