English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse
  1. View item / 
  2. Item Summary

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

Ramsey Quantifiers over Automatic Structures: Complexity and Applications to Verification

MPS-Authors
/persons/resource/persons266088

Ganardi,  Moses
Group G. Zetzsche, Max Planck Institute for Software Systems, Max Planck Society;

/persons/resource/persons260657

Lin,  Anthony W.
Group R. Majumdar, Max Planck Institute for Software Systems, Max Planck Society;

/persons/resource/persons230970

Zetzsche,  Georg
Group G. Zetzsche, Max Planck Institute for Software Systems, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)

arXiv:2205.09015.pdf
(Preprint), 456KB

3531130.3533346.pdf
(Publisher version), 885KB

Supplementary Material (public)
There is no public supplementary material available
Citation

Bergsträßer, P., Ganardi, M., Lin, A. W., & Zetzsche, G. (2022). Ramsey Quantifiers over Automatic Structures: Complexity and Applications to Verification. In C. Baier, & D. Fisman (Eds.), Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science (pp. 1-14). New York, NY: ACM. doi:10.1145/3531130.3533346.


Cite as: https://hdl.handle.net/21.11116/0000-000A-BC88-9
Abstract
There is no abstract available