Two variable logic with ultimately periodic counting

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites work

scientific article; zbMATH DE number 7799614 (Why is no real title available?)
A Simple Proof of the Gale-Ryser Theorem
A new description logic with set constraints and cardinality constraints on role successors
Bounds on Positive Integral Solutions of Linear Diophantine Equations
Carathéodory bounds for integer cones
Complexity Results for First-Order Two-Variable Logic with Counting
Complexity of modal logics with Presburger constraints
Complexity of the Guarded Two-variable Fragment with Counting Quantifiers
Complexity of the two-variable fragment with counting quantifiers
Data-complexity of the two-variable fragment with counting quantifiers
Fifty years of the spectrum problem: survey and new results
Fragments of First-Order Logic
On languages with two variables
On the Decision Problem for Two-Variable First-Order Logic
On the complexity of integer programming
One-variable logic meets Presburger arithmetic
Regular graphs and the spectra of two-variable logic with counting
Satisfiability and query answering in description logics with global and local cardinality constraints
Semigroups, Presburger formulas, and languages
The two-variable fragment with counting and equivalence
The two-variable fragment with counting revisited
Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
Two-variable first-order logic with equivalence closure
Two-variable logic with counting and a linear order
Two-variable logic with counting and trees
Undecidability results on two-variable logics

This page was built for publication: Two variable logic with ultimately periodic counting

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