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.
To model classical linear logic, you need a ∗-autonomous category with finite products and a linear exponential comonad. What kind of category also supports quantifiers without bringing in the full power of a topos?
I'd imagine something like a linear hyperdoctrine.
Although to get first-order logic you may want the fibres to be thin
But there's no reason why you can't have a hyperdoctrine where there fibres aren't thin, instead giving something more like a dependent type theory
Thanks, that's just what I was looking for.