Quantifier rank for parity of embedded finite models.

DOI10.1016/S0304-3975(02)00401-2zbMATH Open1045.68051MaRDI QIDQ1401237FDOQ1401237

Authors: Hervé Fournier 

Publication date: 17 August 2003

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

Recommendations

• scientific article; zbMATH DE number 1834663
• Descriptive complexity of finite structures: Saving the quantifier rank
• Publication:4936135
• Slicewise Definability in First-Order Logic with Bounded Quantifier Rank.
• Rank hierarchies for generalized quantifiers

zbMATH Keywords

ParityConstraint databasesReachabilityConnnectivityEhrenfeucht--Fraïssé games

Mathematics Subject Classification ID

Database theory (68P15)

Cites Work

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

Cited In (1)

• Title not available (Why is that?)

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

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