Dialogues for proof search

Jesse Alama

doi:10.29007/5t86

Download PDF Open PDF in browser

Dialogues for proof search

6 pages•Published: December 14, 2015

Jesse Alama

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.

Keyphrases: automated theorem proving, dialogical logic, dialogue games, intuitionistic logic, proof search

In: Christoph Benzmüller and Jens Otten (editors). ARQNL 2014. Automated Reasoning in Quantified Non-Classical Logics, vol 33, pages 65--70

Links:	https://easychair.org/publications/paper/Q5SW
	https://doi.org/10.29007/5t86

BibTeX entry

@inproceedings{ARQNL2014:Dialogues_for_proof_search,
  author    = {Jesse Alama},
  title     = {Dialogues for proof search},
  booktitle = {ARQNL 2014. Automated Reasoning in Quantified Non-Classical Logics},
  editor    = {Christoph Benzm\textbackslash{}"uller and Jens Otten},
  series    = {EPiC Series in Computing},
  volume    = {33},
  pages     = {65--70},
  year      = {2015},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {https://easychair.org/publications/paper/Q5SW},
  doi       = {10.29007/5t86}}

Download PDF Open PDF in browser