We show that for any pair φ and ψ of contradictory formulas of dependence logic there is a formula θ of the same logic such that φ≡θ and ψ≡θ. This generalizes a result of Burgess.
No takes yet. Share an insight, caveat, or question.
Kontinen et al. (2010) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: