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 | 7662 reads
|
Browse archivesActive forum topics |
Recent comments
7 weeks 4 hours ago
7 weeks 1 day ago
7 weeks 3 days ago
14 weeks 3 days ago
20 weeks 1 day ago
20 weeks 2 days ago
21 weeks 1 day ago
23 weeks 6 days ago
25 weeks 2 days ago
25 weeks 2 days ago