Normalisation and subformula property for a system of classical logic with Tarski’s rule
Archive for Mathematical Logic · 2022-02 · 61 (1-2) · 105-129
DOI: 10.1007/s00153-021-00775-6 ↗Kurz gefasst
Fachartikel in der Zeitschrift Archive for Mathematical Logic, online erschienen am 31.05.2021. Verfasst von Nils Kürbis. Die Arbeit wurde bisher 5-mal zitiert (Crossref) und nennt 16 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
This paper considers a formalisation of classical logic using general introduction rules and general elimination rules. It proposes a definition of ‘maximal formula’, ‘segment’ and ‘maximal segment’ suitable to the system, and gives reduction procedures for them. It is then shown that deductions in the system convert into normal form, i.e. deductions that contain neither maximal formulas nor maximal segments, and that deductions in normal form satisfy the subformula property. Tarski’s Rule is treated as a general introduction rule for implication. The general introduction rule for negation has a similar form. Maximal formulas with implication or negation as main operator require reduction procedures of a more intricate kind not present in normalisation for intuitionist logic.
Zitieren
APA
Kürbis, N. (2022). Normalisation and subformula property for a system of classical logic with Tarski’s rule. Archive for Mathematical Logic, 61(1-2), 105-129. https://doi.org/10.1007/s00153-021-00775-6
Vancouver
Kürbis N. Normalisation and subformula property for a system of classical logic with Tarski’s rule. Archive for Mathematical Logic. 2022;61(1-2):105-129. doi:10.1007/s00153-021-00775-6
BibTeX
@article{Krbis2022,
author = {Kürbis, Nils},
title = {Normalisation and subformula property for a system of classical logic with Tarski’s rule},
journal = {Archive for Mathematical Logic},
year = {2022},
volume = {61},
number = {1-2},
pages = {105--129},
doi = {10.1007/s00153-021-00775-6}
}
EUVIMED