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 | 8172 reads
|
Browse archives
Active forum topics |
Recent comments
1 week 5 days ago
42 weeks 9 hours ago
42 weeks 13 hours ago
42 weeks 13 hours ago
1 year 12 weeks ago
1 year 16 weeks ago
1 year 17 weeks ago
1 year 17 weeks ago
1 year 20 weeks ago
1 year 25 weeks ago