Abstract
In this work we investigate bounded Lukasiewicz logics}, characterised as the intersection of the k-valued Lukasiewicz logics for k = 2, ..., n (n ≥ 2). These logics formalise a generalisation of Ulam’s game with applications in Information Theory. Here we provide an analytic proof calculus GŁ B n for each bounded Lukasiewicz logic, obtained by adding a single rule to GŁ, a hypersequent calculus for Lukasiewicz infinite-valued logic. We give a first cut-elimination proof for GL with (suitable forms of) cut rules. We then prove completeness for GŁ B n with cut and show that cut can also be eliminated in this case.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
