First order complexity of finite random structures

Demin, D. orcid.org/0009-0000-0780-419X and Zhukovskii, M. orcid.org/0000-0001-8763-9533 (2024) First order complexity of finite random structures. In: LICS '24: Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science. 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 08 Jul - 11 Aug 2024, Tallinn, Estonia. ACM , pp. 1-14. ISBN 9798400706608

Abstract

Metadata

Item Type: Proceedings Paper
Authors/Creators:
Copyright, Publisher and Additional Information:

© 2024 The Authors. Except as otherwise noted, this author-accepted version of a journal article published in LICS '24: Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science is made available via the University of Sheffield Research Publications and Copyright Policy under the terms of the Creative Commons Attribution 4.0 International License (CC-BY 4.0), which permits unrestricted use, distribution and reproduction in any medium, provided the original work is properly cited. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/

Keywords: random structures; first order logic; logical limit laws; zero-one laws; random graphs; logical complexity; recursively enumerable languages
Dates:
  • Published: 8 July 2024
  • Published (online): 8 July 2024
Institution: The University of Sheffield
Academic Units: The University of Sheffield > Faculty of Engineering (Sheffield) > Department of Computer Science (Sheffield)
Depositing User: Symplectic Sheffield
Date Deposited: 07 Nov 2024 15:10
Last Modified: 07 Nov 2024 15:10
Status: Published
Publisher: ACM
Refereed: Yes
Identification Number: 10.1145/3661814.3662127
Related URLs:
Open Archives Initiative ID (OAI ID):

Export

Statistics