Syllogism Middle Term Occurrence Count Tool

Description

Find shared premise terms absent from the conclusion, without inferring syllogistic validity.

A logical calculation operates on a stated representation: truth values, token lists, counts, or an explicitly supplied relation. Checking one assignment, pair, trace, or witness is different from proving a formula or validating an entire argument. Empty domains, duplicate tokens, and scope conventions can change the result.

Find shared premise terms absent from the conclusion, without inferring syllogistic validity.

When to use this tool

Use Syllogism Middle Term Occurrence Count when you need this exact local truth, count, token, relation, or witness check within a larger logic workflow.

How to use the tool and how it works

Enter firstTerms, secondTerms, conclusionTerms. Keep parallel arrays aligned. Use the units and conventions below.
Run the tool. Correct any format, range, or cross-field input error before interpreting the output.
Read middleTerms, counts. Use the output convention below.

Find distinct tokens present in both firstTerms and secondTerms but absent from conclusionTerms. Return these middleTerms in first-occurrence order and each token's total occurrence count across both premise lists.^[1]

Input field	Meaning and units	Accepted input
firstTerms	First Terms	Required. Array of text; maximum UTF-16 length 8192; maximum items 256.
secondTerms	Second Terms	Required. Array of text; maximum UTF-16 length 8192; maximum items 256.
conclusionTerms	Conclusion Terms	Required. Array of text; maximum UTF-16 length 8192; maximum items 256.

Output field	Interpretation	Returned shape
middleTerms	Middle Terms	Required. Array of text; maximum UTF-16 length 8192; maximum items 256.
counts	Counts	Required. Array of safe integer; maximum items 256.

json

{
  "input": {
    "firstTerms": [
      "A",
      "M"
    ],
    "secondTerms": [
      "M",
      "B"
    ],
    "conclusionTerms": [
      "A",
      "B"
    ]
  },
  "output": {
    "middleTerms": [
      "M"
    ],
    "counts": [
      2
    ]
  }
}

Limitations and assumptions

The inputs are term-token lists, not parsed categorical statements. Occurrence counts alone do not test distribution, syllogistic form, or argument validity.
Inputs must satisfy both the field types and the cross-field conditions above. Invalid input causes an error; a successful false flag or documented placeholder is a different result.

Alternative or Complementary methods

Use a parser, scope-aware representation, model checker, or proof procedure when the supplied token or witness representation is insufficient. A local passing check should not be promoted to global validity.

References

Calculation and input contract: philosophy/syllogism-middle-term-occurrence-count — tool.io

Similar or alternative tools

Argument Conclusion Reference Count
Count exact supplied conclusion references without deciding logical entailment.
Definite Description Uniqueness Count
For nonnegative integer matchingObjects return exists=(count>0), unique=(count===1), and failedUniqueness=(count!==1).