You're reading the public-facing archive of the Category Theory Zulip server.
To join the server you need an invite. Anybody can get an invite by contacting Matteo Capucci at name dot surname at gmail dot com.
For all things related to this archive refer to the same person.
This is a sketch of some thoughts which I hope will be a warm-up to some more rigorous questions about set theory that I can write up hopefully later today. Let me know if you have any thoughts or critiques on what I say. Thank you.
The latter part of this seems to be hinting at the idea of the constructible hierarchy and Gödel’s constructible universe
Very interestong. One thing that I always wondered is that when we think about "things", do we implicitly assume that we can "reach", or "interact" with these "things"? (like with morphisms going in or out, and as you mentioned we can also see these interactions as "things".)
I think human behaviors are based on perception, so it probably doesn't make much sense to talk about "just a thing" without refering to specific kinds of interactions.
Another question I always have is that monad in Latin means "an elementary individual substance which reflects the order of the world and from which material properties are derived", maybe the discoverer/inventor of monad thinks "things" should automatically come with a binary operation? I don't quite understand why though.
I'd like to hear your thoughts on all of those questions, they also interest me as well!
This is just my next step forward in trying to basically define set theory in terms of free algebra, I think. It is in rough condition and I had help from an AI, but it is a step in the direction I want to go in.
I'd really like to discuss the formal definition of the constructible universe if anyone would like to.
https://en.wikipedia.org/wiki/Constructible_universe
Screenshot-2024-07-26-at-9.11.41AM.png
It appears that is a collection of sets, and elements of . I'm not sure if means a formula where the only constants are , or that it must have at least all of those constants? I think it says that this formula must hold true for set , and that is therefore the set of all elements of which satisfy any first-order formula! So maybe this is an example:
If is , then I think should be all sets which can be obtained from an application of an axiom of ZFC to . I am pretty sure all you can define is and the set stated to exist by the axiom of infinity:
Screenshot-2024-07-26-at-9.23.36AM.png
For the next stage, I believe we can create a lot more sets, because of the axiom of specification. I think we can specify subsets of using well-formed formulae. I think that we can order these formulae using something like a Gödel numbering. However, I think I am looking for a simpler numbering system than that.
I am now thinking of something which will help me in many situations regarding term algebras and free algebras, I think. For any algebraic signature with -ary relations, we can order the relations by their arity. If two relations have the same arity, we can choose an arbitrary order for them. Next, impose an arbitrary order for the generator elements for the algebra. For each arity , create the -fold product of the generators, which I believe has an inherent ordering. For each tuple in the product, apply the operation to create a new term.
This would allow you to biject the natural numbers to the term algebra, I believe. And it would allow you to define a "generation rank" for sets of terms - those constructed in stage 0, stage 1, stage 2, etc.
I look forward to exploring this idea further and making use of it!
@Julius Hamilton You have the behavior of a little bit wrong. is the set of all subsets of that are first-order definable in the structure with parameters. In particular, this means that is just going to be .
Thanks. Sorry for the delayed response, as I had turned my attention to others topics.