Sciweavers

2623 search results - page 256 / 525
» Universal Learning Theory
Sort
View
JSYML
2008
105views more  JSYML 2008»
15 years 6 months ago
Finite state automata and monadic definability of singular cardinals
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...
Itay Neeman
ENTCS
2007
102views more  ENTCS 2007»
15 years 6 months ago
Functional Programming With Higher-order Abstract Syntax and Explicit Substitutions
syntax and explicit substitutions Brigitte Pientka1 School of Computer Science McGill University Montreal, Canada This paper sketches a foundation for programming with higher-orde...
Brigitte Pientka
IGPL
2007
75views more  IGPL 2007»
15 years 6 months ago
Logic for Mathematical Writing
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...
Edmund Harriss, Wilfrid Hodges
CSCW
2004
ACM
15 years 6 months ago
Community-Building with Web-Based Systems - Investigating a Hybrid Community of Students
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...
BSL
2000
153views more  BSL 2000»
15 years 6 months ago
Combinatorics with definable sets: Euler characteristics and Grothendieck rings
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...
Jan Krajícek, Thomas Scanlon