论文信息 - Taming First-Order Logic - 字舞流文

Taming First-Order Logic

In this paper we define computationally well-behaved versions of classical first-order logic and prove that the validity problem is decidable1.

Szabolcs Mikulás

[1] S. Salvati. Journal of Logic, Language and Information , 2017 .

[2] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.

[3] Y. Venema. A Modal Logic for Quantiication and Substitution , 1994 .

[4] Yde Venema,et al. A modal logic of relations , 1999 .

[5] Yuri Gurevich. The Decision Problem for Standard Classes , 1976, J. Symb. Log..

[6] Johan van Benthem,et al. Back and Forth Between Modal Logic and Classical Logic , 1995, Log. J. IGPL.

[7] Maarten Marx,et al. Undecidable Relativizations of Algebras of Relations , 1999, J. Symb. Log..

[8] Ian M. Hodkinson,et al. Finite algebras of relations are representable on finite sets , 1999, Journal of Symbolic Logic.

[9] Yde Venema. A Modal Logic for Quantification and Substitution , 1994, Log. J. IGPL.