78 citations to https://www.mathnet.ru/rus/rm1401
  1. Mints G., “Countable Version of Omega-Rule”, Logic, Language, Information and Computation, Wollic 2011, Lecture Notes in Artificial Intelligence, 6642, eds. Beklemishev L., DeQueiroz R., Springer-Verlag Berlin, 2011, 201–209  mathscinet  zmath  isi
  2. Lev Beklemishev, Lecture Notes in Computer Science, 6618, Logic, Language, and Computation, 2011, 1  crossref
  3. Grigori Mints, Lecture Notes in Computer Science, 6642, Logic, Language, Information and Computation, 2011, 201  crossref
  4. G. Sereny, “How do We Know that the Godel Sentence of a Consistent Theory Is True?”, Philosophia Mathematica, 19:1 (2011), 47  crossref
  5. Beklemishev L.D., “Kripke semantics for provability logic GLP”, Ann. Pure Appl. Logic, 161:6 (2010), 756–774  crossref  mathscinet  zmath  isi  elib
  6. Sergei Artemov, International Mathematical Series, 5, Mathematical Problems from Applied Logic II, 2007, 1  crossref
  7. Sergei Artemov, Studies in Logic and Practical Reasoning, 3, Handbook of Modal Logic, 2007, 927  crossref
  8. Beklemishev L.D., Joosten J.J., Vervoort M., “A finitary treatment of the closed fragment of Japaridze's provability logic”, J. Logic Comput., 15:4 (2005), 447–463  crossref  mathscinet  zmath  isi  elib
Предыдущая
1
2
3
4
5
6
7
8