 | Up a level |
Sato, Kentaro; Walker, Jan (2023). Finitist Axiomatic Truth. The journal of symbolic logic, 88(1), pp. 22-73. Cambridge University Press 10.1017/jsl.2022.65
Jäger, Gerhard; Rosebrock, Timotej Alexander; Sato, Kentaro (2018). Truncation and Semi-Decidability Notions in Applicative Theories. The journal of symbolic logic, 83(03), pp. 967-990. Cambridge University Press 10.1017/jsl.2018.34
Sato, Kentaro (2015). Full and hat inductive definitions are equivalent in NBG. Archive for mathematical logic, 54(1-2), pp. 75-112. Springer International 10.1007/s00153-014-0403-x
Sato, Kentaro; Zumbrunnen, Rico (2015). A new model construction by making a detour via intuitionistic theories I: Operational set theory without choice is Π1-equivalent to KP. Annals of pure and applied logic, 166(2), pp. 121-186. Elsevier 10.1016/j.apal.2014.10.001
Sato, Kentaro (2015). A new model construction by making a detour via intuitionistic theories II: Interpretability lower bound of Feferman's explicit mathematics T0. Annals of pure and applied logic, 166(7-8), pp. 800-835. Elsevier 10.1016/j.apal.2015.04.002
Sato, Kentaro (2014). Relative Predicativity and dependent recursion in second-order set theory and higher-orders theories. The journal of symbolic logic, 79(03), pp. 712-732. Cambridge University Press 10.1017/jsl.2014.28
Flumini, Dandolo; Sato, Kentaro (2014). From hierarchies to well-foundedness. Archive for mathematical logic, 53(7-8), pp. 855-863. Springer International 10.1007/s00153-014-0392-9
Sato, Kentaro (2014). Forcing for hat inductive definitions in arithmetic. Mathematical logic quarterly, 60(4-5), pp. 314-318. Wiley-VCH 10.1002/malq.201300044
Rosebrock, Timotej Alexander (2018). Some Models and Semi-decidability Notions of Applicative Theories (Unpublished). (Dissertation, Institut für Informatik und angewandte Mathematik, Philosophisch-naturwissenschaftliche Fakultät)
