scientific article; zbMATH DE number 7327935

MaRDI QIDQ5856403

Siddharth Bhaskar, Alex Kruckman

Publication date: 26 March 2021

Full work available at URL: https://arxiv.org/abs/1708.00148

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

finite model theoryleast fixed-point logicinductive definabilitymodel-theoretic dividing lines

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cites Work

• Unnamed Item
• Multiplicative structure in stable expansions of the group of integers
• Elements of finite model theory.
• When is arithmetic possible?
• Classification theory and the number of non-isomorphic models.
• Elementary induction on abstract structures
• Disjoint \(n\)-amalgamation and pseudofinite countably categorical theories
• Interpreting nowhere dense graph classes as a classical notion of model theory
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• On model-theoretic tree properties
• Relational queries computable in polynomial time
• What is a Structure Theory?
• Paley graphs satisfy all first-order adjacency axioms

This page was built for publication: