- Dima Grigoriev, Edward A. Hirsch, “Algebraic proof systems over formulas”, Theoretical Computer Science, 303, no. 1, 2003, 83
![https://doi.org/10.1016/S0304-3975(02)00446-2 crossref](/refsvg/svg/crossref.svg)
- Mateus de Oliveira Oliveira, 10501, Automated Reasoning with Analytic Tableaux and Related Methods, 2017, 364
![https://doi.org/10.1007/978-3-319-66902-1_22 crossref](/refsvg/svg/crossref.svg)
- Nashlen Govindasamy, Tuomas Hakoniemi, Iddo Tzameret, 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS), 2022, 188
![https://doi.org/10.1109/FOCS54457.2022.00025 crossref](/refsvg/svg/crossref.svg)
- Pavel Pudlák, 5010, Computer Science – Theory and Applications, 2008, 13
![https://doi.org/10.1007/978-3-540-79709-8_4 crossref](/refsvg/svg/crossref.svg)
- Fu Li, Iddo Tzameret, Zhengyu Wang, “Characterizing Propositional Proofs as Noncommutative Formulas”, SIAM J. Comput., 47, no. 4, 2018, 1424
![https://doi.org/10.1137/16M1107632 crossref](/refsvg/svg/crossref.svg)
- Robert Andrews, Michael A. Forbes, Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, 2022, 389
![https://doi.org/10.1145/3519935.3520025 crossref](/refsvg/svg/crossref.svg)
- Alexander A. Razborov, 1099, Automata, Languages and Programming, 1996, 48
![https://doi.org/10.1007/3-540-61440-0_116 crossref](/refsvg/svg/crossref.svg)
- Jan Krajíček, “Discretely ordered modules as a first-order extension of the cutting planes proof system”, J. symb. log., 63, no. 4, 1998, 1582
![https://doi.org/10.2307/2586668 crossref](/refsvg/svg/crossref.svg)
- Marcelo Finger, Mauricio S. C. Hernandes, 6188, Logic, Language, Information and Computation, 2010, 1
![https://doi.org/10.1007/978-3-642-13824-9_1 crossref](/refsvg/svg/crossref.svg)
- Sam Buss, Dima Grigoriev, Russell Impagliazzo, Toniann Pitassi, Proceedings of the thirty-first annual ACM symposium on Theory of Computing, 1999, 547
![https://doi.org/10.1145/301250.301399 crossref](/refsvg/svg/crossref.svg)