Two-variable logic with counting is decidable
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science(1997)
摘要
We prove that the satisfiability and the finite satisfiability problems for C^2 are decidable. C^2 is first-order logic with only two variables in the presence of arbitrary counting quantifiers, "there exist at least m elements x", for m a natural number. It considerably extends L^2, plain first-order with only two variables, which is known to be decidable by a result of Mortimer's. Unlike L^2, C^2 does not have the finite model property.
更多查看译文
关键词
two-variable logic,finite satisfiability problem,finite model property,natural number,plain first-order,first-order logic,arbitrary counting quantifiers,m element,decidability,satisfiability,first order logic,formal logic,first order,computability
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要