Recent content by jk1234

I never mentioned that I had a database, because I do not. I do not even have the luxury of a programming language. I must describe this using only mathematics, because it is part of a formal sprecification. So, to re-iterate: I have the two predefined functions, and the output from the first...

Ok, I will try to provide more information without too much detail. I have a pre-defined function called members, as follows, members : Group -> P (Name x Date) where Group represents a particular group Name represents the name of the member Date represents the year they joined...

Feel free to state the obvious. ;)

True, but I have a problem defining a suitable set comprehension. For example, suppose I have the set containing the following: {Mary, Fred, Alice, Jack, Bob} I now want that set converted to an equivalent sequence: <Mary, Fred, Alice, Jack, Bob> If I could iterate over the set...

Many thanks for the responses, but I think I should provide more information. I am doing this as part of a formal software engineering task, which means I must adhere to set theory. In simple terms, we have set comprehension, which allows me to describe a set of elements using a function...

I have a set of pairs (NAME X DATE) that are returned from a pre-defined function, Member. I want to convert this to a sequence, such that the earliest DATE is first in the order. After spend too much time on this, I would like to ask the group what is the best way to convert the set...