Forcing for first-order languages from the perspective of Rasiowa-Sikorski lemma

DOI10.3233/FI-2017-1608MaRDI QIDQ4604554zbMATH OpenOpenAlexWikidataFDO

Authors Janusz Czelakowski

Publication date 2 March 2018

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2017-1608

zbMATH Keywords

Boolean algebrafirst-order logicforcingLindenbaum setRasiowa-Sikorski setsubstitutional semanticsultrafilter

Mathematics Subject Classification ID

Model theory of denumerable and separable structures (03C15) Model-theoretic forcing (03C25) Other model constructions (03C30)

Recommendations

• Rasiowa-Sikorski sets and forcing
• First steps towards a formalization of forcing
• scientific article; zbMATH DE number 3959397
• A saturation property of structures obtained by forcing with a compact family of random variables
• Forcing in Łukasiewicz predicate logic

Cited in

(2)

• A saturation property of structures obtained by forcing with a compact family of random variables
• Rasiowa-Sikorski sets and forcing

This page was built for publication: Forcing for first-order languages from the perspective of Rasiowa-Sikorski lemma

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