Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Trakhtenbrot's Theorem in Coq: Finite Model Theory through the
  Constructive Lens   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. To showcase an application of Trakhtenbrot's theorem, we continue
our reduction chain with a many-one reduction from FSAT to separation logic.
All our results are mechanised in the framework of a growing Coq library of
synthetic undecidability proofs.

15
The categories of this paper are: nucl-ex
22
The categories of this paper are: chao-dyn
12
The categories of this paper are: nucl-th
11
The categories of this paper are: hep-lat
10
The categories of this paper are: q-bio
37
The categories of this paper are: supr-con
27
The categories of this paper are: comp-gas
34
The categories of this paper are: chem-ph
35
The categories of this paper are: mtrl-th
6
The categories of this paper are: astro-ph
23
The categories of this paper are: solv-int
5
The categories of this paper are: gr-qc
8
The categories of this paper are: hep-ex
4
The categories of this paper are: cond-mat
31
The categories of this paper are: ao-sci
9
The categories of this paper are: nlin