Infinite set

Results: 72



#Item
1S22-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

Add to Reading List

Source URL: www-jmg.ch.cam.ac.uk

Language: English - Date: 2008-06-22 17:41:56
    2JSCH-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

    Add to Reading List

    Source URL: www-jmg.ch.cam.ac.uk

    Language: English - Date: 2008-12-06 14:53:14
      3APPROXIMATING 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 ¨

      Add to Reading List

      Source URL: 131.220.77.52

      Language: English - Date: 2016-01-10 05:46:25
      4A 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

      Add to Reading List

      Source URL: page.mi.fu-berlin.de

      Language: English - Date: 2012-11-07 06:37:38
      5Research 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

      Add to Reading List

      Source URL: www-groups.mcs.st-and.ac.uk

      Language: English - Date: 2015-12-01 05:36:42
      6BROWN’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Σ

      Add to Reading List

      Source URL: www.math.tohoku.ac.jp

      Language: English - Date: 2016-02-20 21:08:30
      7OPEN 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

      Add to Reading List

      Source URL: ludovicpatey.com

      Language: 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

      Add to Reading List

      Source URL: logic.berkeley.edu.

      Language: English - Date: 2016-01-02 23:13:27
        92701: 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

        Add to Reading List

        Source URL: www.whatabeginning.com

        Language: 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

          Add to Reading List

          Source URL: ludovicpatey.com

          Language: English - Date: 2016-03-08 13:28:28