User loginNavigation |
2nd CfP: Structures and DeductionsThe domain is proof theory, the theme is "Eliminate Bureaucracy", the LtU angle is that if we can eliminate bureaucracy from proof theory, then we open the floodgates to applications of proof theory to computer science. That's the theory anyway... Check out:
By Charles A Stewart at 2005-03-17 00:32 | LtU Forum | previous forum topic | next forum topic | other blogs | 8040 reads
|
Browse archives
Active forum topics |
Recent comments
6 weeks 19 hours ago
6 weeks 23 hours ago
6 weeks 23 hours ago
28 weeks 2 days ago
32 weeks 4 days ago
34 weeks 1 day ago
34 weeks 1 day ago
36 weeks 6 days ago
41 weeks 3 days ago
41 weeks 3 days ago