1![S22-2005 data set: Results with infinite non-bonded cut-offs H-bonding ME MUE RMSE S22-2005 data set: Results with infinite non-bonded cut-offs H-bonding ME MUE RMSE](https://www.pdfsearch.io/img/1379e1bad5e47628125d4102ff7111ca.jpg) | Add to Reading ListSource URL: www-jmg.ch.cam.ac.ukLanguage: English - Date: 2008-06-22 17:41:56
|
---|
2![JSCH-2005 data set: Results with infinite non-bonded cut-offs H-bonding ME MUE RMSE JSCH-2005 data set: Results with infinite non-bonded cut-offs H-bonding ME MUE RMSE](https://www.pdfsearch.io/img/7fdf5af8f3e835d2324c4d2010c4749b.jpg) | Add to Reading ListSource URL: www-jmg.ch.cam.ac.ukLanguage: English - Date: 2008-12-06 14:53:14
|
---|
3![APPROXIMATING THE FIRST L2 -BETTI NUMBER OF RESIDUALLY FINITE GROUPS arXiv:1011.4739v2 [math.GR] 16 Dec 2010 ¨ APPROXIMATING THE FIRST L2 -BETTI NUMBER OF RESIDUALLY FINITE GROUPS arXiv:1011.4739v2 [math.GR] 16 Dec 2010 ¨](https://www.pdfsearch.io/img/0c9b48b893ca94f4520864b580f8612b.jpg) | Add to Reading ListSource URL: 131.220.77.52Language: English - Date: 2016-01-10 05:46:25
|
---|
4![A proof of the Markov-Kakutani fixed point theorem via the Hahn-Banach theorem Dirk Werner S. Kakutani, in [2] and [3], provides a proof of the Hahn-Banach theorem A proof of the Markov-Kakutani fixed point theorem via the Hahn-Banach theorem Dirk Werner S. Kakutani, in [2] and [3], provides a proof of the Hahn-Banach theorem](https://www.pdfsearch.io/img/9618aa1838d40558261724bde01db3e4.jpg) | Add to Reading ListSource URL: page.mi.fu-berlin.deLanguage: English - Date: 2012-11-07 06:37:38
|
---|
5![Research Statement: Casey Donoven The Cantor space is the set of all infinite sequences over a finite alaphabet X, which is a both a topological and metric space. My research to date has focused on studying structures re Research Statement: Casey Donoven The Cantor space is the set of all infinite sequences over a finite alaphabet X, which is a both a topological and metric space. My research to date has focused on studying structures re](https://www.pdfsearch.io/img/a3e180750d03ea0eaafd020c8ebf08af.jpg) | Add to Reading ListSource URL: www-groups.mcs.st-and.ac.ukLanguage: English - Date: 2015-12-01 05:36:42
|
---|
6![BROWN’S LEMMA IN SECOND-ORDER ARITHMETIC EMANUELE FRITTAION Abstract. We show that Brown’s lemma is equivalent to IΣ02 over RCA∗0 . We also show that (the infinite) van der Waerden’s theorem is equivalent to BΣ BROWN’S LEMMA IN SECOND-ORDER ARITHMETIC EMANUELE FRITTAION Abstract. We show that Brown’s lemma is equivalent to IΣ02 over RCA∗0 . We also show that (the infinite) van der Waerden’s theorem is equivalent to BΣ](https://www.pdfsearch.io/img/8769e44c4b97490ea9bbbf887a092747.jpg) | Add to Reading ListSource URL: www.math.tohoku.ac.jpLanguage: English - Date: 2016-02-20 21:08:30
|
---|
7![OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS LUDOVIC PATEY Abstract. Ramsey’s theorem states that for any coloring of the n-element subsets of N with finitely many colors, there is an infinite set OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS LUDOVIC PATEY Abstract. Ramsey’s theorem states that for any coloring of the n-element subsets of N with finitely many colors, there is an infinite set](https://www.pdfsearch.io/img/a404a4dedb9d96178b06de6016fa15bf.jpg) | Add to Reading ListSource URL: ludovicpatey.comLanguage: English - Date: 2015-10-26 09:24:01
|
---|
8![. . Recursion Theoretic Methods in Descriptive Set Theory and Infinite Dimensional Topology . . Recursion Theoretic Methods in Descriptive Set Theory and Infinite Dimensional Topology](https://www.pdfsearch.io/img/345adc92b78f7ca7c1b5ac1d2b308f64.jpg) | Add to Reading ListSource URL: logic.berkeley.edu.Language: English - Date: 2016-01-02 23:13:27
|
---|
9![2701: a number of rare distinction Introduction Within the infinite set of whole numbers we find just one which overshadows all others in respect of its many remarkable properties. However, before we can begin to explain 2701: a number of rare distinction Introduction Within the infinite set of whole numbers we find just one which overshadows all others in respect of its many remarkable properties. However, before we can begin to explain](https://www.pdfsearch.io/img/3849bd2ffc0d5c2151121159d318cf39.jpg) | Add to Reading ListSource URL: www.whatabeginning.comLanguage: English - Date: 2015-08-18 03:42:34
|
---|
10![Π01 ENCODABILITY AND OMNISCIENT REDUCTIONS BENOIT MONIN AND LUDOVIC PATEY Abstract. A set of integers A is computably encodable if every infinite set of integers has an infinite subset computing A. By a result of Solova Π01 ENCODABILITY AND OMNISCIENT REDUCTIONS BENOIT MONIN AND LUDOVIC PATEY Abstract. A set of integers A is computably encodable if every infinite set of integers has an infinite subset computing A. By a result of Solova](https://www.pdfsearch.io/img/3cfcb97c4c06816b6b5ee925ead93fb5.jpg) | Add to Reading ListSource URL: ludovicpatey.comLanguage: English - Date: 2016-03-08 13:28:28
|
---|