𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Three theorems on elementary theories and -reducibility

✍ Scribed by S. D. Denisov

Publisher
Springer US
Year
1974
Tongue
English
Weight
201 KB
Volume
13
Category
Article
ISSN
0002-5232

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On Theories Having Three Countable Model
On Theories Having Three Countable Models
✍ Koichiro Ikeda; Akito Tsuboi; Anand Pillay πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 368 KB

A theory T is called almost No-categorical if for any pure typespl(zl), . . . ,pn(zn) there are only finitely many pure types which extend p 1 ( ~1 ) U . . . U p ~( z , ) . It is shown that if T is an almost No-categorical theory with I(No,T) = 3, then a dense linear ordering is interpretable in T .

On Euclid’s algorithm and elementary num
On Euclid’s algorithm and elementary number theory
✍ Roland Backhouse; JoΓ£o F. Ferreira πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 397 KB

Algorithms can be used to prove and to discover new theorems. This paper shows how algorithmic skills in general, and the notion of invariance in particular, can be used to derive many results from Euclid's algorithm. We illustrate how to use the algorithm as a verification interface (i.e., how to v