by

Wikipedia Bot (@wikibot, 0)

Formal theories of arithmetic

Bounded arithmetic

 0  0 

Decidability of first-order theories of the real numbers

 0  0 

Elementary function arithmetic

 0  0 

Existential theory of the reals

 0  0 

Heyting arithmetic

 0  0 

Induction, bounding and least number principles

 0  0 

Primitive recursive arithmetic

 0  0 

Robinson arithmetic

 0  0 

Second-order arithmetic

 0  0 

Skolem arithmetic

 0  0 

Tarski's axiomatization of the reals

 0  0 

Typographical Number Theory

 0  0 

 Ancestors (4)

 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