A Canonical Model Proof of Strong Completeness for BQL
Ben Middleton · arXiv (Cornell University) · 2019
I prove using a canonical model construction that a simple extension of Visser's natural deduction system for Basic Propositional Logic is both sound and strongly complete with respect to Basic First-Order Logic (BQL). I utilize the canonical model construction to show that BQL satisfies both the Disjunction Property and the Existence Property.