The expressive power of finitely many generalized quantifiers

DOI10.1006/INCO.1995.1166zbMATH Open0849.68034DBLPjournals/iandc/DawarH95OpenAlexW2149330764WikidataQ58215771 ScholiaQ58215771MaRDI QIDQ1908344FDOQ1908344

Lauri Hella, Anuj Dawar

Publication date: 4 November 1996

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

Full work available at URL: https://doi.org/10.1006/inco.1995.1166

zbMATH Keywords

first-order logicfixed point logic

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cited In (14)

• Title not available (Why is that?)
• Title not available (Why is that?)
• First order logic, fixed point logic and linear order
• Generalized lower and upper approximations in quantales
• Title not available (Why is that?)
• Where First-Order and Monadic Second-Order Logic Coincide
• On the generation of quantified lemmas
• Game comonads \& generalised quantifiers
• The hierarchy theorem for generalized quantifiers
• Question answering and database querying: bridging the gap with generalized quantification
• Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs
• On the expressibility hierarchy of Magidor-Malitz quantifiers
• Title not available (Why is that?)
• Canonical Gentzen-Type Calculi with (n,k)-ary Quantifiers

This page was built for publication: The expressive power of finitely many generalized quantifiers

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