Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Wolter, Frank
1997.
The structure of lattices of subframe logics.
Annals of Pure and Applied Logic,
Vol. 86,
Issue. 1,
p.
47.
Zakharyaschev, M.
Wolter, F.
and
Chagrov, A.
2001.
Handbook of Philosophical Logic.
p.
83.
Wolter, Frank
and
Zakharyaschev, Michael
2007.
Handbook of Modal Logic.
Vol. 3,
Issue. ,
p.
427.
Balbiani, Philippe
2009.
Frontiers of Combining Systems.
Vol. 5749,
Issue. ,
p.
165.
Balbiani, Philippe
2011.
Axiomatization and completeness of lexicographic products of modal logics.
Journal of Applied Non-Classical Logics,
Vol. 21,
Issue. 2,
p.
141.
Humberstone, Lloyd
2016.
James W. Garson, Modal Logic for Philosophers. Second Edition, Cambridge University Press, Cambridge, 2013, pp. 506. ISBN: 978-1107609525 (paperback) $44.99..
Studia Logica,
Vol. 104,
Issue. 2,
p.
365.
Georgiev, D. T.
2017.
Definability in the class of all -frames – computability and complexity.
Journal of Applied Non-Classical Logics,
Vol. 27,
Issue. 1-2,
p.
1.
Rybakov, Mikhail
and
Shkatov, Dmitry
2018.
Complexity of finite-variable fragments of propositional modal logics of symmetric frames.
Logic Journal of the IGPL,
Rybakov, Mikhail
and
Shkatov, Dmitry
2018.
Theoretical Aspects of Computing – ICTAC 2018.
Vol. 11187,
Issue. ,
p.
396.
Rybakov, Mikhail
and
Shkatov, Dmitry
2018.
On complexity of propositional linear-time temporal logic with finitely many variables.
p.
313.
Rybakov, Mikhail
and
Shkatov, Dmitry
2018.
Complexity and expressivity of propositional dynamic logics with finitely many variables.
Logic Journal of the IGPL,
Vol. 26,
Issue. 5,
p.
539.
Kurahashi, Taishi
2020.
Uniform Lyndon interpolation property in propositional modal logics.
Archive for Mathematical Logic,
Vol. 59,
Issue. 5-6,
p.
659.
Aceto, Luca
Achilleos, Antonis
Francalanza, Adrian
and
Ingólfsdóttir, Anna
2020.
The complexity of identifying characteristic formulae.
Journal of Logical and Algebraic Methods in Programming,
Vol. 112,
Issue. ,
p.
100529.
Rybakov, Mikhail
and
Shkatov, Dmitry
2022.
Complexity of finite-variable fragments of propositional temporal and modal logics of computation.
Theoretical Computer Science,
Vol. 925,
Issue. ,
p.
45.
Balbiani, Philippe
Gencer, Çiğdem
Rostamigiv, Maryam
and
Tinchev, Tinko
2022.
About the unification type of $\mathbf {K}+\square \square \bot $.
Annals of Mathematics and Artificial Intelligence,
Vol. 90,
Issue. 5,
p.
481.
Aceto, Luca
Achilleos, Antonis
Anastasiadi, Elli
Francalanza, Adrian
and
Ingolfsdottir, Anna
2022.
Complexity through Translations for Modal Logic with Recursion.
Electronic Proceedings in Theoretical Computer Science,
Vol. 370,
Issue. ,
p.
34.
van der Giessen, Iris
Jalali, Raheleh
and
Kuznets, Roman
2023.
Automated Reasoning with Analytic Tableaux and Related Methods.
Vol. 14278,
Issue. ,
p.
263.
Balbiani, Philippe
and
Gougeon, Quentin
2023.
Projective relative unification through duality.
Journal of Logic and Computation,
GOLDBLATT, ROBERT
and
HODKINSON, IAN
2023.
CANONICITY IN POWER AND MODAL LOGICS OF FINITE ACHRONAL WIDTH.
The Review of Symbolic Logic,
p.
1.
Shehtman, Valentin
2023.
On Kripke completeness of modal predicate logics around quantified K5.
Annals of Pure and Applied Logic,
Vol. 174,
Issue. 2,
p.
103202.