On the Restraining Power of Guards
暂无分享,去创建一个
[1] Ehud Hrushovski,et al. Extending partial isomorphisms of graphs , 1992, Comb..
[2] David Harel,et al. Effective transformations on infinite trees, with applications to high undecidability, dominoes, and fairness , 1986, JACM.
[3] A S Kahr,et al. ENTSCHEIDUNGSPROBLEM REDUCED TO THE AEA CASE. , 1962, Proceedings of the National Academy of Sciences of the United States of America.
[4] Ian M. Hodkinson,et al. Finite algebras of relations are representable on finite sets , 1999, Journal of Symbolic Logic.
[5] Richard E. Ladner,et al. The Computational Complexity of Provability in Systems of Modal Propositional Logic , 1977, SIAM J. Comput..
[6] Francesco M. Donini,et al. Reasoning in description logics , 1997 .
[7] Erich Grädel,et al. On Preservation Theorems for Two‐Variable Logic , 1999, Math. Log. Q..
[8] Yuri Gurevich,et al. The Classical Decision Problem , 1997, Perspectives in Mathematical Logic.
[9] Phokion G. Kolaitis,et al. On the Decision Problem for Two-Variable First-Order Logic , 1997, Bulletin of Symbolic Logic.
[10] Robert L. Berger. The undecidability of the domino problem , 1966 .
[11] Bernhard Herwig. Extending partial isomorphisms on finite structures , 1995, Comb..
[12] D. Harel. Recurring dominoes: making the highly undecidable highly understandable , 1985 .
[13] Bernhard Herwig. Extending partial isomorphisms for the small index property of many ω-categorical structures , 1998 .
[14] Erich Grädel,et al. Undecidability results on two-variable logics , 1997, Arch. Math. Log..
[15] Johan van Benthem,et al. Modal Languages and Bounded Fragments of Predicate Logic , 1998, J. Philos. Log..
[16] B. Reed. Surveys in Combinatorics, 1997: Tree Width and Tangles: A New Connectivity Measure and Some Applications , 1997 .
[17] Michael Mortimer,et al. On languages with two variables , 1975, Math. Log. Q..
[18] J. Benthem. DYNAMIC BITS AND PIECES , 1997 .
[19] Martin Otto,et al. Undecidability Results on Two-Variable Logics , 1997, STACS.
[20] Moshe Y. Vardi. Why is Modal Logic So Robustly Decidable? , 1996, Descriptive Complexity and Finite Models.
[21] Y. Gurevich,et al. Remarks on Berger's paper on the domino problem , 1972 .
[22] Martin Otto,et al. On Logics with Two Variables , 1999, Theor. Comput. Sci..
[23] Erich Grädel,et al. Dominoes and the Complexity of Subclasses of Logical Theories , 1989, Ann. Pure Appl. Log..
[24] Erich Grädel,et al. Two-variable logic with counting is decidable , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.
[25] Martin Grohe,et al. Definability and Descriptive Complexity on Databases of Bounded Tree-Width , 1999, ICDT.
[26] Johan van Benthem,et al. Exploring logical dynamics , 1996, Studies in logic, language and information.
[27] José L. Balcázar,et al. Structural Complexity II , 2012, EATCS.