Computing the effectively computable bound in Baker's inequality for linear forms in logarithms, and: Multiplicative relations in number fields: Corrigenda and addenda

Publisher： Cambridge University Press

E-ISSN： 1755-1633|17|1|151-155

ISSN： 0004-9727

Source： Bulletin of the Australian Mathematical Society, Vol.17, Iss.1, 1977-08, pp. : 151-155

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Computing the effectively computable bound in Baker's inequality for linear forms in logarithms

By  

Bulletin of the Australian Mathematical Society, Vol. 15, Iss. 1, 1976-08 ,pp. : 33-57

Cambridge University Press

Access to resources Recommend Favorite

Multiplicative relations in number fields

By  

Bulletin of the Australian Mathematical Society, Vol. 16, Iss. 1, 1977-02 ,pp. : 83-98

Cambridge University Press

Access to resources Recommend Favorite

A note on computable real fields

By  

The Journal of Symbolic Logic, Vol. 35, Iss. 2, 1970-06 ,pp. : 239-241

Cambridge University Press

Access to resources Recommend Favorite

Weak presentations of computable fields

By  

The Journal of Symbolic Logic, Vol. 60, Iss. 1, 1995-03 ,pp. : 199-208

Cambridge University Press

Access to resources Recommend Favorite

Isomorphism relations on computable structures

By  

The Journal of Symbolic Logic, Vol. 77, Iss. 1, 2012-03 ,pp. : 122-132

Cambridge University Press

Access to resources Recommend Favorite