R. W. Ritchie. A rudimentary definition of addition. The journal of symbolic logic, vol. 30 , pp. 350–354

Journal of Symbolic Logic 35 (3):475 (1970)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2270743

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,897

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Review: R. W. Ritchie, A Rudimentary Definition of Addition. [REVIEW]James H. Bennett - 1970 - Journal of Symbolic Logic 35 (3):475-475.
A rudimentary definition of addition.R. W. Ritchie - 1965 - Journal of Symbolic Logic 30 (3):350-354.
Predictably Computable Functionals and Definition by Recursion.D. L. Kreider & R. W. Ritchie - 1968 - Journal of Symbolic Logic 33 (2):298-299.
Review: D. L. Kreider, R. W. Ritchie, Predictably Computable Functionals and Definition by Recursion. [REVIEW]Paul Axt - 1968 - Journal of Symbolic Logic 33 (2):298-299.
Rudimentary Languages and Second‐Order Logic.Malika More & Frédéric Olive - 1997 - Mathematical Logic Quarterly 43 (3):419-426.
Ritchie A. D.. A defence of Aristotle's logic. Mind, n.s. vol. 55 , pp. 256–262.Alonzo Church - 1946 - Journal of Symbolic Logic 11 (4):134-134.
Classes of Predictably Computable Functions.Robert W. Ritchie - 1963 - Journal of Symbolic Logic 28 (3):252-253.
Alfred B. Manaster. Rich co-ordinals, addition isomorphisms, and RETs. The journal of symbolic logic, vol. 34 , pp. 45–52.John N. Crossley - 1971 - Journal of Symbolic Logic 36 (2):342.
Review: Robert W. Ritchie, Classes of Predictably Computable Functions. [REVIEW]C. C. Elgot - 1963 - Journal of Symbolic Logic 28 (3):252-253.
Classes of Recursive Functions based on Ackermann's Function.Robert W. Ritchie - 1966 - Journal of Symbolic Logic 31 (4):654-654.
Review: Katsumi Nakamura, On a Mode of Definition in Geometry--On Implicit Definition. [REVIEW]Shizuo Kakutani - 1941 - Journal of Symbolic Logic 6 (2):65-65.
Ritchie Robert W.. Classes of predictably computable functions. Transactions of the American Mathematical Society, vol. 106 , pp. 139–173. [REVIEW]C. C. Elgot - 1963 - Journal of Symbolic Logic 28 (3):252-253.
Robert W. Ritchie. Classes of recursive functions based on Ackermann's function. Pacific journal of mathematics, vol. 15 , pp. 1027–1044. [REVIEW]Paul Axt - 1966 - Journal of Symbolic Logic 31 (4):654-654.
The Design of Switching Circuits.William Keister, Alistair E. Ritchie, Seth H. Washburn & John Meszar - 1953 - Journal of Symbolic Logic 18 (4):347-348.
Predictably computable functionals and definition by recursion.D. L. Kreider & R. W. Ritchie - 1964 - Mathematical Logic Quarterly 10 (5):65-80.

Analytics

Added to PP
2016-06-30

Downloads
18 (#832,892)

6 months
2 (#1,198,857)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references