Skip to main content
SpringerLink
Log in

What Do We Know When We Know That a Theory Is Consistent?

  • Conference paper
Automated Deduction – CADE-20 (CADE 2005)

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

Included in the following conference series:

  • 490 Accesses

Abstract

Given a first-order theory and a proof that it is consistent, can we design a proof-search method for this theory that fails in finite time when it attempts to prove the formula ⊥?

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. Andrews, P.B.: Resolution in type theory. The Journal of Symbolic Logic 36, 414–432 (1971)

    Article  MATH  MathSciNet  Google Scholar 

  2. Dowek, G.: Axioms vs. rewrite rules: from completeness to cut elimination. In: Kirchner, H., Ringeissen, C. (eds.) FroCos 2000. LNCS, vol. 1794, pp. 62–72. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  3. Dowek, G.: What is a theory? In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol. 2285, pp. 50–64. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  4. Dowek, G., Hardin, T., Kirchner, C.: HOL-lambda-sigma: an intentional first-order expression of higher-order logic. Mathematical Structures in Computer Science 11, 1–25 (2001)

    Article  MathSciNet  Google Scholar 

  5. Dowek, G., Hardin, T., Kirchner, C.: Theorem proving modulo. Journal of Automated Reasoning 31, 33–72 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  6. Dowek, G., Werner, B.: Proof normalization modulo. The Journal of Symbolic Logic 68(4), 1289–1316 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  7. Hermant, O.: Déduction Modulo et Élimination des Coupures : Une approche syntaxique. In: Mémoire de DEA (2002)

    Google Scholar 

  8. Huet, G.: Constrained Resolution A Complete Method for Higher Order Logic, Ph.D Thesis, Case Western Reserve University (1972)

    Google Scholar 

  9. Huet, G.: A Mechanisation of Type Theory. In: Third International Joint Conference on Artificial Inteligenge, pp. 139–146 (1973)

    Google Scholar 

  10. Knuth, D.E., Bendix, P.B.: Simple word problems in universal algebras. In: Leech, J. (ed.) Computational Problems in Abstract Algebra, pp. 263–297. Pergamon Press, Oxford (1970)

    Google Scholar 

  11. Negri, S., Von Plato, J.: Cut elimination in the presence of axioms. The Bulletin of Symbolic Logic 4(4), 418–435 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  12. Peterson, G., Stickel, M.E.: Complete Sets of Reductions for Some Equational Theories. Journal of the ACM 28, 233–264 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  13. Plotkin, G.: Building-in equational theories. Machine Intelligence 7, 73–90 (1972)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. École polytechnique and INRIA, LIX, École polytechnique, 91128, Palaiseau Cedex, France

    Gilles Dowek

Authors
  1. Gilles Dowek
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Technical University of Catalonia, Barcelona

    Robert Nieuwenhuis

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dowek, G. (2005). What Do We Know When We Know That a Theory Is Consistent?. In: Nieuwenhuis, R. (eds) Automated Deduction – CADE-20. CADE 2005. Lecture Notes in Computer Science(), vol 3632. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11532231_1

Download citation

  • DOI: https://doi.org/10.1007/11532231_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28005-7

  • Online ISBN: 978-3-540-31864-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation