1. Adams, R., Luo, Z.: Weyl’s predicative classical mathematics as a logic-enriched type theory. ACM Trans. Comput. Log. 11, 1–29 (2010)
2. Avron, A., Lev, S., Levy, N.: Safety, absoluteness, and computability. In: Ghica, D., Jung, A. (eds.) Proceedings of 27th EACSL Annual Conference on Computer Science Logic (CSL 2018), Leibniz International Proceedings in Informatics (LIPIcs), vol. 119, pp. 8:1–8:17 (2018)
3. Avron, A.: Transitive closure and the mechanization of mathematics. In: Kamareddine, F. (ed.) Thirty Five Years of Automating Mathematics, pp. 149–171. Kluwer Academic Publishers (2003)
4. Avron, A.: Constructibility and decidability versus domain independence and absoluteness. Theor. Comput. Sci. 394, 144–158 (2008)
5. Avron, A.: A new approach to predicative set theory. In: Schindler, R. (ed.) Ways of Proof Theory, Onto Series in Mathematical Logic, pp. 31–63. onto verlag (2010)