Re: Proof of finite axiomatizability

[David C. Ullrich]

On 25 Oct 2006 21:10:52 -0700, "Atreides" <gpekhimenko@xxxxxxxxx>
wrote:

>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?

Why do you think that follows? There are very simple counterexamples.

>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?


************************

David C. Ullrich