Categorical Syllogism Mood-Figure Label Parser (EAE-1 etc.)

Parse a categorical mood and figure such as AAA-1 into proposition kinds and standard S, M, and P term positions.

Description

Categorical propositions use A for universal affirmative, E for universal negative, I for particular affirmative and O for particular negative.

Categorical propositions use A for universal affirmative, E for universal negative, I for particular affirmative and O for particular negative. Mood records the major premise, minor premise and conclusion in that order; figure records the middle term’s position.^[1]

The tool returns majorKind, minorKind, conclusionKind, figure, majorSubject, majorPredicate, minorSubject, minorPredicate. Interpret the result under the rule and assumptions below; an encoded premise’s truth is not independently established.

When to use Categorical Syllogism Mood-Figure Label Parser (EAE-1 etc.)

Use this for the following task: Parse a categorical mood and figure such as AAA-1 into proposition kinds and standard S, M, and P term positions. Prepare the specified logical encoding before running the check or transformation.

How to use Categorical Syllogism Mood-Figure Label Parser (EAE-1 etc.) and understand its results

Prepare the requested Boolean values, complete truth-table rows, or identifier atoms. An atom is a name such as p or premise_1, not a natural-language sentence.
Enter syllogism according to the field table, then run the tool.
Read majorKind, minorKind, conclusionKind, figure, majorSubject, majorPredicate, minorSubject, minorPredicate. Use the matching rule, assignment order or nonempty-class assumptions below to interpret the result.
For a false check, inspect the supplied encoding and matching rule. A well-formed false result is different from an input error.

Input field	Meaning	Value type and bounds	Requirement
syllogism	Mood and figure	string; maximum text length 5; pattern ^[AEIO]{3}-[1-4]$(?![\s\S])	Required

Enter a code such as AAA-1. Match the exact five-character syntax, split the three kinds, and map the figure to the major/minor subject and predicate positions.

input syntax: three uppercase A/E/I/O letters, a hyphen, then figure 1..4

The symbols and boundary conditions refer to the supplied fields and the implementation described above.

Output field	Meaning	Value type
majorKind	Major proposition kind	string
minorKind	Minor proposition kind	string
conclusionKind	Conclusion proposition kind	string
figure	Syllogism figure	integer
majorSubject	Major premise subject	string
majorPredicate	Major premise predicate	string
minorSubject	Minor premise subject	string
minorPredicate	Minor premise predicate	string

json

{
  "input": {
    "syllogism": "AAA-1"
  },
  "output": {
    "majorKind": "A",
    "minorKind": "A",
    "conclusionKind": "A",
    "figure": 1,
    "majorSubject": "M",
    "majorPredicate": "P",
    "minorSubject": "S",
    "minorPredicate": "M"
  }
}

Limitations and assumptions

This parses any syntactically permitted mood and figure, including invalid syllogisms. It does not itself certify validity.

The supplied encodings must represent the intended propositions or classes. No natural-language parsing or assessment of empirical premise truth is performed. Malformed input gives a tool error rather than a logical false result.

Alternative or Complementary methods

Choose Barbara AAA-1 Valid Form Lookup when you need its operation: Check Barbara (AAA-1) under explicit nonempty-term assumptions using classical categorical semantics. Choose Existential Import Modern Invalidity Flag for AA-3 for the complementary operation: Identify categorical syllogisms that become valid only when nonempty terms are assumed.

Background reference: Categorical Logic.

References

Categorical Logic — Philip B. Stark, University of California Berkeley

Similar or alternative tools

Barbara AAA-1 Valid Form Lookup
Check Barbara (AAA-1) under explicit nonempty-term assumptions using classical categorical semantics.
Existential Import Modern Invalidity Flag for AA-3
Identify categorical syllogisms that become valid only when nonempty terms are assumed.