First-Order Fischer Servi Logic
Logic
2024-02-12 v1 Logic in Computer Science
Abstract
We prove the completeness of a first-order analogue of the Fischer Servi logic with respect to its expected birelational semantics. To this end we introduce the notion of the and, much like in a canonical model argument, prove a truth lemma. We conclude by examining a number of other first-order Fischer Servi logics, including the first-order analogue of , whose completeness can be similarly proved.
Cite
@article{arxiv.2402.06600,
title = {First-Order Fischer Servi Logic},
author = {Ahmee Christensen},
journal= {arXiv preprint arXiv:2402.06600},
year = {2024}
}
Comments
19 pages, 8 figures