| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 437369 | Theoretical Computer Science | 2011 | 17 Pages |
Abstract
We investigate families of finite initial segments of standard models for various arithmetics. We give an axiomatization of the theory of sentences true in almost all finite models with addition. We also characterize its complete extensions and relate its infinite models to models of Presburger arithmetic.We also estimate the complexity of complete extensions of the arithmetic with addition and multiplication.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
