Set theory with a filter quantifier

DOI10.2307/2273546zbMath0518.03007OpenAlexW2009675710MaRDI QIDQ3666826

Matt Kaufmann

Publication date: 1983

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2273546

zbMATH Keywords

consistencyreflection principlesexpandabilityaa-quantifieralmost all-quantifierF(aa)faithful models of ZF

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Consistency and independence results (03E35) Model-theoretic forcing (03C25)

Related Items (2)

\(\text{PA} (aa)\) ⋮ A nonconservativity result on global choice

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On expandability of models of Peano arithmetic. III
• Stationary logic of finitely determinate structures
• On the role of Ramsey quantifiers in first order arithmetic
• On κ-like structures which embed stationary and closed unbounded subsets
• Stationary logic
• A guide to the identification of admissible sets above structures
• Fundamenta Mathematicae: An Examination of Its Founding and Significance

This page was built for publication: Set theory with a filter quantifier