40 citations to 10.1016/S0168-0072(96)00045-0 (Crossref Cited-By Service)
  1. Сергей Николаевич Артемов, Sergei Nikolaevich Artemov, Сергей Николаевич Артемов, Sergei Nikolaevich Artemov, “Подход Колмогорова и Гeделя к интуиционистской логике и работы последнего десятилетия в этом направлении”, УМН, 59, no. 2, 2004, 9  crossref
  2. Pawel Pawlowski, “Proof systems for BAT consequence relations”, Logic Journal of the IGPL, 26, no. 1, 2018, 96  crossref
  3. Andrés Cordón-Franco, F. Félix Lara-Martín, “Semi-honest subrecursive degrees and the collection rule in arithmetic”, Arch. Math. Logic, 63, no. 1-2, 2024, 163  crossref
  4. ANDRÉS CORDÓN-FRANCO, DAVID FERNÁNDEZ-DUQUE, JOOST J. JOOSTEN, FRANCISCO FÉLIX LARA-MARTÍN, “PREDICATIVITY THROUGH TRANSFINITE REFLECTION”, J. symb. log., 82, no. 3, 2017, 787  crossref
  5. TAISHI KURAHASHI, “ARITHMETICAL INTERPRETATIONS AND KRIPKE FRAMES OF PREDICATE MODAL LOGIC OF PROVABILITY”, Rev. symb. logic, 6, no. 1, 2013, 129  crossref
  6. A. Cordón-Franco, A. Fernández-Margarit, F. F. Lara-Martín, “On the Optimality of Conservation Results for Local Reflection in Arithmetic”, J. symb. log., 78, no. 4, 2013, 1025  crossref
  7. Lev D. Beklemishev, “Parameter free induction and provably total computable functions”, Theoretical Computer Science, 224, no. 1-2, 1999, 13  crossref
  8. Lev D. Beklemishev, Logic Colloquium '02, 2017, 75  crossref
  9. David Fernández-Duque, Konstnatinos Papafilippou, Joost J. Joosten, 13137, Logical Foundations of Computer Science, 2022, 52  crossref
  10. Joost J. Joosten, “Consistency statements and iterations of computable functions in IΣ1 and PRA”, Arch. Math. Logic, 49, no. 7-8, 2010, 773  crossref
1
2
3
4
Next