Answers are grounded in this paper and cite their sources.
We shed light on an old problem by showing that the logic LP cannot define a binary connective ⊙ obeying detachment in the sense that every valuation satisfying φ and ( φ ⊙ ψ ) also satisfies ψ , except trivially. We derive this as a corollary of a more general result concerning variable sharing.
No takes yet. Share an insight, caveat, or question.
Beall et al. (2012) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: