English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  On the Skolem Problem and the Skolem Conjecture

Lipton, R., Luca, F., Nieuwveld, J., Ouaknine, J., Purser, D., & Worrell, J. (2022). On the Skolem Problem and the Skolem Conjecture. In C. Baier, & D. Fisman (Eds.), Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science (pp. 1-9). New York, NY: ACM. doi:10.1145/3531130.3533328.

Item is

Basic

show hide
Genre: Conference Paper
Latex : On the {S}kolem Problem and the {S}kolem Conjecture

Files

show Files
hide Files
:
3531130.3533328.pdf (Publisher version), 790KB
Name:
3531130.3533328.pdf
Description:
-
OA-Status:
Hybrid
Visibility:
Public
MIME-Type / Checksum:
application/pdf / [MD5]
Technical Metadata:
Copyright Date:
-
Copyright Info:
-

Locators

show

Creators

show
hide
 Creators:
Lipton, Richard1, Author
Luca, Florian1, Author
Nieuwveld, Joris2, Author           
Ouaknine, Joël2, Author           
Purser, David2, Author           
Worrell, James1, Author
Affiliations:
1External Organizations, ou_persistent22              
2Group J. Ouaknine, Max Planck Institute for Software Systems, Max Planck Society, ou_2541691              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2022
 Publication Status: Published online
 Pages: 19 p.
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: DOI: 10.1145/3531130.3533328
BibTex Citekey: Lipton_LICS2022
 Degree: -

Event

show
hide
Title: 37th Annual ACM/IEEE Symposium on Logic in Computer Science
Place of Event: Haifa, Israel
Start-/End Date: 2022-08-02 - 2022-08-05

Legal Case

show

Project information

show

Source 1

show
hide
Title: Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science
  Abbreviation : LICS 2022
Source Genre: Proceedings
 Creator(s):
Baier, Christel1, Editor
Fisman, Dana1, Editor
Affiliations:
1 External Organizations, ou_persistent22            
Publ. Info: New York, NY : ACM
Pages: - Volume / Issue: - Sequence Number: 5 Start / End Page: 1 - 9 Identifier: ISBN: 978-1-4503-9351-5