Computability logic - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2007-02-14 02:18:04 Proof theory Mathematical logic Diophantine set Computability theory Theory of computation Polynomial Recursively enumerable set Number theory Decidability Mathematics Logic Diophantine equations		Add to Reading List Source URL: math.nju.edu.cn Download Document from Source Website File Size: 104,84 KB Share Document on Facebook

	The set of non-n-th powers in a number field is diophantine Joint work with Jan Van Geel (Gent) Jean-Louis Colliot-Th´el`ene (CNRS et Universit´e Paris-Sud, Orsay) Second ERC Research period on Diophantine Geometry Cet DocID: 1sLMo - View Document
	From Discrepancy to Declustering: Near-optimal multidimensional declustering strategies for range queries [Extended Abstract] Chung-Min Chen DocID: 1renq - View Document
	The set of non-n-th powers in a number field is diophantine Joint work with Jan Van Geel (Gent) Jean-Louis Colliot-Th´el`ene (CNRS et Universit´e Paris-Sud, Orsay, visiting BICMR) Capital Normal University DocID: 1qSlQ - View Document
	ALGEBRAIC STRUCTURE AND DEGREE REDUCTION Let S ⊂ Fn . We define deg(S) to be the minimal degree of a non-zero polynomial that vanishes on S. We have seen that for a finite set S, deg(S) ≤ n\|S\|1/n . In fact, we can sa DocID: 1nUp8 - View Document
	Recent results on Diophantine quintuples Alan Filipin Građevinski fakultet, Sveučilište u Zagrebu A set of m positive integers with the property that the product of any two of them increased by 1 is a perfect square i DocID: 1nP2q - View Document