Two conjectures on the arithmetic in R and C

Mathematical Logic Quarterly 56 (2):175-189 (2010)
Download Edit this record How to cite View on PhilPapers
Abstract
Let G be an additive subgroup of ℂ, let Wn = {xi = 1, xi + xj = xk: i, j, k ∈ {1, …, n }}, and define En = {xi = 1, xi + xj = xk, xi · xj = xk: i, j, k ∈ {1, …, n }}. We discuss two conjectures. If a system S ⊆ En is consistent over ℝ , then S has a real solution which consists of numbers whose absolute values belong to [0, 22n –2]. If a system S ⊆ Wn is consistent over G, then S has a solution ∈ n in which |xj| ≤ 2n –1 for each j.
PhilPapers/Archive ID
TYSTCO-2
Revision history
First archival date: 2016-06-04
Latest version: 2 (2016-06-04)
View upload history
References found in this work BETA

Add more references

Citations of this work BETA

No citations found.

Add more citations

Added to PP index
2013-12-01

Total views
51 ( #30,607 of 39,686 )

Recent downloads (6 months)
21 ( #21,820 of 39,686 )

How can I increase my downloads?

Downloads since first upload
This graph includes both downloads from PhilArchive and clicks to external links.