Lewis Carroll Sorites Premise Chain Link Counter
Inspect explicit ordered universal class-inclusion sorites links; no existential import, natural-language parsing or arbitrary syllogism proof.
Description
Lewis Carroll Sorites Premise Chain Link Counter: return premise count, chain link count, broken link indices, unbroken universal inclusion chain.
A sorites chain links class-inclusion premises so that the predicate of one becomes the subject of the next. Gaps in that ordered chain can be located textually.
This tool returns premise count, chain link count, broken link indices, unbroken universal inclusion chain. Use the stated units and model convention when interpreting these fields.
When to use this tool
Use this tool when the supplied inputs match the specific operation described above and you need a repeatable result under its stated convention.
- Check the supported input and output contract against an existing calculation or observation.
- Use the complete example to confirm units, selector spelling and result interpretation.
How to use the tool and how it works
- Enter every field in the input table using the stated units and the exact supported selector spelling where applicable.
- Run the tool. Correct input errors before interpreting an output.
- Read the result fields below; use accompanying flags and the stated sign, boundary or model convention when interpreting a number.
Require aligned nonempty subject and predicate lists. Compare each predicate with the following subject using exact text; report zero-based gap indices, premise count and one fewer potential links.1
| Input field | Meaning and units | Accepted input |
|---|---|---|
| premiseSubjects | Premise subjects. | List of text values |
| premisePredicates | Premise predicates. | List of text values |
| Output field | Interpretation |
|---|---|
| result | Object containing the following named result fields. |
| result.premiseCount | Premise count; use the stated units and sign convention. |
| result.chainLinkCount | Chain link count; use the stated units and sign convention. |
| result.brokenLinkIndices | Broken link indices list, in the ordering described in the calculation. |
| result.unbrokenUniversalInclusionChain | Unbroken universal inclusion chain flag under the exact conditions described above. |
{
"input": {
"premiseSubjects": [
"A",
"B",
"C"
],
"premisePredicates": [
"B",
"C",
"D"
]
},
"output": {
"result": {
"premiseCount": 3,
"chainLinkCount": 2,
"brokenLinkIndices": [],
"unbrokenUniversalInclusionChain": true
}
}
}Limitations and assumptions
- Only an ordered universal-inclusion chain is checked. Semantic equivalence, other syllogistic forms and premise truth are not established.
- Every declared field is required and unexpected fields are rejected. Numeric inputs must be finite; input errors are distinct from a valid false result or an explicitly qualified output.
- Extremely large inputs and nonfinite or excessively large outputs are rejected. List positions reported by the tool use zero-based indices unless stated otherwise.
Alternative or Complementary methods
Check the underlying observations, units and conventions independently before using the result in a larger workflow. The tools listed below address nearby tasks; compare their inputs and scope before substituting one for this operation.
References
Similar or alternative tools
- Conjunctive Normal Form CNF Conversion Steps Counter
Bounded classical propositional !,&,| parser/NNF/CNF conversion; counts distributive Cartesian merge events, not a universal proof-step metric; <=256 clauses, <=4096 literals.
- prime implicant adjacency edge counter
Binary minterms are adjacent when their assignments differ in exactly one bit.