Staff View
Minimal logic and computers, chapter IV: theory of numbers in the system R

## Descriptive

Language
LanguageTerm (authority = ISO 639-3:2007); (type = text)
English
Genre (authority = RULIB-FS)
Other
Genre (authority = marcgt)
technical report
PhysicalDescription
InternetMediaType
application/pdf
Extent
1 online resource (81 pages)
Note (type = special display note)
Technical report DCS-TR-22
Name (authority = RutgersOrg-School); (type = corporate)
NamePart
School of Arts and Sciences (SAS) (New Brunswick)
Name (authority = RutgersOrg-Department); (type = corporate)
NamePart
Computer Science (New Brunswick)
TypeOfResource
Text
TitleInfo
Title
Minimal logic and computers, chapter IV: theory of numbers in the system R
Abstract (type = abstract)
Chapter IV contains a discussion of the general properties of the system R. In this chapter, the general properties of the system will be used for a detailed development of the theory of numbers in the system R.

Section 41 contains a detailed discussion of natural numbers and functions of natural numbers. The discussion begins by introducing the concept of an R-formula I-representing a natural number. Speaking informally, this is saying that certain R-formulas serve as names for natural numbers. This definition, together with the primitive rules for W are used to develop, in detail, the properties of addition,multiplication, exponentiation and proper subtraction in the system R.

Sections 42 and 43 are devoted to developing more general ways of dealing with functions of natural numbers in the system R. The basic idea is to introduce certain classes of functions of natural numbers and show that each function has an I-representation in system R. The particular classes of functions which are considered the primitive recursive functions and the partial recursive functions. Section 44 contains a discussion of general methods which can be used to show that relations among natural numbers have I-representations in the system R. There is also a discussion of limitations on relations which can be represented in the system R. In section 45, the theory of natural numbers in the system R is used to continue the development of the theory of combinators which was begun in section 31. Using natural numbers, it is possible to prove many additional properties of combinators as well as to define combinators which have interesting and useful properties. Finally, in section 46, the concept of an ordinal number is introduced. Then it is shown that a substantial fragment of several versions of the theory of ordinal numbers can be developed within the system R.

In summary, the objective of this chapter is to develop the theory of natural numbers and ordinal numbers in the system R.
Name (type = personal)
NamePart (type = family)
Fitch
NamePart (type = given)
Frederic B.
Affiliation
Yale University
Role
RoleTerm (authority = marcrt); (type = text)
author
Name (type = personal)
NamePart (type = family)
Orgass
NamePart (type = given)
Richard J.
Affiliation
Computer Science (New Brunswick)
Role
RoleTerm (authority = marcrt); (type = text)
author
OriginInfo
DateCreated (encoding = w3cdtf); (keyDate = yes); (qualifier = exact)
1972
TitleInfo (type = alternative)
Title
Theory of numbers in the system R
Genre (authority = RULIB-FS)
Book Chapter
RelatedItem (type = host)
TitleInfo
Title
Computer Science (New Brunswick)
Identifier (type = local)
rucore21032500001
Location
PhysicalLocation (authority = marcorg); (displayLabel = Rutgers, The State University of New Jersey)
NjNbRU
Identifier (type = doi)
doi:10.7282/t3-3hfh-vr52
Genre (authority = ExL-Esploro)
Technical Documentation
Back to the top

## Rights

RightsDeclaration (AUTHORITY = rightsstatements.org); (TYPE = IN COPYRIGHT); (ID = http://rightsstatements.org/vocab/InC/1.0/)
This Item is protected by copyright and/or related rights.You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use.For other uses you need to obtain permission from the rights-holder(s).
Status
Availability
Status
Open
Reason