Proof rules for the dialogical logic N

Jesse Alama; Sara L. Uckelman

doi:10.29007/843r

Download PDF Open PDF in browser

Proof rules for the dialogical logic N

6 pages•Published: March 25, 2013

Jesse Alama and Sara L. Uckelman

Abstract

We outline the beginnings of a proof-theory for the dialogical logic N introduced in [Alama & Uckelman, 2010].

Keyphrases: axiom, dialogical logic, dialogue game, proof theory

In: Andrei Voronkov, Geoff Sutcliffe, Matthias Baaz and Christian Fermüller (editors). LPAR-17-short. short papers for 17th International Conference on Logic for Programming, Artificial intelligence, and Reasoning., vol 13, pages 1--6

Links:	https://easychair.org/publications/paper/Dk
	https://doi.org/10.29007/843r

BibTeX entry

@inproceedings{LPAR-17-short:Proof_rules_for_dialogical,
  author    = {Jesse Alama and Sara L. Uckelman},
  title     = {Proof rules for the dialogical logic N},
  booktitle = {LPAR-17-short. short papers for 17th International Conference on Logic for Programming, Artificial intelligence, and Reasoning.},
  editor    = {Andrei Voronkov and Geoff Sutcliffe and Matthias Baaz and Christian Ferm\textbackslash{}"uller},
  series    = {EPiC Series in Computing},
  volume    = {13},
  pages     = {1--6},
  year      = {2013},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {https://easychair.org/publications/paper/Dk},
  doi       = {10.29007/843r}}

Download PDF Open PDF in browser