2013/06/14 by Amaldev Manuel, Manuel, Amaldev, Thomas Schwentick +3
Computer Science · #Advanced Algebra and Logic #FOS: Computer and information sciences #Formal Methods in Verification #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge
paper · pdf · doi:10.48550/arxiv.1306.3418
openalex publication_date 2013/06/14 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28
The finite satisfiability problem of two-variable logic extended by a linear order successor and a preorder successor is shown to be undecidable.