Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science
DOI10.1145/3531130zbMATH Open1492.03002OpenAlexW4283759833MaRDI QIDQ5096428FDOQ5096428
Author name not available (Why is that?)
Publication date: 16 August 2022
Full work available at URL: https://doi.org/10.1145/3531130
Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to mathematical logic and foundations (03-06) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Logic in computer science (03B70)
Cited In (10)
- Towards logical foundations for probabilistic computation
- Graphs of bounded twin-width are quasi-polynomially \(\chi \)-bounded
- Pebble-depth
- A possible worlds semantics for trustworthy non-deterministic computations
- A Coinductive Reformulation of Milner's Proof System for Regular Expressions Modulo Bisimilarity
- On counting propositional logic and Wagner's hierarchy
- Title not available (Why is that?)
- Proceedings of the 2016 31st annual ACM/IEEE symposium on logic in computer science, LICS 2016, New York City, NY, USA, July 5--8, 2016
- Title not available (Why is that?)
- Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science
This page was built for publication: Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096428)
