Abstract
By a prenex formula is meant a formula of the form (q1x1)...(q n x n )(M) where each q i is one of the quantifier symbols “∀”, “∃”, and x i ≠ x j , for i ≠ j, and M is a quantifier-free formula (i.e. M contains no quantifiers at all). One sometimes refers to M as the matrix of the prenex formula (q1x1)...(q n x n )(M), and (q1x1)...(q n x n ) is called the prefix.
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
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1968 Springer-Verlag Berlin · Heidelberg
About this chapter
Cite this chapter
Smullyan, R.M. (1968). Prenex Tableaux. In: First-Order Logic. Ergebnisse der Mathematik und ihrer Grenzgebiete, vol 43. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-86718-7_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-86718-7_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-86720-0
Online ISBN: 978-3-642-86718-7
eBook Packages: Springer Book Archive