Publisher
Springer Science and Business Media LLC
Subject
Linguistics and Language,Philosophy,Computer Science (miscellaneous)
Reference26 articles.
1. Benaim, S., Benedikt, M., Charatonik, W., Kieroński, E., Lenhardt, R., Mazowiecki, F., & Worrell., J. (2013). Complexity of two-variable logic on finite trees. In: Proceedings of the 40th international colloquium on automata, languages and programming (ICALP 2013), pp. 74–88.
2. Bradfield, J. (2013). Team building in dependence. In: Proceedings of the 22nd EACSL annual conference on computer science logic (CSL 2013), pp. 116–128.
3. Charatonik, W., & Witkowski, P. (2013). Two-variable logic with counting and trees. In: Proceedings of the 28th annual ACM/IEEE symposium on logic in computer science (LICS 2013), pp. 73–82.
4. Engström, F. (2012). Generalized quantifiers in dependence logic. Journal of Logic, Language and Information, 21(3), 299–324.
5. Engström, F., & Kontinen, J. (2013). Characterizing quantifier extensions of dependence logic. Journal of Symbolic Logic, 78(1), 307–316.
Cited by
21 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献