The Inverse Method for Many-Valued Logics

Kovács, Laura; Mantsivoda, Andrei; Воронков, Андрей

doi:10.1007/978-3-642-45114-0_2

Cited by 3 publications

(1 citation statement)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The method has been popularized by Degtyarev and Voronkov [6], who provide the general recipe to design forward calculi, with applications to Classical Predicate Logic and some non-classical logics. Further extensions can be found in [2,7,15]. A significant investigation is presented in [4,5], where focused calculi and polarization of formulas are exploited to reduce the search space in forward proof-search for Intuitionistic Logic.…”

Section: Introductionmentioning

confidence: 99%

Duality between Unprovability and Provability in Forward Refutation-search for Intuitionistic Propositional Logic

Fiorentini

Ferrari

2020

ACM Trans. Comput. Logic

View full text Add to dashboard Cite

The inverse method is a saturation based theorem proving technique; it relies on a forward proof-search strategy and can be applied to cut-free calculi enjoying the subformula property. Here we apply this method to derive the unprovability of a goal formula G in Intuitionistic Propositional Logic. To this aim we design a forward calculus FRJ(G) for Intuitionistic unprovability which is prone to constructively ascertain the unprovability of a formula G by providing a concise countermodel for it; in particular we prove that the generated countermodels have minimal height. Moreover, we clarify the role of the saturated database obtained as result of a failed proof-search in FRJ(G) by showing how to extract from such a database a derivation witnessing the Intuitionistic validity of the goal.

show abstract