Quantifier rank for parity of embedded finite models.

DOI10.1016/S0304-3975(02)00401-2zbMath1045.68051MaRDI QIDQ1401237

Hervé Fournier

Publication date: 17 August 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

ParityConstraint databasesReachabilityEhrenfeucht--Fraïssé gamesConnnectivity

Mathematics Subject Classification ID

Database theory (68P15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Model theory.
• Queries with arithmetical constraints
• Relational queries over interpreted structures
• Relational expressive power of constraint query languages
• How to Pick Out the Integers in the Rationals: An Application of Number Theory to Logic
• Stability theory, permutations of indiscernibles, and embedded finite models
• Definability of Geometric Properties in Algebraically Closed Fields
• Definability and decision problems in arithmetic

This page was built for publication: Quantifier rank for parity of embedded finite models.