A Heuristic Proof Procedure for First-Order Logic

12/15/2017
by   Keehang Kwon, et al.
0

Inspired by the efficient proof procedures discussed in Computability logicJap03,Japic,Japfin, 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/22/2022

A Heuristic Proof Procedure for Propositional Logic

Theorem proving is one of the oldest applications which require heuristi...
research
05/08/2018

A new viewpoint of the Gödel's incompleteness theorem and its applications

A new viewpoint of the Gödel's incompleteness theorem be given in this a...
research
12/17/2020

Formalization of PAL·S5 in Proof Assistant

As an experiment to the application of proof assistant for logic researc...
research
05/08/2014

Dialogues for proof search

Dialogue games are a two-player semantics for a variety of logics, inclu...
research
07/04/2022

Sahlqvist-Type Completeness Theory for Hybrid Logic with Binder

In the present paper, we continue the research in <cit.> to develop the ...
research
06/25/2021

A Curiously Effective Backtracking Strategy for Connection Tableaux

Automated proof search with connection tableaux, such as implemented by ...
research
12/13/2018

Comparing several calculi for first-order infinite-valued Łukasiewicz logic

From the viewpoint of provability, we compare some Gentzen-type hyperseq...

Please sign up or login with your details

Forgot password? Click here to reset