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-implicationInputs
| Field | Type | Required | Description |
|---|---|---|---|
| join | See schema | Yes | |
| claim | See schema | Yes |
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
}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
- Datenvertragswerk0.003 USDC
acyclic automata probabilistic refinement witness
POSThttps://datenvertrag.halowerk.com/v1/acyclic-automata-probabilistic-refinement-witnessFor two finite action-labelled nondeterministic probabilistic automata return the WHOLE greatest DIRECTED STRONG SIMULATION relation, canonical single-transition matching couplings and exhaustive local negative Hall obstructions. Each of 1.
- Datenvertragswerk0.003 USDC
adjacency cospectral graph family
POSThttps://datenvertrag.halowerk.com/v1/adjacency-cospectral-graph-familyGiven n in 1..5 and a monic degree-n integer polynomial det(xI-A), returns every labelled simple undirected graph on vertices 0..n-1 with exactly that adjacency characteristic polynomial. Coefficients are in descending degree order, n+1 ent
- Datenvertragswerk0.003 USDC
adjacent swap permutation tour
POSThttps://datenvertrag.halowerk.com/v1/adjacent-swap-permutation-tourFor 0 to 5 labels starting at zero, construct the whole Steinhaus-Johnson-Trotter permutation tour from identity. Each transition swaps the largest mobile value with its adjacent smaller neighbor, then reverses directions of greater values.