This is the first of two papers that deal with L(aa) and related logics. Here we establish: every consistent \(L_{\omega_ 1\omega}(Q)\) sentence has an \b{F}-determinate model (\b{F} is a countable fragment of \(L_{\omega_ 1\omega}(aa))\); and it is consistent that L(Q) has the weak Beth property. A logic has the weak Beth property if it satisfies Beth's theorem where the hypothesis has been strengthened to require that implicit definitions guarantee existence as well as uniqueness.
Recommendations
Cited in
(16)- Harmonious logic: Craig's interpolation theorem and its descendants
- The Craig interpolation theorem in abstract model theory
- Remarks in abstract model theory
- Model constructions in stationary logic. II: Definable ultrapowers
- On the homogeneity property for certain quantifier logics
- Obituary: Alan Mekler
- Stationary logic and its friends. II
- The Hanf number of stationary logic
- European Summer Meeting of the Association for Symbolic Logic (Logic Colloquium '88), Padova, 1988
- ω-Trees in stationary logic
- scientific article; zbMATH DE number 3941517 (Why is no real title available?)
- Automorphism properties of stationary logic
- On coherent systems of projections forN1-separable groups
- TWO-VARIABLE LOGIC HAS WEAK, BUT NOT STRONG, BETH DEFINABILITY
- Definability properties and the congruence closure
- The theorems of Beth and Craig in abstract model theory. III: \(\Delta\)- logics and infinitary logics
This page was built for publication: Stationary logic and its friends. I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1820149)
