SOTAVerified

Dialogues for proof search

2014-05-08Code Available0· sign in to hype

Jesse Alama

Code Available — Be the first to reproduce this paper.

Reproduce

Code

Abstract

Dialogue games are a two-player semantics for a variety of logics, including intuitionistic and classical logic. Dialogues can be viewed as a kind of analytic calculus not unlike tableaux. Can dialogue games be an effective foundation for proof search in intuitionistic logic (both first-order and propositional)? We announce Kuno, an automated theorem prover for intuitionistic first-order logic based on dialogue games.

Reproductions