Capturing Relativized Complexity Classes without Order

DOI10.1002/malq.19980440108zbMath0892.03010OpenAlexW2073028890WikidataQ58215739 ScholiaQ58215739MaRDI QIDQ4379631

Anuj Dawar, Lauri Hella, Georg Gottlob

Publication date: 30 March 1998

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.19980440108

zbMATH Keywords

ordered structuresfinite model theoryLindström quantifiersrelativized complexity classes

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Logic with extra quantifiers and operators (03C80) Model theory of finite structures (03C13) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (1)

The complexity class θp2: Recent results and applications in AI and modal logic

This page was built for publication: Capturing Relativized Complexity Classes without Order