1969/01/01 by Daniel Richardson · 1 citation
Computer Science · Mathematics · #Advanced Algebra and Logic #Numerical Methods and Algorithms #Polynomial and algebraic computation #Multiplication (music) #Undecidable problem #Mathematics #Elementary function #Variable (mathematics) #Expression (computer science) #Constant (computer programming) #Identity (music) #Function (biology) #Subtraction #Set (abstract data type) #Real number #Discrete mathematics #Algebra over a field #Arithmetic #Pure mathematics #Combinatorics #Computer science #Mathematical analysis #Decidability #Physics
paper · doi:10.2307/2271358
openalex publication_date 1969/01/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/10
Let E be a set of expressions representing real, single valued, partially defined functions of one real variable. E * will be the set of functions represented by expressions in E . If A is an expression in E , A(x) is the function denoted by A . It is assumed that E* contains the identity function and the rational numbers as constant functions and that E* is closed under addition, subtraction, multiplication and composition.