The hierarchy theorem for generalized quantifiers
暂无分享,去创建一个
[1] Lauri Hella,et al. Definability of Polyadic Lifts of Generalized Quantifiers , 1997, J. Log. Lang. Inf..
[2] Phokion G. Kolaitis,et al. Generalized Quantifiers and Pebble Games on Finite Structures , 1995, Ann. Pure Appl. Log..
[3] Makoto Kanazawa,et al. Dynamics, polarity and quantification , 1996 .
[4] Neil Immerman,et al. An optimal lower bound on the number of variables for graph identification , 1989, 30th Annual Symposium on Foundations of Computer Science.
[5] Lauri Hella. Logical Hierarchies in PTIME , 1996, Inf. Comput..
[6] Lauri Hella,et al. Logical hierarchies in PTIME , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.
[7] Jaroslav Nešetřil. Combinatorics and quantifiers , 1996 .
[8] M. Krynicki,et al. Quantifiers : logics, models, and computation , 1995 .
[9] Anuj Dawar. Generalized Quantifiers and Logical Reducibilities , 1995, J. Log. Comput..
[10] Lauri Hella,et al. Partially Ordered Connectives and Finite Graphs , 1995 .
[11] Alistair H. Lachlan,et al. Vector spaces and binary quantifiers , 1984, Notre Dame J. Formal Log..
[12] Ronald Fagin,et al. The number of finite relational structures , 1977, Discret. Math..
[13] Lauri Hella,et al. Definability Hierarchies of Generalized Quantifiers , 1989, Ann. Pure Appl. Log..
[14] X. Caicedo. Back-and-Forth Systems for Arbitrary Quantifiers , 1980 .
[15] Perlindström. First Order Predicate Logic with Generalized Quantifiers , 1966 .
[16] Marian Srebrny,et al. Set Theory and Hierarchy Theory V , 1977 .