DeepAI AI Chat
Log In Sign Up

Trakhtenbrot's Theorem in Coq, A Constructive Approach to Finite Model Theory

by   Dominik Kirst, et al.

We study finite first-order satisfiability (FSAT) in the constructive setting of dependent type theory. Employing synthetic accounts of enumerability and decidability, we give a full classification of FSAT depending on the first-order signature of non-logical symbols. On the one hand, our development focuses on Trakhtenbrot's theorem, stating that FSAT is undecidable as soon as the signature contains an at least binary relation symbol. Our proof proceeds by a many-one reduction chain starting from the Post correspondence problem. On the other hand, we establish the decidability of FSAT for monadic first-order logic, i.e. where the signature only contains at most unary function and relation symbols, as well as the enumerability of FSAT for arbitrary enumerable signatures. All our results are mechanised in the framework of a growing Coq library of synthetic undecidability proofs.


page 1

page 2

page 3

page 4


Trakhtenbrot's Theorem in Coq: Finite Model Theory through the Constructive Lens

We study finite first-order satisfiability (FSAT) in the constructive se...

A constructive proof of Skolem theorem for constructive logic

If the sequent (Gamma entails forall x exists y A) is provable in first ...

Amalgamation is PSPACE-hard

The finite models of a universal sentence Φ in a finite relational signa...

Parametric Church's Thesis: Synthetic Computability without Choice

In synthetic computability, pioneered by Richman, Bridges, and Bauer, on...

Splitting Proofs for Interpolation

We study interpolant extraction from local first-order refutations. We p...

Constructing Initial Algebras Using Inflationary Iteration

An old theorem of Adámek constructs initial algebras for sufficiently co...