A note on the number of zeros of polynomials and exponential polynomials

Journal of Symbolic Logic 42 (1):99-106 (1977)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,642

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

A Note on Exponential Polynomials and Prime Factors.Rod McBeth - 1981 - Mathematical Logic Quarterly 27 (13‐14):213-214.
A note on the decidability of exponential terms.Paola D'Aquino & Giuseppina Terzo - 2007 - Mathematical Logic Quarterly 53 (3):306-310.
Consequences of Schanuel's condition for zeros of exponential terms.Helmut Wolter - 1993 - Mathematical Logic Quarterly 39 (1):559-565.
Fundamental Sequences for Exponential Polynomials.Rod McBeth - 1980 - Mathematical Logic Quarterly 26 (7‐9):115-122.
Fundamental Sequences for Exponential Polynomials.Rod McBeth - 1980 - Mathematical Logic Quarterly 26 (7-9):115-122.
Exponential Polynomials of Linear Height.Rod McBeth - 1980 - Mathematical Logic Quarterly 26 (25-27):399-404.
A logician's view of graph polynomials.J. A. Makowsky, E. V. Ravve & T. Kotek - 2019 - Annals of Pure and Applied Logic 170 (9):1030-1069.
A Note on Exponential Polynomials and Prime Factors.Rod McBeth - 1981 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 27 (13-14):213-214.
Infinite Boolean Polynomials I.H. Gaifman & A. W. Hales - 1967 - Journal of Symbolic Logic 32 (1):131-132.

Analytics

Added to PP
2009-01-28

Downloads
15 (#244,896)

6 months
31 (#500,116)

Historical graph of downloads
How can I increase my downloads?

References found in this work

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
Les Fonctions combinatoires et les Isols.J. C. E. Dekker - 1972 - Journal of Symbolic Logic 37 (2):406-406.

Add more references