Does consistency of Peano arithmetic follow from arithmetical completeness of modal logic GL?

logic modal-logic

It appears that my question is a duplicate of this question. The answer is negative, because Solovay's proof of arithmetical completeness presupposes the consistency of Peano arithmetic.

Related

Showing that $x+x^2$ belongs to an ideal in $\mathbb{Z}_2[x]$
The elements of the centralizer of $A$ commute with all elements of $A\subseteq G$ and using this to prove that $C_G(A)$ includes inverses.
Power series of $1/(1-x-x^2)$
How do I configure RAID 5, especially stripe size, with 24 x 1.2 TB drives for CentOS 6?
Server Rack vs. Server in PC "Towers"
Puppet's automatically generated certificates failing
Are PHP session files ever deleted?
Expose docker containers to vpc network
Make consistent copy of maildir
Nginx reverse proxy error page
Nginx + Php5-fpm not rendering php files
Powershell Get-Process : Couldn't connect to remote machine