On Almost Sure Elimination of Numerical Quantifiers

DOI10.1093/LOGCOM/13.2.273MaRDI QIDQ4461933zbMATH OpenOpenAlexFDO

Authors Risto Kaila

Publication date 18 May 2004

Published in Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/logcom/13.2.273

zbMATH Keywords

almost sure quantifier eliminationfinite structuresinfinitary logicsLindström quantifiersnumerical quantifierszero-one law

Mathematics Subject Classification ID

Quantifier elimination, model completeness, and related topics (03C10) Model theory of finite structures (03C13) Other infinitary logic (03C75) Logic with extra quantifiers and operators (03C80)

Recommendations

• On probabilistic elimination of generalized quantifiers
• scientific article; zbMATH DE number 17685
• Almost everywhere elimination of probability quantifiers
• Stability, the finite cover property and 0-1 laws
• Ups and downs of first order sentences on random graphs

Cited in

(4)

• On probabilistic elimination of generalized quantifiers
• scientific article; zbMATH DE number 5582998 (Why is no real title available?)
• Almost everywhere elimination of probability quantifiers
• First-order logic with equicardinality in random graphs

This page was built for publication: On Almost Sure Elimination of Numerical Quantifiers

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