Abstract
In Sects. 7.1 and 7.2 we gave prefixed tableau rules for propositional modal logics in what we called the Lesser Modal Cube. Now we extend these to deal with quantifiers. But we have considered two versions of quantifier semantics: varying domain and constant domain. Not surprisingly, these correspond to different versions of tableau rules for quantifiers. Also not surprisingly, the rules corresponding to constant domain semantics are simpler, so we will start with them.
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
References
Fitting, M. (1996). First-order logic and automated theorem proving (First edition 1990). Springer-Verlag.
Priest, G. (2008). An introduction to non-classical logic: From if to is (2nd ed.). Cambridge introductions to philosophy. First Edition published 2001. Cambridge University Press.
Smullyan, R. M. (1968). First-order logic (Revised Edition, Dover Press, New York, 1994). Berlin: Springer-Verlag.
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). First-Order Modal Tableaus. In: First-Order Modal Logic. Synthese Library, vol 480. Springer, Cham. https://doi.org/10.1007/978-3-031-40714-7_9
Download citation
DOI: https://doi.org/10.1007/978-3-031-40714-7_9
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)