The Complexity of Satisfaction Problems in Reverse Mathematics

Computability - Netherlands
doi 10.3233/com-150034