Skip to main content

Brun Normal Forms for Co-atomic Łukasiewicz Logics

  • Conference paper
Book cover Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU 2005)

Abstract

We construct a class of Łukasiewicz formulae whose associated McNaughton functions constitute a family of Schauder hats having special properties. Our technique is inspired by the well-known algorithm of Brun [3,4,2] for simultaneous diopanthine approximations. As a first application of Brun hats we construct normal forms for co-atomic Łukasiewicz logics. We also show how to combine Brun hats to obtain normal forms for all finite-valued Łukasiewicz logics.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aguzzoli, S., Marra, V.: Finitely presented MV algebras with finite automorphism group (Submitted)

    Google Scholar 

  2. Brentjes, A.J.: Multi–dimensional continued fraction algorithms. Mathematical Centre Tracts 145 (1981)

    Google Scholar 

  3. Brun, V.: En generalisation av kjederbrøken I. Skr. Vidensk. Selsk. Kristiania 6 (1919)

    Google Scholar 

  4. Brun, V.: En generalisation av kjederbrøken II. Skr. Vidensk. Selsk. Kristiania 6 (1920)

    Google Scholar 

  5. Chang, C.C.: Algebraic analysis of many valued logics. Trans. Amer. Math. Soc. 88, 467–490 (1958)

    Article  MATH  MathSciNet  Google Scholar 

  6. Cignoli, R., D’Ottaviano, I.M.L., Mundici, D.: Algebraic Foundations of Many-Valued Reasoning, Trends in Logic, vol. 7. Kluwer, Dordrecht (2000)

    Google Scholar 

  7. Ewald, G.: Combinatorial Convexity and Algebraic Geometry. Graduate Texts in Mathematics, vol. 168. Springer, Berlin (1996)

    MATH  Google Scholar 

  8. Grigolia, R.: An algebraic analysis of Łukasiewicz–Tarski’s n-valued logical systems. In: Wójcicki, R., Malinowski, G. (eds.) Selected Papers on Łukasiewicz Sentential Calculi, Ossolineum, Wrocław, pp. 81–92 (1977)

    Google Scholar 

  9. McNaughton, R.: A theorem about infinite-valued sentential logic. Journal of Symbolic Logic 16, 1–13 (1951)

    Article  MATH  MathSciNet  Google Scholar 

  10. Mundici, D.: A constructive proof of McNaughton’s Theorem in infinite-valued logics. Journal of Symbolic Logic 59, 596–602 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  11. Panti, G.: A geometric proof of the completeness of the Łukasiewicz calculus. Journal of Symbolic Logic 60, 563–578 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  12. Rose, A., Rosser, J.B.: Fragments of many-valued statement calculi. Trans. Amer. Math. Soc. 87, 1–53 (1958)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Aguzzoli, S., D’Antona, O.M., Marra, V. (2005). Brun Normal Forms for Co-atomic Łukasiewicz Logics. In: Godo, L. (eds) Symbolic and Quantitative Approaches to Reasoning with Uncertainty. ECSQARU 2005. Lecture Notes in Computer Science(), vol 3571. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11518655_55

Download citation

  • DOI: https://doi.org/10.1007/11518655_55

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-27326-4

  • Online ISBN: 978-3-540-31888-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics