Bisequent Calculi for Neutral Free Logic with Definite Descriptions
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866915044698095616 |
|---|---|
| author | Indrzejczak, Andrzej Petrukhin, Yaroslav |
| author_facet | Indrzejczak, Andrzej Petrukhin, Yaroslav |
| contents | 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ć 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2412_01712 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Bisequent Calculi for Neutral Free Logic with Definite Descriptions Indrzejczak, Andrzej Petrukhin, Yaroslav Logic in Computer Science 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ć 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. |
| title | Bisequent Calculi for Neutral Free Logic with Definite Descriptions |
| topic | Logic in Computer Science |
| url | https://arxiv.org/abs/2412.01712 |