Set theory with a filter quantifier

DOI10.2307/2273546MaRDI QIDQ3666826zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3782994 (Why is no real title available?)
• scientific article; zbMATH DE number 3356762 (Why is no real title available?)
• scientific article; zbMATH DE number 3027246 (Why is no real title available?)
• A guide to the identification of admissible sets above structures
• Fundamenta Mathematicae: An Examination of Its Founding and Significance
• On expandability of models of Peano arithmetic. III
• On the role of Ramsey quantifiers in first order arithmetic
• On κ-like structures which embed stationary and closed unbounded subsets
• Stationary logic
• Stationary logic of finitely determinate structures

Cited in

(2)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3666826)