Undecidability of admissibility in the product of two Alt logics - Logique, Interaction, Langue et Calcul Access content directly
Journal Articles Logic Journal of the IGPL Year : 2023

Undecidability of admissibility in the product of two Alt logics

Abstract

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.
Fichier principal
Vignette du fichier
Admissibility_in_Alt1_Alt1_10.pdf (249.26 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-04307720 , version 1 (26-11-2023)

Identifiers

Cite

Philippe Balbiani, Cigdem Gencer. Undecidability of admissibility in the product of two Alt logics. Logic Journal of the IGPL, 2023, ⟨10.1093/jigpal/jzad021⟩. ⟨hal-04307720⟩
77 View
2 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More