Assertions depending on time and corresponding logical calculi
A kind of categoricity
Undecidability of Some Topological Theories
Recursive objects in all finite types
Some relational systems and the associated topological spaces
Elementarily definable analysis
Some proofs of undecidability of arithmetic
A note on the theory of propositional types
On the definitions of computable real continuous functions
On the definition of computable functionals
Computable functionals
An unfinitizability proof by means of restricted reduced power
Some classes of recursive functions
Introduction§ 1. Preliminary notions§ 2. Elementary functions§ 3. Classes based on limited recursion§ 4. Classes Є n§ 5. Applications of the class Є n
Page 1