Forcing under Anti‐Foundation Axiom: An expression of the stalks

DOI10.1002/malq.200410060zbMath1095.03047OpenAlexW2101453321WikidataQ114018713 ScholiaQ114018713MaRDI QIDQ5485403

Kentaro Sato

Publication date: 30 August 2006

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2027.42/55242

zbMATH Keywords

forcingbisimulationtransition systemsgeneric extensionnon-well-founded set theoryAczel's AFAgeneric filter eliminationIntensional set theory

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Consistency and independence results (03E35) Other set-theoretic hypotheses and axioms (03E65) Other aspects of forcing and Boolean-valued models (03E40)

Related Items (7)

Forcing for hat inductive definitions in arithmetic ⋮ The strength of extensionality. II: Weak weak set theories without infinity ⋮ Classes and truths in set theory ⋮ A new model construction by making a detour via intuitionistic theories. I: Operational set theory without choice is \(\Pi_1\)-equivalent to KP ⋮ The strength of extensionality. I: Weak weak set theories with infinity ⋮ Forcing with the Anti-Foundation axiom ⋮ A new model construction by making a detour via intuitionistic theories. III: Ultrafinitistic proofs of conservations of \(\Sigma_1^1\) collection

This page was built for publication: Forcing under Anti‐Foundation Axiom: An expression of the stalks