PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
May 5, 20260 citationsOpen Access

Structural Dimensionality and the Conditions of Set Admissibility

View Full Paper
AJAustin Jacobs

Key Points

  • The aim is to extend the admissibility framework of the Modal–Dependence Calculus to arbitrary sets.
  • Introduced structural parameters of breadth and depth to analyze dependence structures.
  • Defined set admissibility based on the definability condition for each element.
  • Analyzed the effects of undefined dependence on global admissibility.
  • Set S is admissible if every element satisfies the definability condition D*(x, c).
  • Structural parameters breadth (beta) and depth (delta) describe the dimensional configuration of admissible sets.
  • Admissibility is a global property, unaffected by scale, meaning structural failure is irreparable across the set.

Abstract

This paper extends the admissibility framework of the Modal–Dependence Calculus (MDC) from sequences to arbitrary sets. A set S is admissible if and only if every element x in S satisfies the definability condition D*(x, c), corresponding to tau(x) = 1. We introduce structural parameters of breadth (beta), defined as the cardinality of admissible elements, and depth (delta), defined as the supremum of dependence chain lengths terminating at the invariant core c. These parameters formalize the dimensional configuration of dependence structures without altering the admissibility condition. Set-level admissibility is therefore determined solely by universal grounding: the existence of any element with undefined dependence yields tau(S) = 0. This establishes that admissibility is a global structural property independent of scale, and that structural failure is non-compensatory across the set.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Austin Jacobs (2026) studied this question.

synapsesocial.com/papers/69f9895b15588823dae183e1https://doi.org/10.5281/zenodo.20010689
Ask AI
Helpful
Bookmark
Share
View Full Paper