|
| Author |
Message |
|
aka
Frequent VisitorJoined: 18 Mar 2004Posts: 28
|
|
Posted: Wed Feb 02, 2005 4:14 pm Post subject: Propositional Logic
|
|
|
|
1. Give a direct proof of compactness theorem (without using syntactic implication) 2. Give an explicit function f from natural number to natural number such that every tautology of length n has a proof that is at most f(n) lines long.
Thanks in advance.
|
|
|
|
|
|
|
|
All times are GMT + 8 Hours
|
|
| |
You cannot post new topics in this forum
You cannot reply to topics in this forum
You cannot edit your posts in this forum
You cannot delete your posts in this forum
You cannot vote in polls in this forum
|
|