Properties of Almost All Graphs and Generalized Quantifiers

DOI10.3233/FI-2010-232MaRDI QIDQ3561218zbMATH OpenOpenAlexFDO

Authors Anuj Dawar, Erich Grädel

Publication date 25 May 2010

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2010-232

zbMATH Keywords

0-1 lawgeneralized quantifiersgraph properties

Mathematics Subject Classification ID

Model theory of finite structures (03C13) Logic with extra quantifiers and operators (03C80) Graph theory (05C99)

Recommendations

• On an adjacency property of almost all graphs
• scientific article; zbMATH DE number 3104074
• On the definability of properties of finite graphs
• scientific article; zbMATH DE number 3887722
• A generalization of total graphs
• On quasifactorability in graphs
• Axioms for generalized graphs, illustrated by a Cantor-Bernstein proposition
• Almost universal graphs
• scientific article; zbMATH DE number 4029622
• On the generic existential theory of finite graphs

Cited in

(6)

• scientific article; zbMATH DE number 3871333 (Why is no real title available?)
• Logical properties of random graphs from small addable classes
• Degree lower bounds of tower-type for approximating formulas with parity quantifiers
• A restricted second order logic for finite structures
• First-order logic with equicardinality in random graphs
• Structure of the set of generating graphs in the theory of pseudocriteria

This page was built for publication: Properties of Almost All Graphs and Generalized Quantifiers

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