@article{bgs1999,
  author = {Andreas Blass and Yuri Gurevich and Saharon Shelah},
  title = {Choiceless Polynomial Time},
  journal = {Annals of Pure and Applied Logic},
  volume = {100},
  number = {1--3},
  pages = {141--187},
  year = {1999},
  doi = {10.1016/S0168-0072(99)00005-6},
  url = {https://shelah.logic.at/files/95758/533.pdf},
  note = {Published text: \url{https://shelah.logic.at/files/95758/533.pdf}.
    Original preprint: arXiv:math/9705225v1 (1997),
    \url{https://arxiv.org/abs/math/9705225v1}}
}

@article{bgs2002,
  author = {Andreas Blass and Yuri Gurevich and Saharon Shelah},
  title = {On Polynomial Time Computation Over Unordered Structures},
  journal = {The Journal of Symbolic Logic},
  volume = {67},
  number = {3},
  pages = {1093--1125},
  year = {2002},
  doi = {10.2178/jsl/1190150152},
  url = {https://shelah.logic.at/files/95347/760.pdf},
  note = {\url{https://shelah.logic.at/files/95347/760.pdf}}
}

@article{cfi1992,
  author = {Jin-Yi Cai and Martin F{\"u}rer and Neil Immerman},
  title = {An Optimal Lower Bound on the Number of Variables for Graph Identification},
  journal = {Combinatorica},
  volume = {12},
  number = {4},
  pages = {389--410},
  year = {1992},
  doi = {10.1007/BF01305232},
  url = {https://people.cs.umass.edu/~immerman/pub/opt.pdf},
  note = {Author manuscript: \url{https://people.cs.umass.edu/~immerman/pub/opt.pdf}}
}

@article{drr2008,
  author = {Anuj Dawar and David Richerby and Benjamin Rossman},
  title = {Choiceless Polynomial Time, Counting and the {Cai--F{\"u}rer--Immerman} Graphs},
  journal = {Annals of Pure and Applied Logic},
  volume = {152},
  number = {1--3},
  pages = {31--50},
  year = {2008},
  doi = {10.1016/j.apal.2007.11.011},
  url = {https://www.cl.cam.ac.uk/~ad260/papers/CPT-CFI.pdf},
  note = {Theorem locators refer to the author preprint dated 13 August 2007:
    \url{https://www.cl.cam.ac.uk/~ad260/papers/CPT-CFI.pdf}}
}

@inproceedings{gkps2015,
  author = {Erich Gr{\"a}del and Wied Pakusa and Svenja Schalth{\"o}fer and {\L}ukasz Kaiser},
  title = {Characterising Choiceless Polynomial Time with First-Order Interpretations},
  booktitle = {Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)},
  pages = {677--688},
  publisher = {IEEE},
  year = {2015},
  doi = {10.1109/LICS.2015.68},
  url = {https://www.logic.rwth-aachen.de/pub/schalthoefer/GKPS15.pdf},
  note = {Author copy: \url{https://www.logic.rwth-aachen.de/pub/schalthoefer/GKPS15.pdf}}
}

@inproceedings{gsw2020,
  author = {Martin Grohe and Pascal Schweitzer and Daniel Wiebking},
  title = {Deep {Weisfeiler Leman}},
  booktitle = {Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms},
  pages = {2600--2614},
  publisher = {SIAM},
  year = {2021},
  doi = {10.1137/1.9781611976465.154},
  eprint = {2003.10935v1},
  archivePrefix = {arXiv},
  primaryClass = {cs.LO},
  url = {https://arxiv.org/abs/2003.10935v1},
  note = {Technical locators refer to the full version arXiv:2003.10935v1,
    24 March 2020: \url{https://arxiv.org/abs/2003.10935v1}}
}

@inproceedings{shelah2000,
  author = {Saharon Shelah},
  title = {Choiceless Polynomial Time Logic: Inability to Express},
  booktitle = {Computer Science Logic},
  series = {Lecture Notes in Computer Science},
  volume = {1862},
  pages = {72--125},
  publisher = {Springer},
  year = {2000},
  url = {https://shelah.logic.at/files/199083/634.pdf},
  note = {Author version dated 12 May 2000:
    \url{https://shelah.logic.at/files/199083/634.pdf}}
}

@incollection{rossman2010,
  author = {Benjamin Rossman},
  title = {Choiceless Computation and Symmetry},
  booktitle = {Fields of Logic and Computation: Essays Dedicated to Yuri Gurevich
    on the Occasion of His 70th Birthday},
  series = {Lecture Notes in Computer Science},
  volume = {6300},
  pages = {565--580},
  publisher = {Springer},
  year = {2010},
  doi = {10.1007/978-3-642-15025-8_28},
  url = {https://www.math.toronto.edu/rossman/yg70.pdf},
  note = {Theorem locator refers to the author version dated 6 June 2010:
    \url{https://www.math.toronto.edu/rossman/yg70.pdf}}
}

@inproceedings{pago2021,
  author = {Benedikt Pago},
  title = {Choiceless Computation and Symmetry: Limitations of Definability},
  booktitle = {29th EACSL Annual Conference on Computer Science Logic (CSL 2021)},
  series = {Leibniz International Proceedings in Informatics},
  volume = {183},
  pages = {33:1--33:21},
  publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
  year = {2021},
  doi = {10.4230/LIPIcs.CSL.2021.33},
  url = {https://arxiv.org/abs/2401.07147v1},
  note = {Full version arXiv:2401.07147v1, 13 January 2024:
    \url{https://arxiv.org/abs/2401.07147v1}}
}

@inproceedings{pago2023,
  author = {Benedikt Pago},
  title = {Lower Bounds for Choiceless Polynomial Time via Symmetric {XOR}-Circuits},
  booktitle = {48th International Symposium on Mathematical Foundations of
    Computer Science (MFCS 2023)},
  series = {Leibniz International Proceedings in Informatics},
  volume = {272},
  pages = {73:1--73:15},
  publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
  year = {2023},
  doi = {10.4230/LIPIcs.MFCS.2023.73},
  url = {https://arxiv.org/abs/2302.05426v1},
  note = {Full version arXiv:2302.05426v1, 8 February 2023:
    \url{https://arxiv.org/abs/2302.05426v1}}
}

@misc{gurevichHadani2009,
  author = {Shamgar Gurevich and Ronny Hadani},
  title = {Notes on Canonical Quantization of Symplectic Vector Spaces over Finite Fields},
  year = {2009},
  eprint = {0708.0669v3},
  archivePrefix = {arXiv},
  primaryClass = {math-ph},
  url = {https://arxiv.org/abs/0708.0669v3},
  note = {Version 3, 20 April 2009:
    \url{https://arxiv.org/abs/0708.0669v3}}
}

@misc{cameron2000classical,
  author = {Peter J. Cameron},
  title = {Notes on Classical Groups},
  year = {2000},
  url = {https://webspace.maths.qmul.ac.uk/p.j.cameron/class_gps/cg.pdf},
  note = {Course notes, January--March 2000:
    \url{https://webspace.maths.qmul.ac.uk/p.j.cameron/class_gps/cg.pdf}}
}

@article{loomisWhitney1949,
  author = {L. H. Loomis and H. Whitney},
  title = {An Inequality Related to the Isoperimetric Inequality},
  journal = {Bulletin of the American Mathematical Society},
  volume = {55},
  number = {10},
  pages = {961--962},
  year = {1949},
  doi = {10.1090/S0002-9904-1949-09320-5},
  url = {https://doi.org/10.1090/S0002-9904-1949-09320-5},
  note = {\url{https://doi.org/10.1090/S0002-9904-1949-09320-5}}
}

@incollection{immermanLander1990,
  author = {Neil Immerman and Eric Lander},
  title = {Describing Graphs: A First-Order Approach to Graph Canonization},
  editor = {Alan L. Selman},
  booktitle = {Complexity Theory Retrospective},
  pages = {59--81},
  publisher = {Springer},
  year = {1990},
  doi = {10.1007/978-1-4612-4478-3_5},
  url = {https://people.cs.umass.edu/~immerman/pub/canon.pdf},
  note = {Author manuscript: \url{https://people.cs.umass.edu/~immerman/pub/canon.pdf}}
}

@book{shoup2009,
  author = {Victor Shoup},
  title = {A Computational Introduction to Number Theory and Algebra},
  edition = {2},
  publisher = {Cambridge University Press},
  year = {2009},
  url = {https://shoup.net/ntb/ntb-v2.pdf},
  note = {Section locators refer to author PDF version 2, 16 June 2008:
    \url{https://shoup.net/ntb/ntb-v2.pdf}}
}

@article{dghkp2013,
  author = {Anuj Dawar and Erich Gr{\"a}del and Bjarki Holm and Eryk Kopczy{\'n}ski and Wied Pakusa},
  title = {Definability of Linear Equation Systems over Groups and Rings},
  journal = {Logical Methods in Computer Science},
  volume = {9},
  number = {4},
  pages = {1--26},
  year = {2013},
  doi = {10.2168/LMCS-9(4:12)2013},
  url = {https://arxiv.org/pdf/1204.3022},
  note = {Article 12. Published text: \url{https://arxiv.org/pdf/1204.3022}}
}

@article{graedelPakusa2019,
  author = {Erich Gr{\"a}del and Wied Pakusa},
  title = {Rank Logic is Dead, Long Live Rank Logic!},
  journal = {The Journal of Symbolic Logic},
  volume = {84},
  number = {1},
  pages = {54--87},
  year = {2019},
  doi = {10.1017/jsl.2018.33},
  url = {https://wpakusa.de/assets/pdf/GraedelP19.pdf},
  note = {Published text: \url{https://wpakusa.de/assets/pdf/GraedelP19.pdf}}
}

@inproceedings{pakusaSchalthoeferSelman2016,
  author = {Wied Pakusa and Svenja Schalth{\"o}fer and Erkal Selman},
  title = {Definability of {Cai--F{\"u}rer--Immerman} Problems in Choiceless Polynomial Time},
  booktitle = {25th EACSL Annual Conference on Computer Science Logic (CSL 2016)},
  series = {Leibniz International Proceedings in Informatics},
  volume = {62},
  pages = {19:1--19:17},
  publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
  year = {2016},
  doi = {10.4230/LIPIcs.CSL.2016.19},
  url = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2016.19}
}

@incollection{abuZaidGraedelGrohePakusa2014,
  author = {Faried {Abu Zaid} and Erich Gr{\"a}del and Martin Grohe and Wied Pakusa},
  title = {Choiceless Polynomial Time on Structures with Small Abelian Colour Classes},
  booktitle = {Mathematical Foundations of Computer Science 2014},
  series = {Lecture Notes in Computer Science},
  volume = {8634},
  pages = {50--62},
  publisher = {Springer},
  year = {2014},
  doi = {10.1007/978-3-662-44522-8_5},
  url = {https://wpakusa.de/assets/pdf/AbuZaidGGP14.pdf}
}

@inproceedings{lichterSchweitzer2021,
  author = {Moritz Lichter and Pascal Schweitzer},
  title = {Canonization for Bounded and Dihedral Color Classes in Choiceless Polynomial Time},
  booktitle = {29th EACSL Annual Conference on Computer Science Logic (CSL 2021)},
  series = {Leibniz International Proceedings in Informatics},
  volume = {183},
  pages = {31:1--31:18},
  publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
  year = {2021},
  doi = {10.4230/LIPIcs.CSL.2021.31},
  url = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2021.31}
}

@inproceedings{immerman1982,
  author = {Neil Immerman},
  title = {Relational Queries Computable in Polynomial Time (Extended Abstract)},
  booktitle = {Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing},
  pages = {147--152},
  publisher = {ACM},
  year = {1982},
  doi = {10.1145/800070.802187},
  note = {Author copy: \url{https://people.cs.umass.edu/~immerman/pub/RelationalQueriesSTOC82.pdf}}
}

@inproceedings{vardi1982,
  author = {Moshe Y. Vardi},
  title = {The Complexity of Relational Query Languages (Extended Abstract)},
  booktitle = {Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing},
  pages = {137--146},
  publisher = {ACM},
  year = {1982},
  doi = {10.1145/800070.802186},
  note = {Author copy: \url{https://www.cs.rice.edu/~vardi/papers/stoc82.pdf}}
}

@article{chandraHarel1982,
  author = {Ashok K. Chandra and David Harel},
  title = {Structure and Complexity of Relational Queries},
  journal = {Journal of Computer and System Sciences},
  volume = {25},
  number = {1},
  pages = {99--128},
  year = {1982},
  doi = {10.1016/0022-0000(82)90012-5},
  note = {Author copy: \url{https://www.weizmann.ac.il/math/harel/sites/math.harel/files/users/user56/RelationalQueries.pdf}}
}

@incollection{gurevich1988,
  author = {Yuri Gurevich},
  title = {Logic and the Challenge of Computer Science},
  editor = {Egon B{\"o}rger},
  booktitle = {Current Trends in Theoretical Computer Science},
  pages = {1--57},
  publisher = {Computer Science Press},
  year = {1988},
  note = {Author copy: \url{https://web.eecs.umich.edu/~gurevich/Opera/74.pdf}}
}

@inproceedings{dawarGraedelKullmannPago2025,
  author = {Anuj Dawar and Erich Gr{\"a}del and Leon Kullmann and Benedikt Pago},
  title = {Symmetric Proofs in the Ideal Proof System},
  booktitle = {50th International Symposium on Mathematical Foundations of Computer Science (MFCS 2025)},
  series = {Leibniz International Proceedings in Informatics},
  volume = {345},
  pages = {40:1--40:18},
  publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
  year = {2025},
  doi = {10.4230/LIPIcs.MFCS.2025.40},
  note = {\url{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2025.40}}
}