$\newcommand\FinSet{\mathit{FinSet}}\newcommand\FinBool{\mathit{FinBool}}\newcommand\FreeFinBool{\mathit{FreeFinBool}}\newcommand\Set{\mathit{Set}}\newcommand\Psh{\mathit{Psh}}$It's [well-known](https://ncatlab.org/nlab/show/generic+interval#remark) that the topos of presheaves on the category $\FinSet$ of finite sets is the classifying topos for boolean algebra objects.


The argument goes like this: By Stone duality, the functor $n \mapsto 2^n$ is an equivalence of categories $\FinSet \simeq \FinBool^{\text{op}}$, where $\FinBool$ is the category of finite Boolean algebras, which are necessarily projective (so we may use $\FinBool$ and $\FreeFinBool$, which is dual to the category $\FinSet\_{2^\bullet}$ of sets with cardinality a finite power of $2$, pretty much interchangeably). Since the theory of Boolean algebras is a finitary algebraic theory, finite-product-preserving functors $\FinBool^{\text{op}} \to \mathcal E$ are identified with Boolean algebra objects in $\mathcal E$, for any category $\mathcal E$ with finite products and split idempotents. If $\mathcal E = \Set$, then any finite-product-preserving functor $\FinBool \to \Set$ is automatically [flat](https://ncatlab.org/nlab/show/flat+functor#valued_functors); the proof uses the fact that every finitely-presentable Boolean algebra is projective. So a geometric morphism $\Psh(\FinSet\_{\neq \emptyset}) \to \Set$ is just a Boolean algebra. Then because $\Psh(\FinSet\_{\neq \emptyset})$ is a presheaf topos and the theory of Boolean algebras is algebraic, this classifying topos identification extends to all Grothendieck toposes $\mathcal E$.




---


But what happens when we perturb the input a bit? For example, what happens when we consider presheaves on the category $\FinSet\_\ast$ of finite *pointed* sets? The category $\FinSet\_\ast^{op}$ is the idempotent completion of a Lawvere theory $\mathcal T = \FinSet\_{\ast,2^\bullet}$ with half as many operations of each arity as the Lawvere theory for Boolean algebras ($2^{2^n - 1}$ instead of $2^{2^n}$). Indeed, by identifying the basepoint of a finite pointed set with $\top$, we can regard $\mathcal T$ as the Lawvere theory whose $n$-ary operations are all Boolean algebra homomorphisms $f: 2^n \to 2^1$ such that $f(\top,\dotsc,\top) = \top$ — i.e. if all inputs are true, the output must also be true. I believe that $\mathcal T$ is generated by the operations $\top, \wedge, \vee, \to$, but I'm not sure what a complete set of relations would be.


As a Lawvere theory, $\mathcal T$ may be rather messy. But we're considering something more refined: a finite-product-preserving functor $A: \mathcal T \to \Set$ is *not* automatically flat. Flatness is equivalent to requiring that $A$ is a filtered colimit of finitely-generated free algebras. In particular, every finitely-generated subalgebra of $A$ is a subalgebra of a finitely-generated free algebra. It follows that $A$ will satisfy any universal statement satisfied by all finitely-generated free $\mathcal T$-algebras — not just the algebraic ones. I think (but I'm not certain) that the converse is also true — so that $A$ is flat *if and only if* it satisfies the universal theory of free $\mathcal T$-algebras.


**Questions:**


1. What is an axiomatization of the algebraic theory of the logical connectives $\top, \wedge, \vee, \to$ (i.e. the algebraic theory of connectives $f$ such that $f(\top, \dotsc, \top) = \top$, i.e. the equational theory of the structures $\{\top,\bot\}^n$, in the language $(\top,\wedge,\vee,\to)$)?
2. What is an axiomatization of the universal theory of these logical connectives (i.e.— I think — the theory classified by the presheaf topos $\Psh(\FinSet\_\ast)$, i.e. the universal theory of the structures $\{\top,\bot\}^n$, in the language $(\top,\wedge,\vee,\to)$)?
3. How do these theories compare to the theory of Boolean algebras — what are some examples of algebras or algebra homomomorphisms which don't come from Boolean algebras or homomorphisms thereof? Is there a form of Stone duality for these algebras, and how do the corresponding spaces compare to Stone spaces?




---


More fundamental than the presheaf toposes $\Psh(\FinSet)$ and $\Psh(\FinSet\_\ast)$ are the presheaf toposes $\Psh(\FinSet^{\text{op}})$ and $\Psh(\FinSet\_\ast^{\text{op}})$ which classify objects and pointed objects respectively. Unfortunately, these facts don't seem to shed much light on the less fundamental toposes I'm interested in here. For instance, it doesn't seem to be the case that the tensor product of the Lawvere theories $\FinSet^{\text{op}}\_\ast$ and $\FinSet$ is $\FinSet\_\ast$ — I believe that tensor product is just the terminal Lawvere theory (note that the "op"'s for the Lawvere theories are reversed from the "op"'s for the presheaf categories).




---


The operations $(\top,\wedge,\vee,\to)$ being considered here are *almost* the same as the operations of a Heyting algebra — the difference being that a Heyting algebra has a constant $\bot$ as well. So, based on the [axioms for a Heyting algebra](https://en.wikipedia.org/wiki/Heyting_algebra#Bounded_lattice_with_an_implication_operation), here are some guesses:


**Guess for (1):** The following algebraic axioms, which are satisfied (thanks to Andreas Blass for catching a mistake in the comments below!), might be a complete set of algebraic axioms:


* $(\top,\wedge,\vee)$ form an upper-bounded distributive lattice;
* $x \to x = \top$;
* $x \wedge (x \to y) = x \wedge y$; $y \wedge (x \to y) = y$;
* $x \to (y \wedge z) = (x \to y) \wedge (x \to z)$;
* $(x \vee y) \to z = (x \to z) \wedge (y \to z)$.


As pointed out by მამუკა ჯიბლაძე in the comments below, we also need the following axiom which goes beyond the Heyting axioms, and is equivalent to the interval $[y,\top]$ being a Boolean algebra with $(-) \to y$ for negation:


* $x \vee (x \to y) = \top$



Stone duality for the algebra of Boolean functions such that $f(\top,\dots,\top) = \top$, or: What does the presheaf topos on $FinSet_\ast$ classify?
I might be missing something, but I think you are overcomplicating things.


I clain that your topos classifies the theory $T$ of pairs $(B,\phi)$ where $B$ is a boolean algebra and $\phi : B \to \{0,1\}$ is a boolean algebra morphism.


Indeed, this theory is given by a finite limit sketch, so it is classified by the the category of presheaf on the opposite of the category of finitely presented $T$-models.


A $T$-model $(B,\phi)$ is finitely presented exactly when the boolean algebra $B$ is finite, hence the category of finitely presented $T$-model is equivalent to $FinSet\_\*$ by the duality between finite boolean algebra and finite sets.


The theory you describe in your "Guess" is an attempt at axiomatizing the properties fiber $\phi^{-1}(1)$ as an Heyting algebra. This is definitely possible as the negation induce a bijection between the two fiber $\phi^{-1}(0)$ and $\phi^{-1}(1)$ so you can reconstruct $B$ out of one of the fibers and you can express the fact that $B$ is a boolean algbera over $\{0,1\}$ in terms of these fibers.


