We define a class of finite state automata acting on transfinite sequences, and use these automata to prove that no singular cardinal can be defined by a monadic second order formu...
syntax and explicit substitutions Brigitte Pientka1 School of Computer Science McGill University Montreal, Canada This paper sketches a foundation for programming with higher-orde...
In the School of Mathematical Sciences at Queen Mary in the University of London we have been running a module that teaches the students to write good mathematical English. The mo...
This paper examines WiInf-Central, the `virtual homeplace' of a student community (on Information Systems) at the University of Hamburg, and focuses on processes of social ide...
Markus Rohde, Leonard Reinecke, Bernd Pape, Moniqu...
We recall the notions of weak and strong Euler characteristics on a first order structure and make explicit the notion of a Grothendieck ring of a structure. We define partially or...