The following types form the primitive notions which, in this wiki, are not formally defined in terms of other concepts. Nevertheless, their possible axiomatics are discussed in entries of type Framework.

• ${\mathfrak D}_\mathrm{Propositions}$ … Propositions
• ${\mathfrak D}_\mathrm{Sets}$ … Sets
• ${\mathfrak D}_{\to}$ … Functions
• ${\mathfrak D}_\mathrm{Cats}$ … Categories
• ${\mathfrak D}_{\longrightarrow}$ … Functors
• ${\mathfrak D}_{\xrightarrow{\bullet}}$ … Natural transformations
• ${\mathfrak D}_\mathrm{Tuples}$ … Tuples, finite lists of elements of the above sorts
• ${\mathfrak D}_\mathrm{Collections}$ … Collections, ad hoc subclasses of the above sorts (I use this as in some sort of naive set theory)

I also use those to classify the bulk of other entries in the wiki. There are also a minority of entries of type Type, as in type theory. They need not be part of the above framework.

All Set entry definitions are purposely free from terms of the other domains, except for functions and tuples of sets (though tuples and also the functions we consider can just as well be modeled within a set theory, so that's just for clarity.). In this way, the set entries in this wiki can e.g. be interpreted as defining object within formal ZFC.

todo: summarize how some of them can be thought of a special cases of others

Logic, Type theory