[FOM] Really Large Infinitary Languages

[Guillermo Badia]

 So, do you think it is impossible to have languages with conjunctions
of  proper classes of formulas? What about Kelley-Morse set theory?
There we have classes "representing" proper classes of proper classes.
Couldn't one build these languages in that context? Thanks very much
for your replies.

On 11/23/14, Guillermo Badia <guillebadia89 at gmail.com> wrote:
> On 11/23/14, Alasdair Urquhart <urquhart at cs.toronto.edu> wrote:
>> 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.
>>>
>>> Cheers
>>> Guillermo
>>
>> _______________________________________________
>> FOM mailing list
>> FOM at cs.nyu.edu
>> http://www.cs.nyu.edu/mailman/listinfo/fom
>>
>