Abstract
In Chapter 6 we have seen that least fixed-point logic FO(LFP) captures PTIME, but does not strongly capture PTIME. In fact, it is open until now, whether there is any “natural” logic strongly capturing PTIME. At a first glance the following idea might be successful: Consider, for example, FO(LFP). One could think of strengthening it by adding some PTIME concepts, thereby enlarging its expressive power just up to PTIME. In traditional model theory there is a well-established method to enrich logics by new concepts, namely by adjoining so-called Lindström quantifiers. We have already met such quantifiers, for example, the counting quantifiers (cf. section 2.4).
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
© 1995 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Ebbinghaus, HD., Flum, J. (1995). Quantifiers and Logical Reductions. In: Finite Model Theory. Perspectives in Mathematical Logic. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-03182-7_11
Download citation
DOI: https://doi.org/10.1007/978-3-662-03182-7_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-03184-1
Online ISBN: 978-3-662-03182-7
eBook Packages: Springer Book Archive