"wff" meaning in English

{
  "forms": [
    {
      "form": "wffs",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "wff (plural wffs)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "alt_of": [
        {
          "word": "well-formed formula"
        }
      ],
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        }
      ],
      "examples": [
        {
          "ref": "1964, On the Occurrence of Non-deontic WFF's in Argument Forms Having Deontic WFF's as Conclusion",
          "text": "which are of the form P(S) and hence we know that we can decide its truth value if we can decide the truth Value of all d-wff's of form P(S). But if it is of the form P(S ) then it is equivalent to P(T) where T is the dans of S. But by the principle of […]",
          "type": "quotation"
        },
        {
          "ref": "2001, James L. Hein, Discrete Structures, Logic, and Computability, Jones & Bartlett Learning, page 350",
          "text": "A grammatically correct expression is called a well-formed formula, or wff for short, which can be pronounced \"woof.\" To decide whether an expression is a wff , we need to precisely define the syntax (or grammar) rules for the formation of wffs […]",
          "type": "quotation"
        },
        {
          "ref": "2002, Fernando C. N. Pereira, Stuart M. Shieber, Prolog and Natural-Language Analysis, Microtome Publishing, page 76",
          "text": "The set of well-formed formulas (wffs) is the smallest set satisfying the following conditions: • If p is an n-ary predicate symbol (an element of Pn) and t1 ,. .., tn are terms, p(t1 ,. ..,tn) is a wff. • If p is a wff and x is a variable, (∀x)p and (∃x)p are […]",
          "type": "quotation"
        }
      ],
      "glosses": [
        "Acronym of well-formed formula."
      ],
      "id": "en-wff-en-noun-yRomrqmc",
      "links": [
        [
          "well-formed formula",
          "well-formed formula#English"
        ]
      ],
      "synonyms": [
        {
          "word": "WFF"
        }
      ],
      "tags": [
        "abbreviation",
        "acronym",
        "alt-of"
      ]
    }
  ],
  "sounds": [
    {
      "ipa": "/wɪf/"
    },
    {
      "ipa": "/wʊf/"
    },
    {
      "ipa": "/wʌf/"
    },
    {
      "rhymes": "-ɪf"
    },
    {
      "rhymes": "-ʊf"
    },
    {
      "rhymes": "-ʌf"
    }
  ],
  "word": "wff"
}

{
  "forms": [
    {
      "form": "wffs",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "wff (plural wffs)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "alt_of": [
        {
          "word": "well-formed formula"
        }
      ],
      "categories": [
        "English 1-syllable words",
        "English acronyms",
        "English countable nouns",
        "English entries with incorrect language header",
        "English lemmas",
        "English nouns",
        "English terms with IPA pronunciation",
        "English terms with quotations",
        "English words without vowels",
        "Quotation templates to be cleaned",
        "Rhymes:English/ɪf",
        "Rhymes:English/ɪf/1 syllable",
        "Rhymes:English/ʊf",
        "Rhymes:English/ʊf/1 syllable",
        "Rhymes:English/ʌf",
        "Rhymes:English/ʌf/1 syllable"
      ],
      "examples": [
        {
          "ref": "1964, On the Occurrence of Non-deontic WFF's in Argument Forms Having Deontic WFF's as Conclusion",
          "text": "which are of the form P(S) and hence we know that we can decide its truth value if we can decide the truth Value of all d-wff's of form P(S). But if it is of the form P(S ) then it is equivalent to P(T) where T is the dans of S. But by the principle of […]",
          "type": "quotation"
        },
        {
          "ref": "2001, James L. Hein, Discrete Structures, Logic, and Computability, Jones & Bartlett Learning, page 350",
          "text": "A grammatically correct expression is called a well-formed formula, or wff for short, which can be pronounced \"woof.\" To decide whether an expression is a wff , we need to precisely define the syntax (or grammar) rules for the formation of wffs […]",
          "type": "quotation"
        },
        {
          "ref": "2002, Fernando C. N. Pereira, Stuart M. Shieber, Prolog and Natural-Language Analysis, Microtome Publishing, page 76",
          "text": "The set of well-formed formulas (wffs) is the smallest set satisfying the following conditions: • If p is an n-ary predicate symbol (an element of Pn) and t1 ,. .., tn are terms, p(t1 ,. ..,tn) is a wff. • If p is a wff and x is a variable, (∀x)p and (∃x)p are […]",
          "type": "quotation"
        }
      ],
      "glosses": [
        "Acronym of well-formed formula."
      ],
      "links": [
        [
          "well-formed formula",
          "well-formed formula#English"
        ]
      ],
      "tags": [
        "abbreviation",
        "acronym",
        "alt-of"
      ]
    }
  ],
  "sounds": [
    {
      "ipa": "/wɪf/"
    },
    {
      "ipa": "/wʊf/"
    },
    {
      "ipa": "/wʌf/"
    },
    {
      "rhymes": "-ɪf"
    },
    {
      "rhymes": "-ʊf"
    },
    {
      "rhymes": "-ʌf"
    }
  ],
  "synonyms": [
    {
      "word": "WFF"
    }
  ],
  "word": "wff"
}