Pages that link to "Item:Q2368907"

The following pages link to Succinct definitions in the first order theory of graphs (Q2368907):

Displaying 13 items.

• On the zero-one \(k\)-law extensions (Q338576) (← links)
• First-order and monadic properties of highly sparse random graphs (Q512509) (← links)
• The first order definability of graphs: Upper bounds for quantifier depth (Q860411) (← links)
• First order sentences about random graphs: small number of alternations (Q1693159) (← links)
• Defining long words succinctly in FO and MSO (Q2104260) (← links)
• Monadic second-order properties of very sparse random graphs (Q2404656) (← links)
• Decomposable graphs and definitions with no quantifier alternation (Q2461780) (← links)
• The first order definability of graphs with separators via the Ehrenfeucht game (Q2570131) (← links)
• Bounds for the Quantifier Depth in Finite-Variable Logics (Q2946761) (← links)
• (Q3121527) (← links)
• First-order properties of bounded quantifier depth of very sparse random graphs (Q4605739) (← links)
• The descriptive complexity of subgraph isomorphism without numerics (Q5919541) (← links)
• Group boundaries for semidirect products with \(\mathbb{Z}\) (Q6594552) (← links)