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 developmen...

Fuld beskrivelse

Bibliografiske detaljer

Principais autores:	Dominik Kirst, Dominique Larchey-Wendling
Format:	Artigo
Sprog:	Inglês
Udgivet:	Logical Methods in Computer Science e.V. 2022-06-01
Serier:	Logical Methods in Computer Science
Fag:	computer science - logic in computer science computer science - computation and language mathematics - logic
Online adgang:	https://lmcs.episciences.org/7422/pdf
Tags:	Tilføj Tag Ingen Tags, Vær først til at tagge denne postø!