Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Iemhoff, Rosalie
2001.
A(nother) characterization of intuitionistic propositional logic.
Annals of Pure and Applied Logic,
Vol. 113,
Issue. 1-3,
p.
161.
Iemhoff, Rosalie
2003.
Preservativity logic: An analogue of interpretability logic for constructive theories.
Mathematical Logic Quarterly,
Vol. 49,
Issue. 3,
p.
230.
Iemhoff, Rosalie
2003.
Computer Science Logic.
Vol. 2803,
Issue. ,
p.
255.
Artemov, Sergei N.
and
Beklemishev, Lev D.
2005.
Handbook of Philosophical Logic, 2nd Edition.
Vol. 13,
Issue. ,
p.
189.
Iemhoff, Rosalie
2005.
Intermediate Logics and Visser's Rules.
Notre Dame Journal of Formal Logic,
Vol. 46,
Issue. 1,
Jeřábek, Emil
2006.
Frege systems for extensible modal logics.
Annals of Pure and Applied Logic,
Vol. 142,
Issue. 1-3,
p.
366.
Mints, G.
and
Kojevnikov, A.
2006.
Intuitionistic Frege systems are polynomially equivalent.
Journal of Mathematical Sciences,
Vol. 134,
Issue. 5,
p.
2392.
Rybakov, V.
2006.
Computer Science – Theory and Applications.
Vol. 3967,
Issue. ,
p.
322.
Beklemishev, Lev
and
Visser, Albert
2006.
Mathematical Problems from Applied Logic I.
Vol. 4,
Issue. ,
p.
77.
Fedorishin, B. R.
2007.
An explicit basis for the admissible inference rules in the Gödel-Löb logic GL.
Siberian Mathematical Journal,
Vol. 48,
Issue. 2,
p.
339.
Rybakov, V.
2007.
Logical Foundations of Computer Science.
Vol. 4514,
Issue. ,
p.
486.
Artemov, Sergei
2007.
Handbook of Modal Logic.
Vol. 3,
Issue. ,
p.
927.
Artemov, Sergei
2007.
Mathematical Problems from Applied Logic II.
Vol. 5,
Issue. ,
p.
1.
Jeřábek, Emil
2007.
Complexity of admissible rules.
Archive for Mathematical Logic,
Vol. 46,
Issue. 2,
p.
73.
Groszek, Marcia
2007.
2006–07 Winter Meeting of the Association for Symbolic Logic.
Bulletin of Symbolic Logic,
Vol. 13,
Issue. 3,
p.
375.
Rybakov, V.
2007.
Multi-modal and Temporal Logics with Universal Formula--Reduction of Admissibility to Validity and Unification.
Journal of Logic and Computation,
Vol. 18,
Issue. 4,
p.
509.
Rybakov, V.
2008.
Linear temporal logic with until and next, logical consecutions.
Annals of Pure and Applied Logic,
Vol. 155,
Issue. 1,
p.
32.
Rybakov, V.
2008.
Branching Time Logics $\mathcal {BTL}^{\mathrm {U,S}}_{\mathrm {N},\mathrm {N}^{-1}}(\mathcal {Z})_{\alpha }$ with Operations Until and Since Based on Bundles of Integer Numbers, Logical Consecutions, Deciding Algorithms.
Theory of Computing Systems,
Vol. 43,
Issue. 2,
p.
254.
Wolter, Frank
and
Zakharyaschev, Michael
2008.
Undecidability of the unification and admissibility problems for modal and description logics.
ACM Transactions on Computational Logic,
Vol. 9,
Issue. 4,
p.
1.
Olson, J.S.
Raftery, J.G.
and
Van Alten, C.J.
2008.
Structural Completeness in Substructural Logics.
Logic Journal of IGPL,
Vol. 16,
Issue. 5,
p.
453.