Access the full text.
Sign up today, get DeepDyve free for 14 days.
References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.
Two-Variable Logic with Counting and Trees WITOLD CHARATONIK and PIOTR WITKOWSKI, University of Wroclaw We consider the two-variable logic with counting quantifiers (C2 ) interpreted over finite structures that contain two forests of ranked trees. This logic is strictly more expressive than standard C2 and it is no longer a fragment of first-order logic. In particular, it can express that a structure is a ranked tree, a cycle, or a connected graph of bounded degree. It is also strictly more expressive than first-order logic with two variables and two successor relations of two finite linear orders. We present a decision procedure for the satisfiability problem for this logic. The procedure runs in NEXPTIME, which is optimal since the satisfiability problem for plain C2 is NEXPTIME-complete. CCS Concepts: completeness r Theory of computation Finite Model Theory; Problems, reductions and Additional Key Words and Phrases: Counting quantifier, satisfiability, tree, two-variable logic ACM Reference Format: Witold Charatonik and Piotr Witkowski. 2016. Two-variable logic with counting and trees. ACM Trans. Comput. Logic 17, 4, Article 31 (October 2016), 27 pages. DOI: http://dx.doi.org/10.1145/2983622 1. INTRODUCTION 1.1. Two-Variable Logics First-order logic with two variables (for short, two-variable logic, FO2 ) is, in addition to
ACM Transactions on Computational Logic (TOCL) – Association for Computing Machinery
Published: Nov 15, 2016
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.