For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
A Heuristic Proof Procedure for First-Order Logic
IEICE TRANSACTIONS on Information and Systems
Publication Date: 2020/03/01
Online ISSN: 1745-1361
Type of Manuscript: Special Section LETTER (Special Section on Foundations of Computer Science — Frontiers of Theory of Computation and Algorithm —)
proof procedures, heuristics, game semantics, classical logic,
Full Text: PDF>>
Inspired by the efficient proof procedures discussed in Computability logic ,,, we describe a heuristic proof procedure for first-order logic. This is a variant of Gentzen sequent system  and has the following features: (a) it views sequents as games between the machine and the environment, and (b) it views proofs as a winning strategy of the machine. From this game-based viewpoint, a poweful heuristic can be extracted and a fair degree of determinism in proof search can be obtained. This article proposes a new deductive system LKg with respect to first-order logic and proves its soundness and completeness.