The Pseudo-Skolem Problem is Decidable

Julian D'Costa, Toghrul Karimov, Rupak Majumdar, Joël Ouaknine, Mahmoud Salamati, Sadegh Soudjani, James Worrell 0001. The Pseudo-Skolem Problem is Decidable. In Filippo Bonchi, Simon J. Puglisi, editors, 46th International Symposium on Mathematical Foundations of Computer Science, MFCS 2021, August 23-27, 2021, Tallinn, Estonia. Volume 202 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. [doi]

Authors

Julian D'Costa

This author has not been identified. Look up 'Julian D'Costa' in Google

Toghrul Karimov

This author has not been identified. Look up 'Toghrul Karimov' in Google

Rupak Majumdar

This author has not been identified. Look up 'Rupak Majumdar' in Google

Joël Ouaknine

This author has not been identified. Look up 'Joël Ouaknine' in Google

Mahmoud Salamati

This author has not been identified. Look up 'Mahmoud Salamati' in Google

Sadegh Soudjani

This author has not been identified. Look up 'Sadegh Soudjani' in Google

James Worrell 0001

This author has not been identified. Look up 'James Worrell 0001' in Google