Predicate Transformers, (co)Monads and Resolutions

Details Predicate Transformers, (co)Monads and Resolutions Predicate Transformers, (co)Monads and Resolutions

2009-06-16

arxiv.org/abs/0906.2866v1

Computer Science

Logic in Computer Science

Scientific paper

This short note contains random thoughts about a factorization theorem for closure/interior operators on a powerset which is reminiscent to the notion of resolution for a monad/comonad. The question originated from formal topology but is interesting in itself. The result holds constructively (even if it classically has several variations); but usually not predicatively (in the sense that the interpolant will no be given by a set). For those not familiar with predicativity issues, we look at a ``classical'' version where we bound the size of the interpolant.

Affiliated with

Also associated with

No associations

Rating

Predicate Transformers, (co)Monads and Resolutions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Predicate Transformers, (co)Monads and Resolutions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Predicate Transformers, (co)Monads and Resolutions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-475485