Computability of admissibility in the product of two Alt logics
Résumé
The product of two Alt logics possesses the polynomial product finite model property and its membership problem is coNP-complete. Using a reduction from an undecidable domino-tiling problem, we prove that its admissibility problem is undecidable.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|