Taming first-order logic
Szabolcs Mikulás · Logic Journal of IGPL · 1998
In this paper we define computationally well-behaved versions of classical first-order logic and prove that the validity problem is decidable. Key words: first-order logic, decidability, relativization, mosaic, polyadic and counting quantifiers.