| Subject: | Proof of finite axiomatizability |
|---|---|
| From: | "Atreides" |
| Date: | 25 Oct 2006 21:10:52 -0700 |
| Newsgroups: | sci.logic |
F is a set of sentences: { A_1, A_2, ...} s.t. {A_1 .. A_i} |/= A_i+1 (
A_i+1 is not a logical consequence of previous A_i's). How to prove
that F is NOT finite axiomatizable?
Any ideas or hints?
Can we do something like this - get every finite T, add it's elements
to F and suppose that this property still holds?
|
| <Prev in Thread] | Current Thread | [Next in Thread> |
|---|---|---|
| ||
| Previous by Date: | Re: The Modified Halting Problem, Take ??? ., Stephen Harris |
|---|---|
| Next by Date: | Re: Proof of finite axiomatizability, William Elliot |
| Previous by Thread: | Question about Quine's New Foundations, lugita15 |
| Next by Thread: | Re: Proof of finite axiomatizability, William Elliot |
| Indexes: | [Date] [Thread] [Top] [All Lists] |