Embedding of Quantified Higher-Order Nominal Modal Logic into Classical Higher-Order Logic

6 pages•Published: December 14, 2015

Abstract

In this paper, we present an embedding of higher-order nominal modal logic
into classical higher-order logic, and study its automation. There exists no automated theorem prover for first-order or higher-order nominal logic at the moment, hence, this is the first automation for this kind of logic.
In our work, we focus on nominal tense logic and have successfully proven some first theorems.

Keyphrases: embedding, higher order logic, hybrid logic, nominal logic

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

Links:	https://easychair.org/publications/paper/Cww
	https://doi.org/10.29007/dzc2

BibTeX entry

@inproceedings{ARQNL2014:Embedding_Quantified_Higher_Order,
  author    = {Max Wisniewski and Alexander Steen},
  title     = {Embedding of Quantified Higher-Order Nominal Modal Logic into Classical Higher-Order Logic},
  booktitle = {ARQNL 2014. Automated Reasoning in Quantified Non-Classical Logics},
  editor    = {Christoph Benzmüller and Jens Otten},
  series    = {EPiC Series in Computing},
  volume    = {33},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/Cww},
  doi       = {10.29007/dzc2},
  pages     = {59-64},
  year      = {2015}}

Download PDF Open PDF in browser