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 | 7899 reads
|
Browse archivesActive forum topics
|
Recent comments
1 week 3 days ago
2 weeks 1 day ago
2 weeks 2 days ago
2 weeks 2 days ago
3 weeks 14 hours ago
3 weeks 3 days ago
3 weeks 3 days ago
3 weeks 3 days ago
4 weeks 5 days ago
5 weeks 7 hours ago