A carregar...
Trakhtenbrot’s Theorem in Coq: A Constructive Approach to Finite Model Theory
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...
Na minha lista:
| Publicado no: | Automated Reasoning |
|---|---|
| Main Authors: | , |
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
2020
|
| Assuntos: | |
| Acesso em linha: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7324044/ https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/978-3-030-51054-1_5 |
| Tags: |
Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!
|