Skip to main content
SpringerLink
Log in

Tableaux for Lattices

  • Conference paper
Algebraic Methodology and Software Technology (AMAST 2006)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 4019))

  • 407 Accesses

Abstract

We formally derive tableau calculi for various lattices. They solve the word problem for the free algebra in the respective class. They are developed in and integrated into the ordered resolution theorem proving framework as special-purpose procedures. Theory-specific and procedural information is included by rewriting techniques and by imposing the subformula property on the ordering constraints. Intended applications include modal logic and the automated proof support for set-based formal methods. Our algebraic study also contributes to the foundations of tableau and sequent calculi, explaining the connection of distributivity with the data-structure of sequents and with cut-elimination.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Birkhoff, G.: Lattice Theory. Colloquium Publications, vol. 25. American Mathematical Society (reprint, 1984)

    Google Scholar 

  2. Delor, C., Puel, L.: Extension of the associative path ordering to a chain of associative-commutative symbols. In: Kirchner, C. (ed.) RTA 1993. LNCS, vol. 690, pp. 389–404. Springer, Heidelberg (1993)

    Google Scholar 

  3. Fitting, M.: First-Order Logic and Automated Theorem Proving, 2nd edn. Springer, Heidelberg (1996)

    MATH  Google Scholar 

  4. Font, J.M., Verdú, V.: Algebraic logic for classical conjunction and disjunction. Studia Logica 50, 391–419 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  5. Freese, R., Ježek, J., Nation, J.B.: Free Lattices. Surveys and Monographs, vol. 42. American Mathematical Society (1995)

    Google Scholar 

  6. Gentzen, G.: Untersuchungen über das logische Schließen. Mathematische Zeitschrift 39, 176–210, 405–431 (1935)

    Article  MathSciNet  Google Scholar 

  7. Lorenzen, P.: Algebraische und logistische Untersuchungen über freie Verbände. The Journal of Symbolic Logic 16(2), 81–106 (1951)

    Article  MATH  MathSciNet  Google Scholar 

  8. Negri, S., von Plato, J.: Proof systems for lattice theory. Mathematical Structures in Computer Science 14(4), 507–526 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  9. Rusinowitch, M.: Démonstration Automatique: Techniques de Réecriture. Science Informatique. InterEditions, Paris (1989)

    Google Scholar 

  10. Schwichtenberg, H.: Proof theory: Some applications of cut-elimination. In: Barwise, J. (ed.) Handbook of Mathematical Logic, pp. 867–895. North-Holland, Amsterdam (1977)

    Chapter  Google Scholar 

  11. Struth, G.: An algebra of resolution. In: Bachmair, L. (ed.) RTA 2000. LNCS, vol. 1833, pp. 214–228. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  12. Struth, G.: Deriving focused calculi for transitive relations. In: Middeldorp, A. (ed.) RTA 2001. LNCS, vol. 2051, pp. 291–305. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  13. Struth, G.: Deriving focused lattice calculi. In: Tison, S. (ed.) RTA 2002. LNCS, vol. 2378, pp. 83–97. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  14. Struth, G.: A calculus for set-based program development. In: Dong, J.S., Woodcock, J. (eds.) ICFEM 2003. LNCS, vol. 2885, pp. 541–559. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  15. Struth, G.: Automated element-wise reasoning with sets. In: Cuellar, J.R., Liu, Z. (eds.) 2nd International Conference on Software Engineering and Formal Methods, pp. 320–329. IEEE Computer Society Press, Los Alamitos (2004)

    Chapter  Google Scholar 

  16. Whitman, Ph.M.: Free lattices. Ann. of Math. 42(2), 325–330 (1941)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, The University of Sheffield, Regent Court, 211 Portobello Street, Sheffield, S1 4DP, UK

    Georg Struth

Authors
  1. Georg Struth
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Macquarie University,  

    Michael Johnson

  2. Dept. of Computer Science, Univ. of Tartu, J. Liivi 2, P.O. Box, EE-50409, Tartu, Estonia

    Varmo Vene

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Struth, G. (2006). Tableaux for Lattices. In: Johnson, M., Vene, V. (eds) Algebraic Methodology and Software Technology. AMAST 2006. Lecture Notes in Computer Science, vol 4019. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11784180_25

Download citation

  • DOI: https://doi.org/10.1007/11784180_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-35633-2

  • Online ISBN: 978-3-540-35636-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation