- Zhiguang Zhao. Algorithmic correspondence and canonicity for possibility semantics. Journal of Logic and Computation, 31(2):523-572, 2021.
- Daniel Leivant. Finitism, imperative programs and primitive recursion. Journal of Logic and Computation, 31(1):179-192, 2021.
- Juan P. Aguilera 0001, Robert S. Lubarsky. Feedback hyperjump. Journal of Logic and Computation, 31(1):20-39, 2021.
- Isaac Goldbring, Bradd Hart. Operator algebras with hyperarithmetic theory. Journal of Logic and Computation, 31(2):612-629, 2021.
- Mikhail N. Rybakov, Dmitry Shkatov. Complexity of finite-variable fragments of products with K. Journal of Logic and Computation, 31(2):426-443, 2021.
- Julia Ilin, Dick De Jongh, Fan Yang 0004. NNIL-formulas revisited: Universal models and finite model property. Journal of Logic and Computation, 31(2):573-596, 2021.
- Vladimir N. Krupski. On sharp and single-conclusion justification models. Journal of Logic and Computation, 31(1):152-167, 2021.
- Yanhong A. Liu, Scott D. Stoller. Knowledge of uncertain worlds: programming with logical constraints. Journal of Logic and Computation, 31(1):193-212, 2021.
- Dan E. Willard. About the characterization of a fine line that separates generalizations and boundary-case exceptions for the Second Incompleteness Theorem under semantic tableau deduction. Journal of Logic and Computation, 31(1):375-392, 2021.
- C. A. Middelburg. On the strongest three-valued paraconsistent logic contained in classical logic and its dual. Journal of Logic and Computation, 31(2):597-611, 2021.