𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Decidability and the number of countable models

✍ Scribed by Terrence Millar

Publisher
Elsevier Science
Year
1984
Tongue
English
Weight
656 KB
Volume
27
Category
Article
ISSN
0168-0072

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Universality and decidability of number-
Universality and decidability of number-conserving cellular automata
✍ AndrΓ©s Moreira πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 138 KB

Number-conserving cellular automata (NCCA) are particularly interesting, both because of their natural appearance as models of real systems, and because of the strong restrictions that number-conservation implies. Here we extend the deΓΏnition of the property to include cellular automata with any set

On Interstices of Countable Arithmetical
On Interstices of Countable Arithmetically Saturated Models of Peano Arithmetic
✍ Nicholas Bamber; Henryk Kotlarski πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 887 KB

## Abstract We give some information about the action of Aut(M) on M(0), where M is a countable arithmetically saturated model of Peano Arithmetic. We concentrate on analogues of moving gaps and covering gaps inside M(0).