Almost All Complex Quantifiers Are Simple

DOI10.1007/978-3-642-14322-9_21MaRDI QIDQ3585012zbMATH OpenOpenAlexFDO

Authors Jakub Szymanik

Publication date 31 August 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://www.jakubszymanik.com/papers/complex_qua.pdf

zbMATH Keywords

computational complexityiterationgeneralized quantifierscumulationBoolean combinationspolyadic quantifiersresumption

Mathematics Subject Classification ID

Logic of natural languages (03B65) Logic with extra quantifiers and operators (03C80) Complexity of computation (including implicit computational complexity) (03D15)

This page was built for publication: Almost All Complex Quantifiers Are Simple

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