David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
Journal of Symbolic Logic 55 (1):106-112 (1990)
A reduction algebra is defined as a set with a collection of partial unary functions (called reduction operators). Motivated by the lambda calculus, the Church-Rosser property is defined for a reduction algebra and a characterization is given for those reduction algebras satisfying CRP and having a measure respecting the reductions. The characterization is used to give (with 20/20 hindsight) a more direct proof of the strong normalization theorem for the impredicative second order intuitionistic propositional calculus
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library|
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
M. W. Bunder (1988). Arithmetic Based on the Church Numerals in Illative Combinatory Logic. Studia Logica 47 (2):129 - 143.
Pierluigi Minari (1999). Theories of Types and Names with Positive Stratified Comprehension. Studia Logica 62 (2):215-242.
Katalin Bimbó (2005). The Church-Rosser Property in Symmetric Combinatory Logic. Journal of Symbolic Logic 70 (2):536 - 556.
Katalin Bimb� (2003). The Church-Rosser Property in Dual Combinatory Logic. Journal of Symbolic Logic 68 (1):132 - 152.
C. Barry Jay (1991). Coherence in Category Theory and the Church-Rosser Property. Notre Dame Journal of Formal Logic 33 (1):140-143.
Katalin Bimbó (2003). The Church-Rosser Property in Dual Combinatory Logic. Journal of Symbolic Logic 68 (1):132-152.
Garrel Pottinger (1981). The Church-Rosser Theorem for the Typed $\Lambda$-Calculus with Surjective Pairing. Notre Dame Journal of Formal Logic 22 (3):264-268.
Garrel Pottinger (1978). Proofs of the Normalization and Church-Rosser Theorems for the Typed $\Lambda$-Calculus. Notre Dame Journal of Formal Logic 19 (3):445-451.
Kenneth Loewen (1968). The Church Rosser Theorem for Strong Reduction in Combinatory Logic. Notre Dame Journal of Formal Logic 9 (4):299-302.
Katalin Bombó (2005). The Church-Rosser Property in Symmetric Combinatory Logic. Journal of Symbolic Logic 70 (2):536 - 556.
Added to index2009-01-28
Total downloads7 ( #188,579 of 1,102,993 )
Recent downloads (6 months)1 ( #297,567 of 1,102,993 )
How can I increase my downloads?