Coherent theory 2026-10-06
A coherent theory is a first-order signature with a set of coherent sequents as axioms. It has a coherent syntactic category containing a conservative syntactic model. Theories of groups, rings and integral domains admit coherent axiomatizations.
Conservative syntactic model 2026-10-06
The canonical model interprets each sort as its truth-context object, each operation by its term graph and each relation by its atomic subobject. A coherent formula is interpreted by its own formula-in-context object. Consequently a coherent sequent holds in this model exactly when it is derivable in the theory.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 20 3 Solution Created 2026-10-03 Updated 2026-10-06
A first-order signature specifies sorts, function symbols with specified input and output sorts, and relation symbols with specified input sorts. A coherent formula is built from atomic relations and equalities using , , finite logical conjunctions, finite logical disjunctions, and existential quantification. A coherent theory is a set of sequents between coherent formulas in a common finite context; its axioms are interpreted as universally closed implications. Neither general negation nor universal quantification is allowed inside coherent formulas.
One complete presentation of coherent logic consists of the following axiom and rule schemes, together with the theory's sequents. All displayed formulas have compatible sorts and contexts, and bound variables can be renamed.
Identity and cut give andSubstitution replaces the free variables of any derivable sequent by well-typed terms, avoiding capture. Contexts can be enlarged by unused variables, and permuted or renamed.
The finite-meet rules are , , , andThe finite-join rules are , , , andInclude distributivity .
Existential introduction is . Existential elimination iswhere is absent from . Equivalently, the quantifier is left adjoint to weakening along the context projection. Include the Frobenius rule in coherent logicIt can also be derived from the usual coherent natural-deduction rules.
Equality has and the substitution schemeincluding atomic formulas and terms of the signature. Symmetry, transitivity and congruence for all functions and relations follow. These schemes impose no unintended inhabitedness axiom on a sort.
The coherent syntactic category has objects formulas in context , up to renaming. An arrow from to is an equivalence class, modulo provable equivalence, of formulas satisfyingandThese are provably total functional relations. The identity is the equality graph restricted by . If and are consecutive arrows, their composite is represented by . Equality, cut and existential rules give the category laws.
A coherent category has finite limits, pullback-stable regular-epi/mono image factorizations, and finite unions of subobjects stable under pullback. We verify these structures syntactically. The terminal object is the empty-context truth formula. Products conjoin formulas in disjoint contexts; equalizers add equality of the two output tuples. For a functional relation , its image in the target is represented by . Its factor onto that image is regular epic: two arrows out of the image agreeing on the source agree by existential elimination, and the same argument with the kernel pair gives the coequalizer property. Frobenius makes these image factorizations stable under pullback.
Every subobject of is represented by a formula with . Indeed, take the existential image of a monic functional relation; uniqueness makes its map to that image an isomorphism. Subobject inclusion is exactly provable implication. Finite unions are consequently disjunctions, with bottom as the empty subobject; distributivity and substitution make them pullback-stable. Hence is coherent.
The conservative syntactic model interprets a sort by , a function by its term graph, and a relation by its atomic-formula subobject. Induction on coherent formulas shows that is interpreted by the subobject of its context object. It satisfies every theory axiom by construction. Conversely, a sequent holds in this model exactly when the corresponding subobject inclusion holds, which is exactly derivability in . ThereforeThis is conservativity for coherent sequents, not a claim about non-coherent formulas.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 20 6 ii Solution Created 2026-10-03 Updated 2026-10-06
Take to be the category of finitely presented commutative rings with identity, and put . In its presheaf topos, the tautological ring is generic. The additional domain axioms are coherent sequents, so they are imposed by a quotient-theory coverage on .
Concretely, declare the zero ring covered by the empty family. For every finitely presented and elements with , declare the two opposite quotient arrows associated withto be a covering family at . These quotient rings are finitely presented. Pullback and transitivity generate a Grothendieck topology from these families. The empty cover forbids ; the two quotient covers make every zero product locally have a zero factor. Conversely, any internal integral domain satisfies exactly the continuity conditions prescribed by these generating covers. Thusand its generic domain is the associated sheaf , with the ring operations transported through the left-exact sheaf reflector.
This coverage is not standard, meaning not all representables are sheaves; in modern terminology it is not subcanonical. For an explicit obstruction, use and . The two quotient arrows are the same map , so their generated sieve is a singleton cover. Consider the representable on corresponding to :Its distinct sections and become equal after restriction to . Hence this representable is not even separated for . The nilpotent element has to disappear in the generic domain, which explains this failure of standardness.