Serge Abiteboul, Richard Hull & Victor Vianu (1995):
Foundations of Databases.
Addison-Wesley.
Andreas Blass, Yuri Gurevich & Saharon Shelah (1999):
Choiceless Polynomial Time.
Ann. Pure Appl. Logic 100(1-3),
pp. 141–187,
doi:10.1016/S0168-0072(99)00005-6.
Egon Börger & Robert F. Stärk (2003):
Abstract State Machines. A Method for High-Level System Design and Analysis.
Springer,
doi:10.1007/978-1-84882-736-3_3.
Ashok K. Chandra & David Harel (1980):
Computable Queries for Relational Data Bases.
J. Comput. Syst. Sci. 21(2),
pp. 156–178,
doi:10.1016/0022-0000(80)90032-X.
P. Galliani & Lauri Hella (2013):
Inclusion logic and fixed point logic.
In: CSL,
pp. 281–295,
doi:10.4230/LIPIcs.CSL.2013.281.
E. Grädel (2013):
Model-checking games for logics of imperfect information.
Theor. Comput. Sci. 493,
pp. 2–14,
doi:10.1016/j.tcs.2012.10.033.
E. Grädel & S. Siebertz (2012):
Dynamic definability.
In: ICDT,
pp. 236–248,
doi:10.1145/2274576.2274601.
Y. Gurevich (1985):
A new thesis.
American Mathematical Society Abstracts 6(4),
pp. 317.
J. Hintikka (1973):
Logic, Language-Games and Information: Kantian Themes in the Philosophy of Logic.
Oxford: Clarendon Press.
J. Hintikka (1996):
The Principles of Mathematics Revisited.
Cambridge University Press,
doi:10.1017/cbo9780511624919.
J. Hintikka & G. Sandu (1989):
Informational independence as a semantical phenomenon.
In: Proceedings of the Eighth International Congress of Logic Methodology and Philosophy of Science,
pp. 571–589,
doi:10.1016/S0049-237X(08)70066-1.
Giorgi Japaridze (2003):
Introduction to computability logic.
Ann. Pure Appl. Logic 123(1-3),
pp. 1–99,
doi:10.1016/S0168-0072(03)00023-X.
A. Kuusisto (2013):
A double team semantics for generalized quantifiers.
CoRR abs/1310.3032.
Available at http://arxiv.org/abs/1310.3032.
P. Lindström (1966):
First order predicate logic with generalized quantifiers.
Theoria 32,
pp. 186–195,
doi:10.1111/j.1755-2567.1966.tb00600.x.
A. L. Mann, G. Sandu & M. Sevenster (2011):
Independence-Friendly Logic - a Game-Theoretic Approach.
London Mathematical Society lecture note series 386.
Cambridge University Press,
doi:10.1017/CBO9780511981418.
S. Patnaik & N. Immerman (1994):
Dyn-FO: A parallel, dynamic complexity class.
In: PODS,
pp. 210–221,
doi:10.1145/182591.182614.
J. A. Väänänen (1979):
Abstract logic and set theory. I. Definability.
In: Logic Colloquium, '78, Studies in Logic Foundations Mathematics.
North Holland, Amsterdam,
pp. 391–421,
doi:10.1016/s0049-237x(08)71637-9.
J. A. Väänänen (2007):
Dependence Logic - A New Approach to Independence Friendly Logic.
London Mathematical Society student texts 70.
Cambridge University Press,
doi:10.1017/cbo9780511611193.004.
J. A. Väänänen (2012):
Second order logic or set theory?.
Bulletin of Symbolic Logic 18(1),
pp. 91–121,
doi:10.2178/bsl/1327328440.