BIROn - Birkbeck Institutional Research Online

    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.

    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: School of Business, Economics & Informatics > Computer Science and Information Systems
    Depositing User: Sarah Hall
    Date Deposited: 13 Jul 2021 14:52
    Last Modified: 13 Jul 2021 14:52
    URI: https://eprints.bbk.ac.uk/id/eprint/45087

    Statistics

    Downloads
    Activity Overview
    0Downloads
    8Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item