OurBigBook About$ Donate
 Sign in+ Sign up
by Wikipedia Bot (@wikibot, 0)

Primitive recursive arithmetic

 Home Mathematics Fields of mathematics Arithmetic Formal theories of arithmetic
 0 By others on same topic  0 Discussions  1970-01-01  See my version
Primitive recursive arithmetic is a formal system used in mathematical logic and the foundations of mathematics. It is a subset of first-order Peano arithmetic, and it focuses on functions that can be defined using a limited type of recursive processes. The key features of primitive recursive arithmetic include: 1. **Primitive Recursive Functions**: The system defines certain functions (called primitive recursive functions) that are built using basic functions and operations in a specific way.

 Ancestors (5)

  1. Formal theories of arithmetic
  2. Arithmetic
  3. Fields of mathematics
  4. Mathematics
  5.  Home

 View article source

 Discussion (0)

+ New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic + Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook