EUVIMEDEUVIMED entdecken
Open Access · CC BY-NC-ND 4.0

NORMALISATION FOR POSITIVE FREE LOGICS WITHOUT AND WITH DEFINITE DESCRIPTIONS

NILS KÜRBIS

The Review of Symbolic Logic · 2026-09 · 19 (3) · 403-426

DOI: 10.1017/s1755020326101166 ↗

Kurz gefasst

Fachartikel in der Zeitschrift The Review of Symbolic Logic, online erschienen am 26.05.2026. Verfasst von NILS KÜRBIS. Die Arbeit wurde bisher 2-mal zitiert (Crossref) und nennt 38 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC-ND 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

This paper proves normalisation theorems for intuitionist and classical positive free logic, without and with the ι $\iota $ iota operator for definite descriptions ‘the F ’. Positive free logic also opens a number of options for rules for ι $\iota $ iota . In total, six different formalisations of theories of definite descriptions will be discussed, three proposed by Lambert, and three alternatives. The latter are motivated by considerations relating to proof-theoretic harmony between introduction and elimination rules. The philosophical importance of the various systems and results is indicated. The paper builds on [20], but is largely self-contained. The proofs for the present systems are easier than those for negative free logic.

Zitieren

APA

KÜRBIS, N. (2026). NORMALISATION FOR POSITIVE FREE LOGICS WITHOUT AND WITH DEFINITE DESCRIPTIONS. The Review of Symbolic Logic, 19(3), 403-426. https://doi.org/10.1017/s1755020326101166

Vancouver

KÜRBIS N. NORMALISATION FOR POSITIVE FREE LOGICS WITHOUT AND WITH DEFINITE DESCRIPTIONS. The Review of Symbolic Logic. 2026;19(3):403-426. doi:10.1017/s1755020326101166

BibTeX
@article{KRBIS2026,
  author = {KÜRBIS, NILS},
  title = {NORMALISATION FOR POSITIVE FREE LOGICS WITHOUT AND WITH DEFINITE DESCRIPTIONS},
  journal = {The Review of Symbolic Logic},
  year = {2026},
  volume = {19},
  number = {3},
  pages = {403--426},
  doi = {10.1017/s1755020326101166}
}
Kostenlos starten →