Journal: Journal of Logic and Computation

Volume 31, Issue 2

393 -- 415M. Pourmahdian, R. Zoghifard. Probability logic: A model-theoretic perspective
416 -- 425M. Clarence Protin. Type inhabitation of atomic polymorphism is undecidable
426 -- 443Mikhail N. Rybakov, Dmitry Shkatov. Complexity of finite-variable fragments of products with K
444 -- 472Lázaro Alberto Larrauri. Probabilities of first-order sentences on sparse random relational structures: An application to definability on random CNF formulas
473 -- 493Steffen Lewitzka. Access-based intuitionistic knowledge
494 -- 522Mikhail N. Rybakov, Dmitry Shkatov. Algorithmic properties of first-order superintuitionistic logics of finite Kripke frames in restricted languages
523 -- 572Zhiguang Zhao. Algorithmic correspondence and canonicity for possibility semantics
573 -- 596Julia Ilin, Dick De Jongh, Fan Yang 0004. NNIL-formulas revisited: Universal models and finite model property
597 -- 611C. A. Middelburg. On the strongest three-valued paraconsistent logic contained in classical logic and its dual
612 -- 629Isaac Goldbring, Bradd Hart. Operator algebras with hyperarithmetic theory
630 -- 653Emanuele Frittaion, Michael Rathjen. Extensional realizability for intuitionistic set theory
654 -- 699Timotheus Kampik, Juan Carlos Nieves. Abstract argumentation and the rational man