Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

On the Rosser–Turquette method of constructing axiom systems for finitely many-valued propositional logics of Łukasiewicz

On the Rosser–Turquette method of constructing axiom systems for finitely many-valued... AbstractA method of constructing Hilbert-type axiom systems for standard many-valued propositional logics was offered by Rosser and Turquette. Although this method is considered to be a solution of the problem of axiomatisability of a wide class of many-valued logics, the article demonstrates that it fails to produce adequate axiom systems. The article concerns finitely many-valued propositional logics of Łukasiewicz. It proves that if standard propositional connectives of the Rosser–Turquette axiom systems are definable in terms of the propositional connectives of Łukasiewicz’s logics, and thus, they are normal ones, then every Rosser–Turquette axiom system for a finite-valued Łukasiewicz’s logic is semantically incomplete. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Journal of Applied Non-Classical Logics Taylor & Francis

On the Rosser–Turquette method of constructing axiom systems for finitely many-valued propositional logics of Łukasiewicz

Journal of Applied Non-Classical Logics , Volume 27 (1-2): 6 – Apr 3, 2017

On the Rosser–Turquette method of constructing axiom systems for finitely many-valued propositional logics of Łukasiewicz

Journal of Applied Non-Classical Logics , Volume 27 (1-2): 6 – Apr 3, 2017

Abstract

AbstractA method of constructing Hilbert-type axiom systems for standard many-valued propositional logics was offered by Rosser and Turquette. Although this method is considered to be a solution of the problem of axiomatisability of a wide class of many-valued logics, the article demonstrates that it fails to produce adequate axiom systems. The article concerns finitely many-valued propositional logics of Łukasiewicz. It proves that if standard propositional connectives of the Rosser–Turquette axiom systems are definable in terms of the propositional connectives of Łukasiewicz’s logics, and thus, they are normal ones, then every Rosser–Turquette axiom system for a finite-valued Łukasiewicz’s logic is semantically incomplete.

Loading next page...
 
/lp/taylor-francis/on-the-rosser-turquette-method-of-constructing-axiom-systems-for-7vaTd0gcaN

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Taylor & Francis
Copyright
© 2017 Informa UK Limited, trading as Taylor & Francis Group
ISSN
1958-5780
eISSN
1166-3081
DOI
10.1080/11663081.2017.1311147
Publisher site
See Article on Publisher Site

Abstract

AbstractA method of constructing Hilbert-type axiom systems for standard many-valued propositional logics was offered by Rosser and Turquette. Although this method is considered to be a solution of the problem of axiomatisability of a wide class of many-valued logics, the article demonstrates that it fails to produce adequate axiom systems. The article concerns finitely many-valued propositional logics of Łukasiewicz. It proves that if standard propositional connectives of the Rosser–Turquette axiom systems are definable in terms of the propositional connectives of Łukasiewicz’s logics, and thus, they are normal ones, then every Rosser–Turquette axiom system for a finite-valued Łukasiewicz’s logic is semantically incomplete.

Journal

Journal of Applied Non-Classical LogicsTaylor & Francis

Published: Apr 3, 2017

Keywords: Axiom systems; Łukasiewicz’s many-valued logics; semantic incompleteness; standard conditions; Rosser–Turquette method

References