Abstract
Abstract The product of two $\textbf {Alt}$ logics possesses the polynomial product finite model property and its membership problem is $\textbf {coNP}$-complete. Using a reduction from an undecidable domino-tiling problem, we prove that its admissibility problem is undecidable.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
