"transfinitely" meaning in All languages combined

{
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "transfinitely (not comparable)",
      "name": "en-adv"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "adv",
  "related": [
    {
      "_dis1": "0 0",
      "word": "finitely"
    },
    {
      "_dis1": "0 0",
      "word": "infinitely"
    },
    {
      "_dis1": "0 0",
      "word": "transfinite"
    }
  ],
  "senses": [
    {
      "categories": [
        {
          "_dis": "98 2",
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w+disamb"
        },
        {
          "_dis": "95 5",
          "kind": "other",
          "name": "English entries with language name categories using raw markup",
          "parents": [
            "Entries with language name categories using raw markup",
            "Entry maintenance"
          ],
          "source": "w+disamb"
        },
        {
          "_dis": "95 5",
          "kind": "other",
          "name": "English entries with topic categories using raw markup",
          "parents": [
            "Entries with topic categories using raw markup",
            "Entry maintenance"
          ],
          "source": "w+disamb"
        },
        {
          "_dis": "60 40",
          "kind": "other",
          "langcode": "en",
          "name": "Infinity",
          "orig": "en:Infinity",
          "parents": [],
          "source": "w+disamb"
        }
      ],
      "examples": [
        {
          "ref": "1999, Thomas Strahm, “First Steps into Metapredictivity in Explicit Mathematics”, in S. Barry Cooper, John K. Truss, editors, Sets and Proofs, Cambridge University Press, page 399",
          "text": "We finish this section by briefly addressing how the reduction procedure for #x5C;mathsf#x7B;EMU#x7D; described so far can be formalized in the transfinitely iterated fixed point theory #x5C;widehat#x7B;#x5C;mathsf#x7B;ID_(<ε₀) of [18] in order to yield conservativity of mathsf EMU over widehat mathsf ID_(<ε₀) with respect to arithmetic statements.}}",
          "type": "quotation"
        },
        {
          "ref": "2003, Thomas Forster, Logic, Induction and Sets, Cambridge University Press, page 147",
          "text": "After we have performed the deletion operation infinitely many times, we can look at what is left and perform the deletion operation on that, and thereby continue the process transfinitely.",
          "type": "quotation"
        }
      ],
      "glosses": [
        "In a manner that requires a transfinite number of steps."
      ],
      "id": "en-transfinitely-en-adv-4WegCmdX",
      "links": [
        [
          "transfinite",
          "transfinite"
        ]
      ],
      "raw_glosses": [
        "(manner) In a manner that requires a transfinite number of steps."
      ],
      "tags": [
        "not-comparable"
      ],
      "topics": [
        "manner"
      ]
    },
    {
      "categories": [],
      "examples": [
        {
          "ref": "2004, Lisa Robin Marks, The Axiom of Choice, Berkeley: University of California, page 35",
          "text": "The concern was voiced that Zermelo assumed transfinitely many successive choices, where one choice depends upon another, and that this was unacceptable.",
          "type": "quotation"
        },
        {
          "ref": "2014, Ali Sanayei, Otto E. Rössler, Chaotic Harmony: A Dialog about Physics, Complexity and Life, Springer, page 126",
          "text": "It was very radical because he also claimed that symmetry is a feature in mathematics and reality that is not just an infinitely accurate property, but a transfinitely accurate one. Like the modern idea of fractals—where we have this Mandelbrot type thinking of everything repeating itself all over again not just infinitely many times, but in such a way that the surface around it is transfinitely large.",
          "type": "quotation"
        }
      ],
      "glosses": [
        "Of transfinite degree."
      ],
      "id": "en-transfinitely-en-adv-JXKsuCwB",
      "links": [
        [
          "transfinite",
          "transfinite"
        ]
      ],
      "qualifier": "degree",
      "raw_glosses": [
        "(degree) Of transfinite degree."
      ],
      "tags": [
        "not-comparable"
      ]
    }
  ],
  "word": "transfinitely"
}

{
  "categories": [
    "English adverbs",
    "English degree adverbs",
    "English entries with incorrect language header",
    "English entries with language name categories using raw markup",
    "English entries with topic categories using raw markup",
    "English lemmas",
    "English manner adverbs",
    "English uncomparable adverbs",
    "en:Infinity"
  ],
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "transfinitely (not comparable)",
      "name": "en-adv"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "adv",
  "related": [
    {
      "word": "finitely"
    },
    {
      "word": "infinitely"
    },
    {
      "word": "transfinite"
    }
  ],
  "senses": [
    {
      "categories": [
        "English terms with quotations"
      ],
      "examples": [
        {
          "ref": "1999, Thomas Strahm, “First Steps into Metapredictivity in Explicit Mathematics”, in S. Barry Cooper, John K. Truss, editors, Sets and Proofs, Cambridge University Press, page 399",
          "text": "We finish this section by briefly addressing how the reduction procedure for #x5C;mathsf#x7B;EMU#x7D; described so far can be formalized in the transfinitely iterated fixed point theory #x5C;widehat#x7B;#x5C;mathsf#x7B;ID_(<ε₀) of [18] in order to yield conservativity of mathsf EMU over widehat mathsf ID_(<ε₀) with respect to arithmetic statements.}}",
          "type": "quotation"
        },
        {
          "ref": "2003, Thomas Forster, Logic, Induction and Sets, Cambridge University Press, page 147",
          "text": "After we have performed the deletion operation infinitely many times, we can look at what is left and perform the deletion operation on that, and thereby continue the process transfinitely.",
          "type": "quotation"
        }
      ],
      "glosses": [
        "In a manner that requires a transfinite number of steps."
      ],
      "links": [
        [
          "transfinite",
          "transfinite"
        ]
      ],
      "raw_glosses": [
        "(manner) In a manner that requires a transfinite number of steps."
      ],
      "tags": [
        "not-comparable"
      ],
      "topics": [
        "manner"
      ]
    },
    {
      "categories": [
        "English terms with quotations"
      ],
      "examples": [
        {
          "ref": "2004, Lisa Robin Marks, The Axiom of Choice, Berkeley: University of California, page 35",
          "text": "The concern was voiced that Zermelo assumed transfinitely many successive choices, where one choice depends upon another, and that this was unacceptable.",
          "type": "quotation"
        },
        {
          "ref": "2014, Ali Sanayei, Otto E. Rössler, Chaotic Harmony: A Dialog about Physics, Complexity and Life, Springer, page 126",
          "text": "It was very radical because he also claimed that symmetry is a feature in mathematics and reality that is not just an infinitely accurate property, but a transfinitely accurate one. Like the modern idea of fractals—where we have this Mandelbrot type thinking of everything repeating itself all over again not just infinitely many times, but in such a way that the surface around it is transfinitely large.",
          "type": "quotation"
        }
      ],
      "glosses": [
        "Of transfinite degree."
      ],
      "links": [
        [
          "transfinite",
          "transfinite"
        ]
      ],
      "qualifier": "degree",
      "raw_glosses": [
        "(degree) Of transfinite degree."
      ],
      "tags": [
        "not-comparable"
      ]
    }
  ],
  "word": "transfinitely"
}