The expressive power of two-variable least fixed-point logics

N/ACitations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The present paper gives a classification of the expressive power of two-variable least fixed-point logics. The main results are: 1. The two-variable fragment of monadic least fixed-point logic with parameters is as expressive as full monadic least fixed-point logic (on binary structures). 2. The two-variable fragment of monadic least fixed-point logic without parameters is as expressive as the two-variable fragment of binary least fixed-point logic without parameters. 3. The two-variable fragment of binary least fixed-point logic with parameters is strictly more expressive than the two-variable fragment of monadic least fixed-point logic with parameters (even on finite strings). © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Grohe, M., Kreutzer, S., & Schweikardt, N. (2005). The expressive power of two-variable least fixed-point logics. In Lecture Notes in Computer Science (Vol. 3618, pp. 422–434). Springer Verlag. https://doi.org/10.1007/11549345_37

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free