    Revisiting Counter-model Generation for Minimal Implicational Logic

The LMT^→ sequent calculus was introduced in Santos (2016). This paper presents a Termination proof and a new (more direct) Completeness proof for it. LMT^→ is aimed to be used for proof search in Propositional Minimal Implicational Logic (M^→), in a bottom-up approach. Termination of the calculus is guaranteed by a rule application strategy that stresses all the possible combinations. For an initial formula α, proofs in LMT^→ have an upper bound of |α| × 2^|α| + 1 + 2 × log_2|α|, which together with the system strategy ensure decidability. LMT^→ has the property to allow extractability of counter-models from failed proof searches (bicompleteness), i.e., the attempt proof tree of an expanded branch produces a Kripke model that falsifies the initial formula.

Authors

04/18/2018

Duality between unprovability and provability in forward proof-search for Intuitionistic Propositional Logic

The inverse method is a saturation based theorem proving technique; it r...
01/09/2022

On proof theory in computational complexity: overview

In [GH1] and [GH2] (see also [GH3]) we presented full proof of the equal...
12/28/2020

Yet another argument in favour of NP=CoNP

This article shows yet another proof of NP=CoNP. In a previous article, ...
02/21/2019

Schematic Refutations of Formula Schemata

Proof schemata are infinite sequences of proofs which are defined induct...
12/02/2019

A categorical reduction system for linear logic

We build calculus on the categorical model of linear logic. It enables u...
02/28/2020

Teaching a Formalized Logical Calculus

Classical first-order logic is in many ways central to work in mathemati...
07/01/2019

Trimming Graphs Using Clausal Proof Optimization

We present a method to gradually compute a smaller and smaller unsatisfi...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.