A Binary Quantifier for Definite Descriptions in Intuitionist Negative Free Logic: Natural Deduction and Normalisation

Nils Kürbis

Bulletin of the Section of Logic (2019)

  • Volume: 48, Issue: 2, page 81-97
  • ISSN: 0138-0680

Abstract

top
This paper presents a way of formalising definite descriptions with a binary quantifier ℩, where ℩x[F, G] is read as `The F is G'. Introduction and elimination rules for ℩ in a system of intuitionist negative free logic are formulated. Procedures for removing maximal formulas of the form ℩x[F, G] are given, and it is shown that deductions in the system can be brought into normal form.

How to cite

top

Nils Kürbis. "A Binary Quantifier for Definite Descriptions in Intuitionist Negative Free Logic: Natural Deduction and Normalisation." Bulletin of the Section of Logic 48.2 (2019): 81-97. <http://eudml.org/doc/295546>.

@article{NilsKürbis2019,
abstract = {This paper presents a way of formalising definite descriptions with a binary quantifier ℩, where ℩x[F, G] is read as `The F is G'. Introduction and elimination rules for ℩ in a system of intuitionist negative free logic are formulated. Procedures for removing maximal formulas of the form ℩x[F, G] are given, and it is shown that deductions in the system can be brought into normal form.},
author = {Nils Kürbis},
journal = {Bulletin of the Section of Logic},
keywords = {definite descriptions; negative intuitionist free logic; natural deduction; normalization},
language = {eng},
number = {2},
pages = {81-97},
title = {A Binary Quantifier for Definite Descriptions in Intuitionist Negative Free Logic: Natural Deduction and Normalisation},
url = {http://eudml.org/doc/295546},
volume = {48},
year = {2019},
}

TY - JOUR
AU - Nils Kürbis
TI - A Binary Quantifier for Definite Descriptions in Intuitionist Negative Free Logic: Natural Deduction and Normalisation
JO - Bulletin of the Section of Logic
PY - 2019
VL - 48
IS - 2
SP - 81
EP - 97
AB - This paper presents a way of formalising definite descriptions with a binary quantifier ℩, where ℩x[F, G] is read as `The F is G'. Introduction and elimination rules for ℩ in a system of intuitionist negative free logic are formulated. Procedures for removing maximal formulas of the form ℩x[F, G] are given, and it is shown that deductions in the system can be brought into normal form.
LA - eng
KW - definite descriptions; negative intuitionist free logic; natural deduction; normalization
UR - http://eudml.org/doc/295546
ER -

References

top
  1. [1] D. Bostock, Intermediate Logic, Oxford: Clarendon Press, 1997.  
  2. [2] M. Dummett, Frege. Philosophy of Language, 2 ed., Cambridge: Harvard University Press, 1981.  
  3. [3] A. Indrzejczak, Cut-Free Modal Theory of Definite Descriptions, [in:] Advances in Modal Logic, G. Bezhanishvili, G. D'Agostino, G. Metcalfe and T. Studer (eds.), vol. 12, pp. 359–378, London: College Publications, 2018.  
  4. [4] A. Indrzejczak, Fregean Description Theory in Proof-Theoretical Setting, Logic and Logical Philosophy, vol. 28, no. 1 (2018), pp. 137–155. http://dx.doi.org/10.12775/LLP.2018.008  
  5. [5] D. Prawitz, Natural Deduction: A Proof-Theoretical Study, Stockholm, Göteborg, Uppsala: Almqvist and Wiksell, 1965.  
  6. [6] D. Scott, Identity and Existence in Intuitionistic Logic, [in:] Applications of Sheaves, Michael Fourman, Christopher Mulvery, Dana Scott (eds.), Berlin, Heidelberg, New York: Springer, 1979. https://doi.org/10.1007/BFb0061839  
  7. [7] N. Tennant, A General Theory of Abstraction Operators, The Philosophical Quarterly, vol. 54, no. 214 (2004), pp. 105–133. https://doi.org/10.1111/j.0031-8094.2004.00344.x  
  8. [8] N. Tennant, Natural Logic, Edinburgh: Edinburgh University Press, 1978.  
  9. [9] A. S. Troelstra and H. Schwichtenberg, Basic Proof Theory, Cambridge University Press, 2 ed., 2000. https://doi.org/10.1017/CBO9781139168717  

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.