10 citations to 10.1016/j.apal.2005.05.005 (Crossref Cited-By Service)

1. Albert Visser, “Transductions in arithmetic”, Annals of Pure and Applied Logic, 167, № 3, 2016, 211  
2. EVGENY KOLMAKOV, LEV BEKLEMISHEV, “AXIOMATIZATION OF PROVABLE n-PROVABILITY”, J. symb. log., 84, № 02, 2019, 849  
3. ANTON FREUND, “A MATHEMATICAL COMMITMENT WITHOUT COMPUTATIONAL STRENGTH”, The Review of Symbolic Logic, 15, № 4, 2022, 880  
4. E. A. Kolmakov, L. D. Beklemishev, “Axiomatizing Provable n-Provability”, Dokl. Math., 98, № 3, 2018, 582  
5. Charalampos Cornaros, “Weak forms of the Regularity Principle in the presence of \documentclass{article}\usepackage{amssymb}\begin{document}\pagestyle{empty}$\bf {\mathsf {I}{\mathrm{E}}_1}$\end{document}”, Mathematical Logic Qtrly, 59, № 1-2, 2013, 84  
6. Charalampos Cornaros, 5028, Logic and Theory of Algorithms, 2008, 129  
7. Albert Visser, “The Arithmetics of a Theory”, Notre Dame J. Formal Logic, 56, № 1, 2015  
8. Tadeusz Litak, Albert Visser, “Lewis meets Brouwer: Constructive strict implication”, Indagationes Mathematicae, 29, № 1, 2018, 36  
9. Thomas F. Icard, Joost J. Joosten, “Provability and Interpretability Logics with Restricted Realizations”, Notre Dame J. Formal Logic, 53, № 2, 2012  
10. RASMUS BLANCK, ALI ENAYAT, “MARGINALIA ON A THEOREM OF WOODIN”, J. symb. log., 82, № 1, 2017, 359