Papers
Topics
Authors
Recent
Search
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 AA of quantifier-free formulas for which there is a model MM such that AA is precisely the class of formulas whose universal closure is valid in MM.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Tweets

Sign up for free to view the 2 tweets with 1 like about this paper.