2000 character limit reached
Freely adding one layer of quantifiers to a Boolean doctrine
Published 18 Oct 2024 in math.LO and math.CT | (2410.16328v1)
Abstract: We show how to freely add the first layer of quantifier alternation depth to a Boolean doctrine over a small base category. This amounts to a doctrinal version of Herbrand's theorem for formulas with quantifier alternation depth at most one modulo a universal theory. To achieve this, we characterize, within the doctrinal setting, the classes of quantifier-free formulas for which there is a model such that is precisely the class of formulas whose universal closure is valid in .
Paper Prompts
Sign up for free to create and run prompts on this paper.