Set theory with a filter quantifier

DOI10.2307/2273546zbMATH Open0518.03007OpenAlexW2009675710MaRDI QIDQ3666826FDOQ3666826

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

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

Cited In (2)

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

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)