Description
Compose supplied statements into supported formal fallacies and valid controls with delegated labels and countervaluations, independent of premise truth.
A generated practice exercise contains a prompt and an answer key under a specific rule set. A planted answer establishes one possible solution; only an explicit enumeration or uniqueness check establishes whether alternatives exist.
Compose supplied statements into supported formal fallacies and valid controls with delegated labels and countervaluations, independent of premise truth.
When to use this tool
Use this generator to create reproducible fallacy spotting cards cases from the supplied model or bank. Inspect the returned evidence before using cases in a test or exercise.
How to use the tool and how it works
- Supply statements, provenance, kinds, count in the field shapes below. Set seed when you need an explicit replay.
- Run the tool and correct any input error. For generated controls, distinguish a successful fixture containing an invalid case from failure to generate the fixture.
- Read cards, provenance. Use the conventions below. Keep answer-bearing fields separate when presenting an exercise.
Draw two distinct supplied statement labels and one supported pattern: affirming the consequent, denying the antecedent, modus ponens, or modus tollens. Build its symbolic premises and conclusion, delegate the corresponding fallacy-pattern check, and provide p=false, q=true as a counterexample for the two invalid forms.1
Delegated operations used for this result: affirming consequent fallacy flag; denying antecedent fallacy flag. Their calculation or parsing conventions apply to the corresponding result fields.2, 3
| Input field | Meaning and units | Accepted input |
|---|---|---|
| statements | Statements | Required. Array of Text; minimum UTF-16 length 1; maximum UTF-16 length 256.; minimum items 2; maximum items 64. |
| provenance | Provenance | Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 512. |
| kinds | Kinds | Required. Array of Text; one of "affirming-consequent", "denying-antecedent", "modus-ponens", "modus-tollens".; minimum items 1; maximum items 4. |
| count | Count | Required. Safe integer; minimum 1; maximum 64. |
| seed | Optional numeric seed; takes precedence over context randomness. Without either, use the fixed tool.io default seed. | Optional. Safe integer. |
| Output field | Interpretation | Returned shape |
|---|---|---|
| cards | Cards | Required. Array of Object; no unknown keys.; minimum items 1; maximum items 64. |
| cards[].statementP | Statement P | Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 256. |
| cards[].statementQ | Statement Q | Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 256. |
| cards[].premises | Premises | Required. Array of Text; minimum UTF-16 length 1; maximum UTF-16 length 256.; minimum items 2; maximum items 2. |
| cards[].conclusion | Conclusion | Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 256. |
| cards[].label | Supplied display label. | Required. Text; one of "affirming-consequent", "denying-antecedent", "modus-ponens", "modus-tollens". |
| cards[].formallyValid | Formally Valid | Required. Boolean. |
| cards[].counterexample | Counterexample | Required. Object; no unknown keys. or Null. |
| provenance | Provenance | Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 512. |
| randomness | Replay source and normalized 32-bit seed, or null seed for an advancing context source. | Required. Object; no unknown keys. |
| randomness.seed | Optional safe-integer replay seed; normalization and precedence are explained below. | Required. Safe integer. or Null. |
| randomness.source | Source | Required. Text; one of "context", "seed". |
An explicit safe-integer seed takes precedence over injected context randomness and is normalized to an unsigned 32-bit integer. With no seed and no context source, replay uses the fixed tool.io default seed. A context source must return finite values from zero inclusive to one exclusive; its advancing state must be retained separately. randomness records the source and normalized seed, or null for context. These generators are not cryptographic random sources.
{
"input": {
"statements": [
"The lamp is on",
"The room is lit"
],
"provenance": "Caller-supplied illustrative statements",
"kinds": [
"modus-ponens",
"affirming-consequent"
],
"count": 1,
"seed": 42
},
"output": {
"cards": [
{
"statementP": "The lamp is on",
"statementQ": "The room is lit",
"premises": [
"(p -> q)",
"q"
],
"conclusion": "p",
"label": "affirming-consequent",
"formallyValid": false,
"counterexample": {
"p": false,
"q": true
}
}
],
"provenance": "Caller-supplied illustrative statements",
"randomness": {
"seed": 42,
"source": "seed"
}
}
}Limitations and assumptions
- The supported templates determine coverage. Symbolic validity under these patterns does not evaluate the truth of ordinary-language premises or identify every informal fallacy.
- A replay requires the same complete input and implementation. The stated sampling convention applies within its eligible space. A finite draw does not exhaust all possible outputs; repeats remain possible unless a distinct-selection rule is explicit.
- The field tables state structural bounds; cross-field constraints and bounded search or output budgets also apply. Unknown keys are rejected where the object contract disallows them. Input errors are distinct from null fields and deliberate invalid controls in a successful output.
Alternative or Complementary methods
For a supplied example, inspect the returned construction or delegated check directly. To evaluate a consumer, also test cases chosen for its own boundaries; a generated finite corpus does not establish exhaustive coverage.
References
Similar or alternative tools
- Random Existential Import Counterexample Cards Generator
Construct and verify explicit finite countermodels for AAI-1 and EAO-1 using empty subjects under modern vacuous-universal semantics.
- Random Balance Scale Equation Puzzle Generator
Construct balanced symbolic pan equations from sampled nonnegative weights, retaining exact solutions without claiming uniqueness.