Skip to content
HALOWERK

Datenvertragswerk

finite distributive heyting implication

Construct the COMPLETE HEYTING IMPLICATION operation of one fully captured finite DISTRIBUTIVE lattice from its JOIN table, order1..4 on original labels0..n-1. No bottom/top label is assumed. Require square closed commutative associative idempotent join, a greatest lower bound for every pair, and distributivity. Define x<=y iff join[x][y]=y; recover meet and bottom. implication[a][b] is the GREATEST x with meet(a,x)<=b, characterized by c<=implication[a][b] IFF meet(a,c)<=b for EVERY.

POST https://datenvertrag.halowerk.com/v1/finite-distributive-heyting-implication

Inputs

Fields of the published input schema
FieldTypeRequiredDescription
joinSee schemaYes
claimSee schemaYes
Show full input schema
{
  "type": "object",
  "properties": {
    "join": {
      "anyOf": [
        {
          "type": "array",
          "items": {
            "type": "array",
            "items": {
              "type": "integer",
              "minimum": 0,
              "maximum": 3
            },
            "minItems": 1,
            "maxItems": 4
          },
          "minItems": 1,
          "maxItems": 4
        },
        {
          "type": "null"
        }
      ]
    },
    "claim": {
      "anyOf": [
        {
          "type": "object",
          "properties": {
            "implication": {
              "type": "array",
              "items": {
                "type": "array",
                "items": {
                  "type": "integer",
                  "minimum": 0,
                  "maximum": 3
                },
                "minItems": 1,
                "maxItems": 4
              },
              "minItems": 1,
              "maxItems": 4
            },
            "negation": {
              "type": "array",
              "items": {
                "type": "integer",
                "minimum": 0,
                "maximum": 3
              },
              "minItems": 0,
              "maxItems": 4
            },
            "double_negation": {
              "type": "array",
              "items": {
                "type": "integer",
                "minimum": 0,
                "maximum": 3
              },
              "minItems": 0,
              "maxItems": 4
            },
            "boolean_elements": {
              "type": "array",
              "items": {
                "type": "integer",
                "minimum": 0,
                "maximum": 3
              },
              "minItems": 0,
              "maxItems": 4
            },
            "residuation_masks": {
              "type": "array",
              "items": {
                "type": "array",
                "items": {
                  "type": "integer",
                  "minimum": 0,
                  "maximum": 15
                },
                "minItems": 1,
                "maxItems": 4
              },
              "minItems": 1,
              "maxItems": 4
            }
          },
          "required": [
            "implication",
            "negation",
            "double_negation",
            "boolean_elements",
            "residuation_masks"
          ],
          "additionalProperties": false
        },
        {
          "type": "null"
        }
      ]
    }
  },
  "required": [
    "join",
    "claim"
  ],
  "additionalProperties": false
}

Open original schema

Published input example

{
  "join": [
    [
      0,
      1,
      2
    ],
    [
      1,
      1,
      2
    ],
    [
      2,
      2,
      2
    ]
  ],
  "claim": {
    "implication": [
      [
        2,
        2,
        2
      ],
      [
        0,
        2,
        2
      ],
      [
        0,
        1,
        2
      ]
    ],
    "negation": [
      2,
      0,
      0
    ],
    "double_negation": [
      0,
      2,
      2
    ],
    "boolean_elements": [
      0,
      2
    ],
    "residuation_masks": [
      [
        7,
        7,
        7
      ],
      [
        1,
        7,
        7
      ],
      [
        1,
        3,
        7
      ]
    ]
  }
}

Result & documentation

Machine-readable documentation of this hub

Source of this page: the published HALOWERK catalog. Updated: 2026-11-17 UTC.

More endpoints in this hub

All endpoints in this hub โ†’