Skip to main content
SpringerLink
Log in

Mathematical Reasoning, Proof Principles, and Logic

  • Chapter
  • First Online:
Discrete Mathematics

Part of the book series: Universitext ((UTX))

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 59.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 79.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. Peter B. Andrews. An Introduction to Mathematical Logic and Type Theory: To truth Through Proof. New York: Academic Press, 1986.

    MATH  Google Scholar 

  2. H.B. Curry and R. Feys. Combinatory Logic, Vol. I. Studies in Logic. Amsterdam: North- Holland, third edition, 1974.

    Google Scholar 

  3. Herbert B. Enderton. Elements of Set Theory. New York: Academic Press, first edition, 1977.

    MATH  Google Scholar 

  4. Jean H. Gallier. Logic for Computer Science. New York: Harper and Row, 1986.

    MATH  Google Scholar 

  5. Jean Gallier. Constructive logics. Part I: A tutorial on proof systems and typed λ-calculi. Theoretical Computer Science, 110(2):249–339, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  6. Jean Gallier. On the Correspondence Between Proofs and λ-Terms. In Philippe de Groote, editor, Cahiers Du Centre de Logique, Vol. 8, pages 55–138. Louvain-La-Neuve: Academia, 1995.

    Google Scholar 

  7. G. Gentzen. Investigations into logical deduction. In M.E. Szabo, editor, The Collected Papers of Gerhard Gentzen. Amsterdam: North-Holland, 1969.

    Google Scholar 

  8. J.-Y. Girard, Y. Lafont, and P. Taylor. Proofs and Types, volume 7 of Cambridge Tracts in Theoretical Computer Science. Cambridge, UK: Cambridge University Press, 1989.

    Google Scholar 

  9. Jean-Yves Girard. Linear logic. Theoretical Computer Science, 50:1–102, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  10. Timothy Gowers. Mathematics: A Very Short Introduction. Oxford, UK: Oxford University Press, first edition, 2002.

    Google Scholar 

  11. Paul R. Halmos. Naive Set Theory. Undergraduate Text in Mathematics. New York: Springer Verlag, first edition, 1974.

    MATH  Google Scholar 

  12. John E. Hopcroft, Rajeev Motwani, and Jeffrey D. Ullman. Introduction to Automata, Languages and Computation. Reading, MA: Addison Wesley, third edition, 2006.

    Google Scholar 

  13. W. A. Howard. The formulae-as-types notion of construction. In J. P. Seldin and J. R. Hindley, editors, To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pages 479–490. London: Academic Press, 1980. Reprint of manuscript first published in 1969.

    Google Scholar 

  14. Michael Huth and Mark Ryan. Logic in Computer Science. Modelling and reasonning about systems. Cambridge, UK: Cambridge University Press, 2000.

    Google Scholar 

  15. S. Kleene. Introduction to Metamathematics. Amsterdam: North-Holland, seventh edition, 1952.

    MATH  Google Scholar 

  16. Harry Lewis and Christos H. Papadimitriou. Elements of the Theory of Computation. Englewood Cliffs, NJ: Prentice-Hall, second edition, 1997.

    Google Scholar 

  17. D. Prawitz. Natural Deduction, A Proof-Theoretical Study. Stockholm: Almquist & Wiksell, 1965.

    MATH  Google Scholar 

  18. D. Prawitz. Ideas and results in proof theory. In J.E. Fenstad, editor, Proc. 2nd Scand. Log. Symp., pages 235–307. New York: North-Holland, 1971.

    Google Scholar 

  19. R. Statman. Intuitionistic propositional logic is polynomial-space complete. Theoretical Computer Science, 9(1):67–72, 1979.

    Article  MATH  MathSciNet  Google Scholar 

  20. Patrick Suppes. Axiomatic Set Theory. New York: Dover, first edition, 1972.

    MATH  Google Scholar 

  21. G. Takeuti. Proof Theory, volume 81 of Studies in Logic. Amsterdam: North-Holland, 1975.

    Google Scholar 

  22. A.S. Troelstra and H. Schwichtenberg. Basic Proof Theory, volume 43 of Cambridge Tracts in Theoretical Computer Science. Cambridge, UK: Cambridge University Press, 1996.

    Google Scholar 

  23. D. van Dalen. Logic and Structure. New York: Universitext. Springer Verlag, second edition, 1980.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer and Information Science, University of Pennsylvania, 3330 Walnut Street, 19104, Philadelphia, PA, USA

    Jean Gallier

Authors
  1. Jean Gallier
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jean Gallier .

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Gallier, J. (2011). Mathematical Reasoning, Proof Principles, and Logic. In: Discrete Mathematics. Universitext. Springer, New York, NY. https://doi.org/10.1007/978-1-4419-8047-2_1

Download citation

Publish with us

Policies and ethics

Search

Navigation