In a recursively axiomatized theory such as PA, are there undecidable statements that are arithmetically true but which are mutually independent ? I.e. are there two statements A and B that are each undecidable from the axioms and where neither is deducible from the other ?