Abstract
In Section 2.2 we gave prefixed tableau rules for several propositional modal logics. 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 somewhat simpler, so we will start with them.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Fitting, M., Mendelsohn, R.L. (1998). First-Order Tableaus. In: First-Order Modal Logic. Synthese Library, vol 277. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-5292-1_5
Download citation
DOI: https://doi.org/10.1007/978-94-011-5292-1_5
Publisher Name: Springer, Dordrecht
Print ISBN: 978-0-7923-5335-5
Online ISBN: 978-94-011-5292-1
eBook Packages: Springer Book Archive