The Unification Type of Łukasiewicz Logic with a Bounded Number of Variables

Journal of Symbolic Logic:1-18 (forthcoming)
  Copy   BIBTEX

Abstract

Building on the correspondence between finitely axiomatised theories in Łukasiewicz logic and rational polyhedra, we prove that the unification type of the fragment of Łukasiewicz logic with $n\geqslant 2$ variables is nullary. This solves a problem left open by V. Marra and L. Spada [Ann. Pure Appl. Logic 164 (2013), pp. 192–210]. Furthermore, we refine the study of unification with bounds on the number of variables. Our proposal distinguishes the number m of variables allowed in the problem and the number n in the solution. We prove that the unification type of Łukasiewicz logic for all $m,n \geqslant 2$ is nullary.

Other Versions

No versions found

Links

PhilArchive

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

KD is nullary.Philippe Balbiani & Çiğdem Gencer - 2017 - Journal of Applied Non-Classical Logics 27 (3-4):196-205.
Finite axiomatizability in Łukasiewicz logic.Daniele Mundici - 2011 - Annals of Pure and Applied Logic 162 (12):1035-1047.
On normal forms in Łukasiewicz logic.A. Di Nola & A. Lettieri - 2004 - Archive for Mathematical Logic 43 (6):795-823.
Tense Polyadic N × M-Valued Łukasiewicz–Moisil Algebras.Aldo V. Figallo & Gustavo Pelaitay - 2015 - Bulletin of the Section of Logic 44 (3/4):155-181.

Analytics

Added to PP
2025-10-10

Downloads
17 (#1,901,523)

6 months
9 (#1,252,818)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references