📣 Try out the NEW Gateway to Research and let us know what you think.

We're looking for users to test the new service during August and September and share their feedback. Express your interest by completing this short form.

Complexity of Two-Variable Logic on Finite Trees (2016)

First Author: Benaim S

Attributed to: Counter Automata: Verification and Synthesis funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1145/2996796

Publication URI: http://dx.doi.org/10.1145/2996796

Type: Journal Article/Review

Parent Publication: ACM Transactions on Computational Logic

Issue: 4