The characterization of second-order type isomorphisms is a purely syntactical problem that we propose to study under the enlightenment of game semantics. We study this question i...
The principal result of this paper answers a long-standing question in the model theory of arithmetic [KS, Question 7] by showing that there exists an uncountable arithmetically cl...
A simple cut elimination proof for arithmetic with epsilon symbol is used to establish termination of a modified epsilon substitution process. This opens a possibility of extensio...