Fluted logic with counting

DOI10.4230/LIPICS.ICALP.2021.141MaRDI QIDQ7241241zbMATH OpenFDO

Authors Ian Pratt-Hartmann

Publication date 12 May 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2021.141

zbMATH Keywords

complexitycounting quantifiersfluted fragmentsatisfiability

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cites work

• Bounds on Positive Integral Solutions of Linear Diophantine Equations
• Complexity and nicety of fluted logic
• Complexity hierarchies beyond elementary
• Complexity of the two-variable fragment with counting quantifiers
• Complexity Results for First-Order Two-Variable Logic with Counting
• Finite satisfiability for two‐variable, first‐order logic with one transitive relation is decidable
• Fluted formulas and the limits of decidability
• Grundzüge der theoretischen Logik.
• Guarded negation
• scientific article; zbMATH DE number 3060222 (Why is no real title available?)
• Minimal solutions of linear diophantine systems : bounds and algorithms
• Modal languages and bounded fragments of predicate logic
• On the complexity of integer programming
• On the Restraining Power of Guards
• The fluted fragment revisited
• The triguarded fragment of first-order logic
• Two variable logic with ultimately periodic counting
• Über Möglichkeiten im Relativkalkül.

Cited in

(1)

• On homogeneous models of fluted languages

This page was built for publication: Fluted logic with counting

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