A Model-Theoretic Property of Sharply Bounded Formulae, with some Applications
✍ Scribed by Jan Johannsen
- Publisher
- John Wiley and Sons
- Year
- 1998
- Tongue
- English
- Weight
- 581 KB
- Volume
- 44
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
✦ Synopsis
We define a property of substructures of models of arithmetic, that of being length-initial, and show that sharply bounded formulae are absolute between a model and its length-initial submodels. We use this to prove independence results for some weak fragments of bounded arithmetic by constructing appropriate models as length-initial submodels of some given model.
📜 SIMILAR VOLUMES
## Abstract Twelve properties of a highly heterogeneous class of organic solvents have been modeled with a graph‐theoretical molecular connectivity modified (MC) method, which allows to encode the core electrons and the hydrogen atoms. The graph‐theoretical method uses the concepts of simple, gener