Skip to main navigation Skip to search Skip to main content

Generalized quantifiers and compact logic

Research output: Contribution to journalArticlepeer-review

65 Scopus citations

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 languageEnglish
Pages (from-to)342-364
Number of pages23
JournalTransactions of the American Mathematical Society
Volume204
DOIs
StatePublished - 1975

Fingerprint

Dive into the research topics of 'Generalized quantifiers and compact logic'. Together they form a unique fingerprint.

Cite this