An Omitting Types Theorem for first order logic with infinitary relation symbols
From MaRDI portal
Publication:5434201
DOI10.1002/MALQ.200610050zbMATH Open1153.03044OpenAlexW2001161946MaRDI QIDQ5434201FDOQ5434201
Authors: Tarek Sayed Ahmed, Basim Samir
Publication date: 4 January 2008
Published in: Mathematical Logic Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/malq.200610050
Recommendations
- Omitting types algebraically via cylindric algebras
- Omitting types for algebraizable extensions of first order logic
- A note on omitting types in propositional logic.
- Omitting types for infinitary \([0,1]\)-valued logic
- Existence of certain finite relation algebras implies failure of omitting types for \(L_n\)
Cylindric and polyadic algebras; relation algebras (03G15) Boolean algebras with additional operations (diagonalizable algebras, etc.) (06E25)
Cites Work
Cited In (9)
- Omitting uncountable types and the strength of \([0,1]\)-valued logics
- Title not available (Why is that?)
- A note on substitutions in representable cylindric algebras
- Some results about neat reducts
- An Omitting Types Theorem for Sheaves over Topological Spaces
- New perspectives in algebraic logic, from neat embeddings to Erdős graphs
- On a synonymy relation for extensional first order theories. II: A sufficient criterion for non synonymy. Applications
- Omitting types for infinitary \([0,1]\)-valued logic
- Forcing, downward Löwenheim-Skolem and omitting types theorems, institutionally
This page was built for publication: An Omitting Types Theorem for first order logic with infinitary relation symbols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5434201)