Skip to content

Main content

Argument Conclusion Reference Count Tool

Count exact supplied conclusion references without deciding logical entailment.

Loading tool…

Description

Count exact supplied conclusion references without deciding logical entailment.

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.

Count exact supplied conclusion references without deciding logical entailment.

When to use this tool

Use Argument Conclusion Reference 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

  1. Enter conclusionIds, references. Keep parallel arrays aligned. Use the units and conventions below.
  2. Run the tool. Correct any format, range, or cross-field input error before interpreting the output.
  3. Read referencedConclusions, unresolved. Use the output convention below.

Return referencedConclusions as the number of distinct references matching conclusionIds and unresolved as every unmatched reference occurrence.1

Input fieldMeaning and unitsAccepted input
conclusionIdsConclusion IdsRequired. Array of text; maximum UTF-16 length 8192; maximum items 256.
referencesReferencesRequired. Array of text; maximum UTF-16 length 8192; maximum items 256.
Output fieldInterpretationReturned shape
referencedConclusionsReferenced ConclusionsRequired. Safe integer.
unresolvedUnresolvedRequired. Array of text; maximum UTF-16 length 8192; maximum items 256.
json
{
  "input": {
    "conclusionIds": [
      "C1",
      "C2"
    ],
    "references": [
      "C1",
      "C1",
      "C3"
    ]
  },
  "output": {
    "referencedConclusions": 1,
    "unresolved": [
      "C3"
    ]
  }
}

Limitations and assumptions

  • Unresolved duplicates are preserved while matched IDs are deduplicated. No conclusion content, proof dependency, cycle, or entailment is checked.
  • 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

  1. Calculation and input contract: philosophy/argument-conclusion-reference-count — tool.io

Similar or alternative tools