Finitely axiomatized fragment of first-order Peano arithmetic that is recursively incompletable (in the sense of Gödel’s incompleteness theorems) and essentially undecidable
finie aksiomigebla fragmento de unuaorda aritmetiko de Peano, kiu estas esence nedecidebla kaj rikure nekompletigebla (eo)
finitely axiomatized fragment of first-order Peano arithmetic that is recursively incompletable (in the sense of Gödel’s incompleteness theorems) and essentially undecidable (en)
Authors tend to use slightly different but closely related versions of Q, so it would be helpful to explain more clearly the claim that the finite fragment of PA formed from PA with the induction schema removed is not the same as Q . (en)