Descriptive complexity of real computation and probabilistic independence logic

DOI10.1145/3373718.3394773MaRDI QIDQ5145662OpenAlexWikidataFDO

Authors Miika Hannula, Juha Kontinen, Jan Van den Bussche, Jonni Virtema

Publication date 21 January 2021

Published in Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

team semanticsdescriptive complexityindependence logicreal arithmeticBlum-Shub-Smale machines

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cited in

(10)

• Parameterized complexity of weighted team definability
• Unifying hidden-variable problems from quantum mechanics by logics of dependence and independence
• Logics with probabilistic team semantics and the Boolean negation
• Temporal team semantics revisited
• A parameterized view on the complexity of dependence logic
• On the relation between descriptional complexity and algorithmic probability
• On elementary logics for quantitative dependencies
• Parameterized complexity of propositional inclusion and independence logic
• Tractability frontiers in probabilistic team semantics and existential second-order logic over the reals
• Tractability frontiers in probabilistic team semantics and existential second-order logic over the reals

This page was built for publication: Descriptive complexity of real computation and probabilistic independence logic

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