Two-Variable Logic with Counting is Decidable

  title={Two-Variable Logic with Counting is Decidable},
  author={Erich Gr{\"a}del and Martin Otto and Eric Rosen},
w e prove that the satisfiability and the finite satisfiability problems for C2 are decidable. C2 is first-order logic with only two variables in the presence of arbitrary counting quantifiers 32", m 2 1. I t considerably extends L2, plain first-order with only two variables, which is known to be decidable by a result of Mortimer's. Unlike L2, C2 does not have the finite model property. 
Highly Cited
This paper has 191 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.
114 Citations
8 References
Similar Papers


Publications citing this paper.

192 Citations

Citations per Year
Semantic Scholar estimates that this publication has 192 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-8 of 8 references

On languages with two variables . Zeitschr . fiir math , Logik und Grundlagen der Math . , [ 8 ] M . Otto . Ptime canonization for two variables with counting

  • W. Szwast L. Pacholski
  • Proc . loth IEEE Symp . on Logic in Comp . Sci
  • 1997

Random graph isomorphism

  • Y. Gurevich
  • 1996


  • L. Babai
  • Ku cera, Canonical labellings of graphs in linear…
  • 1980
1 Excerpt

Ramsey Theory

  • R. Graham, B. Rothschild, J. Spencer
  • John Wiley and Sons
  • 1980
1 Excerpt

On the complexity of the decision problem for two - variable first - order logic

  • P. Kolaitis E. Gradel, M. Vardi
  • Bulletin of Symbolic Logic . To appear . [ 4 ]

Similar Papers

Loading similar papers…