Undecidability of admissibility in the product of two Alt logics - Intelligence Artificielle 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.
Embargoed file
Embargoed file
0 1 28
Year Month Jours
Avant la publication
Friday, April 26, 2024
Embargoed file
Friday, April 26, 2024
Please log in to request access to the document

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⟩
57 View
2 Download

Altmetric

Share

Gmail Facebook X LinkedIn More