Skip to main content
SpringerLink
Log in

TAFA – A Tool for Admissibility in Finite Algebras

  • Conference paper
Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX 2013)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 8123))

  • 463 Accesses

Abstract

Checking whether a quasiequation is admissible in a finitely generated quasivariety is known to be decidable by checking validity in a suitable (finite) free algebra on finitely many generators. Nevertheless this approach is computationally unfeasible since these free algebras can be very big. TAFA is a system providing algebraic tools to search for the smallest set of algebras, according to the standard multiset well-ordering, such that a quasiequation is admissible in the quasivariety if and only if it is valid in this set of algebras.

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 49.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. Baaz, M., Fermüller, C.G., Salzer, G.: Automated deduction for many-valued logics. In: Handbook of Automated Reasoning, ch. 20, vol. II, pp. 1355–1402. Elsevier (2001)

    Google Scholar 

  2. Babenyshev, S., Rybakov, V., Schmidt, R.A., Tishkovsky, D.: A tableau method for checking rule admissibility in S4. In: Proc. M4M 2009. ENTCS, vol. 262, pp. 17–32 (2010)

    Google Scholar 

  3. Birkhoff, G.: On the structure of abstract algebras. Proc. Camb. Philos. Soc. 31, 433–454 (1935)

    Article  Google Scholar 

  4. Burris, S., Sankappanavar, H.P.: A Course in Universal Algebra. Graduate Texts in Mathematics, vol. 78. Springer, New York (1981)

    Book  MATH  Google Scholar 

  5. Cabrer, L.M., Metcalfe, G.: Admissibility via natural dualities. Manuscript

    Google Scholar 

  6. Cintula, P., Metcalfe, G.: Structural completeness in fuzzy logics. Notre Dame J. Form. Log. 50(2), 153–183 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  7. Cintula, P., Metcalfe, G.: Admissible rules in the implication-negation fragment of intuitionistic logic. Ann. Pure Appl. Logic 162(10), 162–171 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  8. Dershowitz, N., Manna, Z.: Proving termination with multiset orderings. Commun. ACM 22, 465–476 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  9. Ghilardi, S.: Unification in intuitionistic logic. J. Symbolic Logic 64(2), 859–880 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  10. Ghilardi, S.: Best solving modal equations. Ann. Pure Appl. Logic 102(3), 184–198 (2000)

    Article  MathSciNet  Google Scholar 

  11. Ghilardi, S.: A resolution/tableaux algorithm for projective approximations in IPC. Log. J. IGPL 10(3), 227–241 (2002)

    Article  MathSciNet  Google Scholar 

  12. Hähnle, R.: Automated Deduction in Multiple-Valued Logics. Oxford Univ. Press (1993)

    Google Scholar 

  13. Iemhoff, R.: On the admissible rules of intuitionistic propositional logic. J. Symbolic Logic 66(1), 281–294 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  14. Iemhoff, R., Metcalfe, G.: Proof theory for admissible rules. Ann. Pure Appl. Logic 159(1-2), 171–186 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  15. Jeřábek, E.: Admissible rules of modal logics. J. Logic Comput. 15, 411–431 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  16. Metcalfe, G.: An Avron rule for fragments of R-mingle. Journal of Logic and Computation (to appear)

    Google Scholar 

  17. Metcalfe, G., Röthlisberger, C.: Admissibility in De Morgan algebras. Soft Comput. 16(11), 1875–1882 (2012)

    Article  MATH  Google Scholar 

  18. Metcalfe, G., Röthlisberger, C.: Admissibility in finitely generated quasivarieties. Logical Methods in Computer Science 9(2:9) (2013)

    Google Scholar 

  19. Rybakov, V.: Admissibility of Logical Inference Rules. Studies in Logic and the Foundations of Mathematics, vol. 136. Elsevier, Amsterdam (1997)

    Book  MATH  Google Scholar 

  20. Sprenger, M.: Algebra Workbench, http://www.algebraworkbench.net

Download references

Author information

Authors and Affiliations

  1. Mathematics Institute, University of Bern, Sidlerstrasse 5, 3012, Bern, Switzerland

    Christoph Röthlisberger

Authors
  1. Christoph Röthlisberger
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. LORIA UMR CNRS 7503, Université de Lorraine, Campus Scientifique, BP 239, 54506, Vandœuvre-lès-Nancy, France

    Didier Galmiche

  2. LORIA – CNRS, UHP Nancy, Campus Scientifique, BP 239, 54 506, Vandœuvre-lès-Nancy, France

    Dominique Larchey-Wendling

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Röthlisberger, C. (2013). TAFA – A Tool for Admissibility in Finite Algebras. In: Galmiche, D., Larchey-Wendling, D. (eds) Automated Reasoning with Analytic Tableaux and Related Methods. TABLEAUX 2013. Lecture Notes in Computer Science(), vol 8123. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40537-2_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-40537-2_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-40536-5

  • Online ISBN: 978-3-642-40537-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation