Hallden incomplete calculus of names
Piotr Kulicki · PhilPapers (PhilPapers Foundation) · 2010
Hallden completeness is a weaker version of "disjunction property" for logical systems, defined as follows:if α ∨ β ∈ L and var(α) ∩ var(β) = ∅, then α ∈ L or β ∈ L;where L is a system, α and β are formulae and for any formula γ, var(γ) denotes a set of free variables contained in γ.