Combinatorics / CONCEPT
The null tuple and Boolean constraint expressibility
Deleting the null tuple changes whether ternary disjunction is pp definable.
Closed
DIRECT PREREQUISITES2
DIRECT CONSEQUENCES1
PROOF DEPTH2
DOCUMENT LINKS0
The null-free relation computes NOR
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
Certified topology / DOWNSTREAM
Consequences
RELATED KNOWLEDGE
Structural connections
- Constructive simulation with a multiplicative face equalitystructural-affinity · Closed
- Exact rational five-mode networks with internal zerosstructural-affinity · Closed
- Exact rational laws from strictly positive five-mode tablesstructural-affinity · Closed
- First Rejection Across Arbitrary Window Cutsstructural-affinity · Closed
- Literal Windows and Positive Endstructural-affinity · Closed
- Primitive-positive definitions and preservationstructural-affinity · Closed
- Priority Teachers on the Legal Five-Window Languagestructural-affinity · Closed
- Uniform Support Signal on Legal Positive-End Wordsstructural-affinity · Closed
Documents & exposition
None recorded in this release.
Other authored & advisory relationships
None recorded in this release.
LIBRARY / RELEASE VERSIONS
Content history
Loading release versions...
Browse the archiveCertified provenance