𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On arithmetical algorithms over finite fields

✍ Scribed by David G Cantor


Book ID
107885096
Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
758 KB
Volume
50
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Arithmetical definability over finite st
✍ Troy Lee πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 134 KB

## Abstract Arithmetical definability has been extensively studied over the natural numbers. In this paper, we take up the study of arithmetical definability over finite structures, motivated by the correspondence between uniform AC^0^ and FO(PLUS, TIMES). We prove finite analogs of three classic r