Jump to ContentJump to Main Navigation
Reductive Logic and Proof-search$
Users without a subscription are not able to see the full content.
Reductive Logic and Proof-search: Proof Theory, Semantics, and Control

David J. Pym and Eike Ritter

Print publication date: 2004

Print ISBN-13: 9780198526339

Published to Oxford Scholarship Online: September 2007

DOI: 10.1093/acprof:oso/9780198526339.001.0001

LAMBDA-CALCULI FOR INTUITIONISTIC AND CLASSICAL PROOFS

Chapter:
(p. 27 ) 2 LAMBDA-CALCULI FOR INTUITIONISTIC AND CLASSICAL PROOFS
Source:
Reductive Logic and Proof-search
Author(s):

David J. Pym

Eike Ritter

Publisher:
Oxford University Press
DOI:10.1093/acprof:oso/9780198526339.003.0002

This chapter provides an explanation of natural deduction proof systems and their corresponding lambda-calculi. Beginning with the necessary basics of natural deduction systems for intuitionistic logic and the simply-typed lambda-calculus, the lambda-mu-calculus is then presented, giving both the basic definitions and essential meta-theory, before proceeding with a discussion of the addition of disjunction to lambda-mu.

Keywords:   natural deduction proof systems, lambda-calculi, intuitionistic logic, simply-typed lambda-calculus, lambda-mu-calculus

Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .