Ultrafilter translations. I: \((\lambda, \lambda)\)-compactness of logics with a cardinality quantifier
type: Item
instance of: scholarly article
title: Ultrafilter translations. I: \((\lambda, \lambda)\)-compactness of logics with a cardinality quantifier
zbMATH Open document ID: 0840.03028
DOI: 10.1007/BF01273686
author: Paolo Lipparini
published in: Archive for Mathematical Logic
publication date: 1996-07-01T00:00:00Z
review text: We develop a method for extending results about ultrafilters into a more general setting. In this paper we shall be mainly concerned with applications to cardinality logics. For example, assuming \(V = L\), Gödel's Axiom of Constructibility, we prove that if \(\lambda > \omega_\alpha\) then the logic with the quantifier ``there exist \(\omega_\alpha\) many'' is \((\lambda, \lambda)\)-compact if and only if either \(\lambda\) is weakly compact or \(\lambda\) is singular of cofinality \(< \omega_{\alpha - 1}\). As a corollary, for every infinite cardinals \(\lambda\) and \(\mu\), there exists a \((\lambda, \lambda)\)-compact non-\((\mu, \mu)\)-compact logic if and only if either \(\lambda < \mu\) or \(\text{cf} \lambda < \text{cf} \mu\) or \(\lambda > \mu\) is weakly compact. Counterexamples are given showing that the above statements may fail, if \(V = L\) is not assumed. However, without special assumptions, analogous results are obtained for the stronger notion of \([\lambda, \lambda]\)-compactness.
Mathematics Subject Classification ID: 03C80
Mathematics Subject Classification ID: 03E45
Mathematics Subject Classification ID: 03C20
Mathematics Subject Classification ID: 03E55
Mathematics Subject Classification ID: 03C75
zbMATH DE Number: 851910
zbMATH Keywords: axiom of constructibility
zbMATH Keywords: compactness
zbMATH Keywords: ultrafilters
zbMATH Keywords: cardinality logics
MaRDI profile type: Publication
cites work: Relative consistency results via strong compactness
cites work: Descendingly Incomplete Ultrafilters and the Cardinality of Ultrapowers
cites work: Q3714043
cites work: Regularity of ultrafilters
cites work: Q5570212
cites work: The weak □* is really weaker than the full □
cites work: Infinitary compactness without strong inaccessibility
cites work: Q4052073
cites work: Regularity of ultrafilters and the core model
cites work: Q4159049
cites work: On cardinalities of ultraproducts
cites work: Q4288806
cites work: Limit ultrapowers and abstract logics
cites work: Q3211288
cites work: Q3812223
cites work: On the singular cardinals problem. I
cites work: Maximal models in the language with quantifier ''There exist uncountably many''
cites work: Q5684675
full work available at URL: https://doi.org/10.1007/bf01273686
OpenAlex ID: W1975647141
description: scientific article; zbMATH DE number 851910