Authors
Erich Gradel, Martin Otto, Eric Rosen
Publication date
1997/6/29
Conference
Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science
Pages
306-317
Publisher
IEEE
Description
We prove that the satisfiability and the finite satisfiability problems for C/sup 2/ are decidable. C/sup 2/ is first-order logic with only two variables in the presence of arbitrary counting quantifiers 3/sup /spl ges/m/,m/spl ges/1. It considerably extends L/sup 2/ plain first-order with only two variables, which is known to be decidable by a result of Mortimer's. Unlike L/sup 2/, C/sup 2/ does not have the finite model property.
Total citations
Scholar articles
E Gradel, M Otto, E Rosen - Proceedings of Twelfth Annual IEEE Symposium on …, 1997