[FOM] Really Large Infinitary Languages
urquhart at cs.toronto.edu
Sat Nov 22 16:25:26 EST 2014
I don't quite understand this question. If you are working
in NBG set theory, then you might write the conjunction
of a proper class C of propositions as the ordered pair
< &,C >, let's say.
But then C would be a member of a class, which is impossible
in NBG. So, the formulation of the question is not
clear to me.
On Sat, 22 Nov 2014, Guillermo Badia wrote:
> Max Dickmann's book "Large Infinitary Languages" contains a discussion of
>> proper class sized Infinitary languages.
>> -- John Bell
> Thanks a lot. In what section exactly? I haven't find it. Please note
> that I don't mean languages with a proper class of formulas, but
> languages with conjunctions and quantifications of proper class size.
More information about the FOM