Adding for-loops to first-order logic

DOI10.1006/INCO.2000.2961MaRDI QIDQ1854443zbMATH OpenOpenAlexFDO

Authors 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, http://hdl.handle.net/1942/652

Mathematics Subject Classification ID

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

Recommendations

• Computing with infinitary logic
• Computing with first-order logic
• scientific article; zbMATH DE number 4180775
• Query languages for bags and aggregate functions
• The expressive power of fixed-point logic with counting

Cites work

• Almost Everywhere Equivalence of Logics in Finite Model Theory
• Computing with first-order logic
• Datalog extensions for database queries and updates
• Descriptive complexity: a logician's approach to computation.
• Generalized quantifiers and pebble games on finite structures
• scientific article; zbMATH DE number 515737 (Why is no real title available?)
• scientific article; zbMATH DE number 612169 (Why is no real title available?)
• scientific article; zbMATH DE number 979011 (Why is no real title available?)
• scientific article; zbMATH DE number 803291 (Why is no real title available?)
• scientific article; zbMATH DE number 839556 (Why is no real title available?)
• Relational queries computable in polynomial time
• Structure and complexity of relational queries
• The expressive power of fixed-point logic with counting

Cited in

(1)

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

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

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