Live briefing
Everything about Elementary function arithmetic
System of arithmetic in proof theory
In proof theory, a branch of mathematical logic, elementary function arithmetic (EFA), also called elementary arithmetic and exponential function arithmetic, is the system of arithmetic with the usual elementary properties of 0, 1, +, ×, , together with induction for formulas with bounded quantifiers. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Elementary function arithmeticA 5-minute orientation
- Skim a recent paper: Arithmetic optimization algorithm based on elementary function disturbance for solving economic load dispatch problem in power systemInfluential work since 2022
- Pick up a classic book: Hands-On Geometry (Kindergarten Through Grade Nine) (Kindergarten Through Grade Nine)The most-reprinted book on the subject
- Read the landmark paper: Superpositions of elementary arithmetic functionsCited 10 times
- Go sideways: Reverse mathematicsA closely related topic
- Go sideways: Second-order arithmeticA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Superpositions of elementary arithmetic functions
Attitudes toward Problem Solving as a Function of Success in Arithmetic in Brazilian Elementary Schools
3265. Some inequalities involving elementary symmetric function and arithmetic and geometric means
Computation of elementary functions in bit-logarithmic arithmetic
🆕 Influential since 2022
📚 Books worth reading
Hands-On Geometry (Kindergarten Through Grade Nine) (Kindergarten Through Grade Nine)Linda-Sue Brisby · 1989- 📕Bey bey toġan-u uqaġan-du ulus-iyar juġacaġsanLi Jiy Siuwai · 1984
- 📕A course in analytic number theoryMarius Overholt · 2014
Analytic number theoryJ. M. de Koninck · 2012- 📕Ramanujan 125Krishnaswami Alladi, Frank Garvan · 2014
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Reverse mathematics Reverse mathematics is a program in mathematical logic that seeks to determine which axioms are required to prove theorems of mathematics. Its defining…
- Second-order arithmetic In mathematical logic, second-order arithmetic is a collection of axiomatic systems that formalize the natural numbers and their subsets. It is an alternative…
- Robinson arithmetic In mathematics, Robinson arithmetic is a finitely axiomatized fragment of first-order Peano arithmetic (PA), first set out by Raphael M. Robinson in 1950…
- Constructive set theory Axiomatic constructive set theory is an approach to mathematical constructivism following the program of axiomatic set theory. The same first-order language…
- List of mathematical logic topics This is a list of mathematical logic topics. For traditional syllogistic logic, see the list of topics in logic. See also the list of computability and…
- Conservative extension In mathematical logic, a conservative extension is a supertheory of a theory which is often convenient for proving theorems, but proves no new theorems…
- Primitive recursive arithmetic Primitive recursive arithmetic (PRA) is a quantifier-free formalization of the natural numbers. It was first proposed by Norwegian mathematician Skolem…
- Peano axioms In mathematical logic, the Peano axioms (/piˈɑːnoʊ/; [peˈaːno]), also known as the Dedekind–Peano axioms or the Peano postulates, are axioms for the natural…