$L_a(\finv)$
Journal of Symbolic Logic 44 (1):15 - 28 (1979)
Abstract
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)$DOI
10.2307/2273698
Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
On the complexity of models of arithmetic.Kenneth McAloon - 1982 - Journal of Symbolic Logic 47 (2):403-415.
A Covering Lemma for HOD of K (ℝ).Daniel W. Cunningham - 2010 - Notre Dame Journal of Formal Logic 51 (4):427-442.
Computational complexity of some Ramsey quantifiers in finite models.Marcin Mostowski & Jakub Szymanik - 2007 - Bulletin of Symbolic Logic 13:281--282.
Nonstandard characterizations of recursive saturation and resplendency.Stuart T. Smith - 1987 - Journal of Symbolic Logic 52 (3):842-863.
Boolean universes above Boolean models.Friedrich Wehrung - 1993 - Journal of Symbolic Logic 58 (4):1219-1250.
Analytics
Added to PP
2009-01-28
Downloads
72 (#169,111)
6 months
1 (#449,220)
2009-01-28
Downloads
72 (#169,111)
6 months
1 (#449,220)
Historical graph of downloads
Citations of this work
Computable categoricity for pseudo-exponential fields of size ℵ 1.Jesse Johnson - 2014 - Annals of Pure and Applied Logic 165 (7-8):1301-1317.
Generalizing classical and effective model theory in theories of operations and classes.Paolo Mancosu - 1991 - Annals of Pure and Applied Logic 52 (3):249-308.
