Author:
Balbiani Philippe,Georgiev Dimiter,Tinchev Tinko
Funder
Bulgarian National Science Fund
Publisher
Oxford University Press (OUP)
Subject
Logic,Hardware and Architecture,Arts and Humanities (miscellaneous),Software,Theoretical Computer Science
Reference20 articles.
1. Decidability and complexity of definability over the class of all partitions;Balbiani,2005
2. Definability over the class of all partitions;Balbiani;Journal of Logic and Computation,2006
3. Undecidable problems for modal definability;Balbiani;Journal of Logic and Computation,2017
4. A note on modal formulas and relational properties;Van Benthem.;Journal of Symbolic Logic,1975
5. Correspondence theory;van Benthem.,1984
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献