Adding for-loops to first-order logic

DOI10.1006/inco.2000.2961zbMath1007.68042OpenAlexW2070758373MaRDI QIDQ1854443

Frank Neven, Martin Otto, Jurek Tyszkiewicz, Jan Van den Bussche

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/770f4ba44a44152388d9c8b1c8fb4b1eae6d1f67

Mathematics Subject Classification ID

Database theory (68P15) Model theory of finite structures (03C13)

Related Items (1)

Program schemes, arrays, Lindström quantifiers and zero-one laws

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Datalog extensions for database queries and updates
• Structure and complexity of relational queries
• Computing with first-order logic
• Generalized quantifiers and pebble games on finite structures
• Almost Everywhere Equivalence of Logics in Finite Model Theory
• Relational queries computable in polynomial time
• The expressive power of fixed-point logic with counting

This page was built for publication: Adding for-loops to first-order logic