A Proposition Universal Affirmative Quantity-Quality Classifier
Recognize an A proposition represented as all subject members satisfying an unnegated predicate.
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. An A proposition states that all subject members belong to the predicate class.1
The tool returns isA. Interpret the result under the rule and assumptions below; an encoded premise’s truth is not independently established.
When to use A Proposition Universal Affirmative Quantity-Quality Classifier
Use this for the following task: Recognize an A proposition represented as all subject members satisfying an unnegated predicate. Prepare the specified logical encoding before running the check or transformation.
How to use A Proposition Universal Affirmative Quantity-Quality Classifier 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 quantifier, predicateNegated according to the field table, then run the tool.
- Read isA. 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 |
|---|---|---|---|
| quantifier | Quantifier | string; choices "all", "some" | Required |
| predicateNegated | Predicate negated | boolean | Required |
Represent the statement with quantifier all or some and a Boolean predicateNegated flag. Compare those fields with the chosen categorical form and return its classification flag.
isA = quantifier is all AND predicateNegated is false The symbols and boundary conditions refer to the supplied fields and the implementation described above.
| Output field | Meaning | Value type |
|---|---|---|
| isA | Is A | boolean |
{
"input": {
"quantifier": "all",
"predicateNegated": false
},
"output": {
"isA": true
}
}Limitations and assumptions
This classifies a supplied encoding without parsing natural-language sentences or assessing class existence. A false flag means another form, not a false proposition.
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 E Proposition Universal Negative Classifier when you need its operation: Recognize an E proposition represented as all subject members satisfying a negated predicate. Choose I Proposition Particular Affirmative Classifier for the complementary operation: Recognize an I proposition represented as some subject member satisfying an unnegated predicate.
Background reference: Categorical Logic.
References
-
Categorical Logic — Philip B. Stark, University of California Berkeley
Similar or alternative tools
- E Proposition Universal Negative Classifier
Recognize an E proposition represented as all subject members satisfying a negated predicate.
- I Proposition Particular Affirmative Classifier
Recognize an I proposition represented as some subject member satisfying an unnegated predicate.