368 search results - page 13 / 74 » Arithmetic as a Theory Modulo |
ARITH
2009
IEEE
14 years 3 months ago
2009
IEEE
Moduli of the form 2n ± 1, which greatly simplify certain arithmetic operations in residue number systems (RNS), have been of longstanding interest. A steady stream of designs fo...
LICS
2007
IEEE
14 years 3 months ago
2007
IEEE
In predicate logic, the proof that a theorem P holds in a theory Th is typically conducted in natural deduction or in the sequent calculus using all the information contained in t...
MLQ
2002
13 years 8 months ago
2002
In this paper it is shown that the intuitionistic fixed point theory ID i (strict) for times iterated fixed points of strictly positive operator forms is conservative for negativ...
TC
1998
13 years 8 months ago
1998
—Let F2 denote the binary field and F 2 m an algebraic extension of degree m > 1 over F2 . Traditionally, elements of F 2 m are either represented as powers of a primitive ele...
FSEN
2009
Springer
14 years 3 months ago
2009
Springer
Automata theory presents roughly three types of automata: finite automata, pushdown automata and Turing machines. The automata are treated as language acceptors, and the expressiv...