Strong standard completeness theorems for S5-modal Lukasiewicz logics
Abstract: We study the S5-modal expansion of the logic based on the Lukasiewicz t-norm. We exhibit a finitary propositional calculus and show that it is finitely strongly complete with respect to this logic. This propositional calculus is then expanded with an infinitary rule to achieve strong completeness. These results are derived from properties of monadic MValgebras: functional representations of simple and finitely subdirectly irreducible algebras, as well as the finite embeddability property. We also show similar completeness theorems for the extension of the logic based on models with bounded universe.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.