UNDAUNTED SET S (F)xtended Abstract) * Varol Akma n Dept . of Computer Engineerin g Bilkent University Bilkent, Ankara 06533 Turkey "Sets arise out of the interaction of thinking creatures and the world about them . " --Jon Barwise (1988 ) Recently, there has been a great surge of interest in set theory . Space doesn 't permit us t o give a thorough overview but the following citations must be made . A remarkable invention o f Parikh, modestly called "dumb-founded sets, " is receiving considerable attention, especiall y in the logic of political sciences . Similarly, by now everybody knows that the " situations " of Barwise and Perry would be in real trouble were it not for the strong assistance of Aczel 's non-well-founded sets or hypersets, as they are commonly known . Encouraged by all these, we have come up with a . new flavor of sets which we choose t o call "undaunted sets " (UND) . Our sets are undaunted in a rather strong sense, viz . they can model anything and everything ; they are neither discouraged nor dismayed by the difficult y of the task at hand . (Aside :
/lp/association-for-computing-machinery/undaunted-sets-extended-abstract-MgRqME4GGq