"unlesss" meaning in All languages combined

{
  "etymology_text": "Attributed to John Horton Conway. From unless, by analogy with the formation of iff from if.",
  "head_templates": [
    {
      "args": {},
      "expansion": "unlesss",
      "name": "en-con"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "conj",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English terms with 3 consecutive instances of the same letter",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Logic",
          "orig": "en:Logic",
          "parents": [
            "Formal sciences",
            "Philosophy",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Mathematics",
          "orig": "en:Mathematics",
          "parents": [
            "Formal sciences",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "examples": [
        {
          "text": "1990, James Glimm, The Legacy of John Von Neumann, American Mathematical Society, →ISBN, page 279,\nPartial Order: G ≥ H unlesss (unless and only unless) H ≥ some Gᴿ or some Hᴸ ≥ G."
        },
        {
          "ref": "1999, V. K. Balachandran, Topological Algebras, North-Holland, published 2000, →ISBN, pages 78–79:",
          "text": "A subset S is called absorbing if to each x#92;inX there is a real number #92;epsilon#61;#92;epsilon#95;xgt;0 such that #92;lambdax#92;inS for all #92;lambda with 0lt;#92;left#124;#92;lambda#92;right#124;#92;le#92;epsilon. Trivially the set X is absorbing; on the other hand #92;#123;0#92;#125; can never be absorbing (unlesss X#61;#92;#123;0#92;#125;).",
          "type": "quote"
        },
        {
          "text": "2004, William Fraser, Susan Hirshberg, and David Wolfe, \"The Structure of the Distributive Lattice of Games Born by Day n\", in Integers: Electronic Journal of Combinatorial Number Theory 5(2) (2005), page 2,\nG ≥ H unlesss H ≥ Gᴿ or Hᴸ ≥ G for some Gᴿ ∈ Gᴿ or some Hᴸ ∈ Hᴸ. ¶ (Analogous to “iff”, the term “unlesss” means “unless and only unless”.)"
        }
      ],
      "glosses": [
        "Precisely unless."
      ],
      "id": "en-unlesss-en-conj-anqChOIN",
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "logic",
          "logic"
        ],
        [
          "Precisely unless",
          "precisely unless"
        ]
      ],
      "raw_glosses": [
        "(mathematics, logic) Precisely unless."
      ],
      "topics": [
        "human-sciences",
        "logic",
        "mathematics",
        "philosophy",
        "sciences"
      ]
    }
  ],
  "word": "unlesss"
}

{
  "etymology_text": "Attributed to John Horton Conway. From unless, by analogy with the formation of iff from if.",
  "head_templates": [
    {
      "args": {},
      "expansion": "unlesss",
      "name": "en-con"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "conj",
  "senses": [
    {
      "categories": [
        "English conjunctions",
        "English entries with incorrect language header",
        "English lemmas",
        "English terms with 3 consecutive instances of the same letter",
        "English terms with quotations",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Logic",
        "en:Mathematics"
      ],
      "examples": [
        {
          "text": "1990, James Glimm, The Legacy of John Von Neumann, American Mathematical Society, →ISBN, page 279,\nPartial Order: G ≥ H unlesss (unless and only unless) H ≥ some Gᴿ or some Hᴸ ≥ G."
        },
        {
          "ref": "1999, V. K. Balachandran, Topological Algebras, North-Holland, published 2000, →ISBN, pages 78–79:",
          "text": "A subset S is called absorbing if to each x#92;inX there is a real number #92;epsilon#61;#92;epsilon#95;xgt;0 such that #92;lambdax#92;inS for all #92;lambda with 0lt;#92;left#124;#92;lambda#92;right#124;#92;le#92;epsilon. Trivially the set X is absorbing; on the other hand #92;#123;0#92;#125; can never be absorbing (unlesss X#61;#92;#123;0#92;#125;).",
          "type": "quote"
        },
        {
          "text": "2004, William Fraser, Susan Hirshberg, and David Wolfe, \"The Structure of the Distributive Lattice of Games Born by Day n\", in Integers: Electronic Journal of Combinatorial Number Theory 5(2) (2005), page 2,\nG ≥ H unlesss H ≥ Gᴿ or Hᴸ ≥ G for some Gᴿ ∈ Gᴿ or some Hᴸ ∈ Hᴸ. ¶ (Analogous to “iff”, the term “unlesss” means “unless and only unless”.)"
        }
      ],
      "glosses": [
        "Precisely unless."
      ],
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "logic",
          "logic"
        ],
        [
          "Precisely unless",
          "precisely unless"
        ]
      ],
      "raw_glosses": [
        "(mathematics, logic) Precisely unless."
      ],
      "topics": [
        "human-sciences",
        "logic",
        "mathematics",
        "philosophy",
        "sciences"
      ]
    }
  ],
  "word": "unlesss"
}