Taming first-order logic

Mikulas, Szabolcs (1998) Taming first-order logic. Logic Journal of the IGPL 6 (2), pp. 305-316. ISSN 1367-0751.

Full text not available from this repository.

Official URL: https://doi.org/10.1093/jigpal/6.2.305

Abstract

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.

Metadata

Item Type:	Article
School:	Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences
Depositing User:	Sarah Hall
Date Deposited:	13 Jul 2021 14:52
Last Modified:	09 Aug 2023 12:51
URI:	https://eprints.bbk.ac.uk/id/eprint/45087

Statistics

Archive Staff Only (login required)