Abstract
We have seen several soundness and completeness proofs so far. And we have just introduced four more tableau systems in need of such proofs. For each of the modal logics from the Lesser Modal Cube, Fig. 7.1, we have a quantified version that is constant domain and a quantified version that is varying domain. For each of these we have versions with and without equality. And we have predicate abstract extensions for which terms always designate and extensions for which terms might not designate. Rather than give a multiplicity of soundness and completeness arguments in full detail we just summarize what needs to be added to earlier proofs and we do this for a single representative example.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Fitting, M., Mendelsohn, R.L. (2023). Tableau Soundness and Completeness. In: First-Order Modal Logic. Synthese Library, vol 480. Springer, Cham. https://doi.org/10.1007/978-3-031-40714-7_16
Download citation
DOI: https://doi.org/10.1007/978-3-031-40714-7_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-40713-0
Online ISBN: 978-3-031-40714-7
eBook Packages: Religion and PhilosophyPhilosophy and Religion (R0)