Abstract
We solve a problem of Friedman by showing the existence of a logic stronger than first-order logic even for countable models, but still satisfying the general compactness theorem, assuming e.g. the existence of a weakly compact cardinal. We also discuss several kinds of generalized quantifiers.
| Original language | English |
|---|---|
| Pages (from-to) | 342-364 |
| Number of pages | 23 |
| Journal | Transactions of the American Mathematical Society |
| Volume | 204 |
| DOIs | |
| State | Published - 1975 |
Fingerprint
Dive into the research topics of 'Generalized quantifiers and compact logic'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver