The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Let be the ring of integer valued polynomials over . This ring is known to be a Prüfer domain. But it seems there does not exist an algorithm for inverting a nonzero finitely generated ideal of . In this note we show how to obtain such an algorithm by deciphering a classical abstract proof that uses localisations of at all prime ideals of . This confirms a general program of deciphering abstract classical proofs in order to obtain algorithmic proofs.
Download Results (CSV)