Complexity of Ehrenfeucht models
✍ Scribed by A. N. Gavryushkin
- Publisher
- Springer US
- Year
- 2006
- Tongue
- English
- Weight
- 196 KB
- Volume
- 45
- Category
- Article
- ISSN
- 0002-5232
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
This paper introduces a new Ehrenfeucht-Fraïssé type game that is played on two classes of models rather than just two models. This game extends and generalizes the known Ajtai-Fagin game to the case when there are several alternating (coloring) moves played in different models. The game allows Dupl
Trees are natural generalizations of ordinals and this is especially apparent when one tries to ÿnd an uncountable analogue of the concept of the Scott-rank of a countable structure. The purpose of this paper is to introduce new methods in the study of an ordering between trees whose analogue is the