APA (7th ed.) Citation

Rybakov, M., & Shkatov, D. (2023). Complexity function and complexity of validity of modal and superintuitionistic propositional logics. Journal of Logic & Computation, 33(7), 1566. https://doi.org/10.1093/logcom/exac085

Chicago Style (17th ed.) Citation

Rybakov, Mikhail, and Dmitry Shkatov. "Complexity Function and Complexity of Validity of Modal and Superintuitionistic Propositional Logics." Journal of Logic & Computation 33, no. 7 (2023): 1566. https://doi.org/10.1093/logcom/exac085.

MLA (9th ed.) Citation

Rybakov, Mikhail, and Dmitry Shkatov. "Complexity Function and Complexity of Validity of Modal and Superintuitionistic Propositional Logics." Journal of Logic & Computation, vol. 33, no. 7, 2023, p. 1566, https://doi.org/10.1093/logcom/exac085.