arXiv Analytics

Sign in

arXiv:2308.01623 [math.LO]AbstractReferencesReviewsResources

Another proof for completeness of Ɓukasiewicz logic

Doratossadat Dastgheib, Hadi Farahani

Published 2023-08-03Version 1

In this paper, we give a new proof for the completeness of infinite valued propositional \L ukasiewicz logic introduced by \L ukasiewicz and Tarski in 1930. Our approach employs a Hilbert-style proof that relies on the concept of maximal consistent extensions, and unlike classical logic, in this context, the maximal extensions are not required to include all formulas or their negations. To illustrate this point, we provide examples of such formulas.

Related articles: Most relevant | Search more
arXiv:1404.1586 [math.LO] (Published 2014-04-06)
Weak and local versions of measurability
arXiv:2210.09630 [math.LO] (Published 2022-10-18)
Completeness of Tableau Calculi for Two-Dimensional Hybrid Logics
arXiv:1512.00091 [math.LO] (Published 2015-11-30)
Implicational Propositional Calculus: Tableaux and Completeness