Rank logic is dead, long live rank logic!

DOI10.4230/LIPIcs.CSL.2015.390zbMath1373.03047arXiv1503.05423OpenAlexW2963585823MaRDI QIDQ5351970

Erich Grädel, Wied Pakusa

Publication date: 31 August 2017

Full work available at URL: https://arxiv.org/abs/1503.05423

zbMATH Keywords

polynomial timedescriptive complexityrank logic

Mathematics Subject Classification ID

Logic in computer science (03B70) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Descriptive complexity and finite models (68Q19)

Related Items (5)

Is Polynomial Time Choiceless? ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the expressive power of linear algebra on graphs ⋮ Unnamed Item

This page was built for publication: Rank logic is dead, long live rank logic!