Nonstandard arithmetic of Hilbert subsets

Annals of Pure and Applied Logic 52 (1-2):195-202 (1991)
  Copy   BIBTEX

Abstract

Let f ϵ Z [ X, Y ] be irreducible. We give a condition that there are only finitely many integers n ϵ Z such that f is reducible and we give a bound for such integers. We prove a similar result for polynomials with coefficients in polynomial rings. Both results are proved by, so-called, nonstandard arithmetic

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,809

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

Nonstandard arithmetic and recursive comprehension.H. Keisler - 2010 - Annals of Pure and Applied Logic 161 (8):1047-1062.
Nonstandard arithmetic and recursive comprehension.H. Jerome Keisler - 2010 - Annals of Pure and Applied Logic 161 (8):1047-1062.
On a Question of Phillips.Çiǧdem Gencer & Mehmet Terziler - 1997 - Mathematical Logic Quarterly 43 (1):78-82.
Tennenbaum's Theorem and Unary Functions.Sakae Yaegasi - 2008 - Notre Dame Journal of Formal Logic 49 (2):177-183.
Constructive compact operators on a Hilbert space.Hajime Ishihara - 1991 - Annals of Pure and Applied Logic 52 (1-2):31-37.
Inconsistent nonstandard arithmetic.Chris Mortensen - 1987 - Journal of Symbolic Logic 52 (2):512-518.

Analytics

Added to PP
2014-01-16

Downloads
16 (#1,187,304)

6 months
8 (#574,086)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

The Trend of Logic and Foundation of Mathematics in Japan in 1991 to 1996.Yuzuru Kakuda, Kanji Namba & Nobuyoshi Motohashi - 1997 - Annals of the Japan Association for Philosophy of Science 9 (2):95-110.

Add more citations

References found in this work

Add more references