- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
The Church Rosser theorem for strong reduction in combinatory logic
Notre Dame Journal of Formal Logic 9 (4):299-302 (1968)
Abstract
This article has no associated abstract. (fix it)Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
A Simplified Proof of the Church–Rosser Theorem.Yuichi Komori, Naosuke Matsuda & Fumika Yamakawa - 2014 - Studia Logica 102 (1):175-183.
Remarks on the church-Rosser property.E. G. K. López-Escobar - 1990 - Journal of Symbolic Logic 55 (1):106-112.
The church-Rosser property in dual combinatory logic.Katalin Bimbó - 2003 - Journal of Symbolic Logic 68 (1):132-152.
Modified strong reduction in combinatory logic.Kenneth Loewen - 1968 - Notre Dame Journal of Formal Logic 9 (3):265-270.
Arithmetic based on the church numerals in illative combinatory logic.M. W. Bunder - 1988 - Studia Logica 47 (2):129 - 143.
The Church-Rosser Property in Symmetric Combinatory Logic.Katalin Bimbó - 2005 - Journal of Symbolic Logic 70 (2):536 - 556.
A standardization theorem for strong reduction.Kenneth Loewen - 1968 - Notre Dame Journal of Formal Logic 9 (3):271-283.
On the proof of Solovay's theorem.Dick Jongh, Marc Jumelet & Franco Montagna - 1991 - Studia Logica 50 (1):51 - 69.
Axioms for strong reduction in combinatory logic.Roger Hindley - 1967 - Journal of Symbolic Logic 32 (2):224-236.
An abstract church-Rosser theorem. II: Applications.R. Hindley - 1974 - Journal of Symbolic Logic 39 (1):1-21.
Strong reduction and normal form in combinatory logic.Bruce Lercher - 1967 - Journal of Symbolic Logic 32 (2):213-223.
Church-Rosser theorem for typed functional systems.George Koletsos - 1985 - Journal of Symbolic Logic 50 (3):782-790.
Analytics
Added to PP
2010-08-24
Downloads
11 (#1,129,170)
6 months
9 (#299,238)
2010-08-24
Downloads
11 (#1,129,170)
6 months
9 (#299,238)
Historical graph of downloads
Citations of this work
A solution to Curry and Hindley’s problem on combinatory strong reduction.Pierluigi Minari - 2009 - Archive for Mathematical Logic 48 (2):159-184.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-659b74868d-w5f9g uwo