Category:Formal theories of arithmetic

From HandWiki

Jump to: navigation, search

Computing portal

Here is a list of articles in the category Formal theories of arithmetic of the Computing portal that unifies foundations of mathematics and computations using computers. These systems provide a logical framework and a set of axioms for the formal study of arithmetic in the context of mathematical logic.

Pages in category "Formal theories of arithmetic"

The following 16 pages are in this category, out of 16 total.

B

Bounded arithmetic (computing)
Büchi arithmetic (computing)

D

Decidability of first-order theories of the real numbers (computing)

E

Elementary function arithmetic (computing)
Existential theory of the reals (computing)

H

Heyting arithmetic (computing)

N

Non-standard model of arithmetic (computing)

P

Peano axioms (computing)
Presburger arithmetic (computing)
Primitive recursive arithmetic (computing)

R

Robinson arithmetic (computing)

S

Second-order arithmetic (computing)
Skolem arithmetic (computing)

T

Tarski's axiomatization of the reals (computing)
True arithmetic (computing)
Typographical Number Theory (computing)

Retrieved from "https://handwiki.org/wiki/index.php?title=Category:Formal_theories_of_arithmetic&oldid=3104847"