Bisequent Calculi for Neutral Free Logic with Definite Descriptions
Logic in Computer Science
2024-12-03 v1
Abstract
We present a bisequent calculus (BSC) for the minimal theory of definite descriptions (DD) in the setting of neutral free logic, where formulae with non-denoting terms have no truth value. The treatment of quantifiers, atomic formulae and simple terms is based on the approach developed by Pavlovi\'{c} and Gratzl. We extend their results to the version with identity and definite descriptions. In particular, the admissibility of cut is proven for this extended system.
Cite
@article{arxiv.2412.01712,
title = {Bisequent Calculi for Neutral Free Logic with Definite Descriptions},
author = {Andrzej Indrzejczak and Yaroslav Petrukhin},
journal= {arXiv preprint arXiv:2412.01712},
year = {2024}
}