- 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
A standardization theorem for strong reduction
Notre Dame Journal of Formal Logic 9 (3):271-283 (1968)
Abstract
This article has no associated abstract. (fix it)Other Versions
No versions found
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
The Church Rosser theorem for strong reduction in combinatory logic.Kenneth Loewen - 1968 - Notre Dame Journal of Formal Logic 9 (4):299-302.
A strong completeness theorem for $3$-valued logic. [REVIEW]H. Goldberg, H. Leblanc & G. Weaver - 1974 - Notre Dame Journal of Formal Logic 15 (2):325-330.
Modified strong reduction in combinatory logic.Kenneth Loewen - 1968 - Notre Dame Journal of Formal Logic 9 (3):265-270.
A strong completeness theorem for 3-valued logic. Part II.Hugues Leblanc - 1977 - Notre Dame Journal of Formal Logic 18:107.
A completeness theorem for dynamic logic.László Csirmaz - 1985 - Notre Dame Journal of Formal Logic 26 (1):51-60.
An incompleteness theorem for conditional logic.Donald Nute - 1978 - Notre Dame Journal of Formal Logic 19 (4):634-636.
The ontological theorem.Charles D. Brown - 1978 - Notre Dame Journal of Formal Logic 19 (4):591-592.
Extensions of Gödel's completeness theorem and the Löwenheim-Skolem theorem.Stephen L. Bloom - 1973 - Notre Dame Journal of Formal Logic 14 (3):408-410.
On an extension of a theorem of Friedberg.Thomas G. McLaughlin - 1962 - Notre Dame Journal of Formal Logic 3 (4):270-273.
Analytics
Added to PP
2010-08-24
Downloads
18 (#1,119,623)
6 months
7 (#728,225)
2010-08-24
Downloads
18 (#1,119,623)
6 months
7 (#728,225)
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-667477cd97-lxkd2 dc2