$L_A(\Finv)$
Bruce, Kim ; Keisler, H. J.
J. Symbolic Logic, Tome 44 (1979) no. 1, p. 15-28 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
The language $L_A(\Finv)$ is formed by adding the quantifier $\Finv x$, "few $x$", to the infinitary logic $L_A$ on an admissible set $A$. A complete axiomatization is obtained for models whose universe is the set of ordinals of $A$ and where $\Finv x$ is interpreted as there exist $A$-finitely many $x$. For well-behaved $A$, every consistent sentence has a model with an $A$-recursive diagram. A principal tool is forcing for $L_A(\Finv)$.
Publié le : 1979-03-14
Classification:  
@article{1183740339,
     author = {Bruce, Kim and Keisler, H. J.},
     title = {$L\_A(\Finv)$},
     journal = {J. Symbolic Logic},
     volume = {44},
     number = {1},
     year = {1979},
     pages = { 15-28},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183740339}
}

Bruce, Kim; Keisler, H. J. $L_A(\Finv)$. J. Symbolic Logic, Tome 44 (1979) no. 1, pp.  15-28. http://gdmltest.u-ga.fr/item/1183740339/