A sequent calculus for skeptical reasoning in autopeistemic logic

Robert Saxon Milnikel
2004 Non-Monotonic Reasoning  
A sequent calculus for skeptical consequence in infinite autoepistemic theories is presented and proved sound and complete. While skeptical consequence is decidable in the finite case, the move to infinite theories increases the complexity of skeptical reasoning to being Π 1 1 -complete. This implies the need for sequent rules with countably many premises, and such rules are employed.
dblp:conf/nmr/Milnikel04 fatcat:zyy3jn7znrbqzg26qg6folnzpe