I’d be interested in reading what you come up with once you’re ready to share it.
One thing you might consider is whether sigma-completeness is really necessary, or whether a weaker concept will do. One can argue that, from the perspective of constructing a logical system, only computable countable unions are of interest, rather than arbitrary countable unions.
I’d be interested in reading what you come up with once you’re ready to share it.
One thing you might consider is whether sigma-completeness is really necessary, or whether a weaker concept will do. One can argue that, from the perspective of constructing a logical system, only computable countable unions are of interest, rather than arbitrary countable unions.