RSI as the Physical Bridge

What the physical bridge has to supply

The account follows Chapter 13, “RSI as the Physical Bridge.” ^[1]

The preceding explanations established a demanding contract for any physical account. We have to know which system we’re describing and where its boundary lies before we can say what makes a transition possible. A relevant difference or capacity must belong to that system or enter through a declared relation. The account must then explain how its carriers and constraints allow or exclude a continuation, how any work or transfer is accounted for, and how a measurement reports what happens.

That contract gives us something to require of a physical theory. Building the theory is a further task.

Existential Ground tells us what I argue every coherent physical account must already respect. Existential Logicism removes categories that cannot survive their own use. Neither one, by itself, gives us the mass of an electron, the spectrum of an atom, the acceleration of a falling object, or the support terrain of a galaxy. Those questions need physical quantities and relations that we can calculate and test.

RSI is my attempt to build an operational physical solver within those constraints. It is a particular physical model within the larger framework, with its own equations and empirical obligations. Its connection to the ground explains why I developed it and what I require of it. That connection cannot make its predictions true. ^[S1][S2]

I want to make that machinery understandable before asking you to follow it into particular domains. We’ll see how RSI declares a finite present configuration, tests whether it is supported, determines whether it must change, and translates the result into a measurable readout. The specialized force-domain equations and full mathematical audit remain in the dedicated RSI volume.

Why a physical bridge is necessary

Chapter 13, §13.1. ^[1]

A logical result and a physical result answer different questions, even when one constrains the other. The Illusion of Nothingness can close absolute nonbeing as a source without telling us which physical carriers exist. Persistent Present Determinism can establish the priority of present actuality without telling us how a clock, orbit, atom, or galaxy records a pacing difference. The physical-accounting contract can expose an undeclared reservoir while leaving the equation that tracks a real reservoir to be supplied.

Physics takes on that further work by defining measurable quantities and relating them mathematically. The resulting account has to predict outcomes, reproduce established scaling behavior, and reuse its calibrations where it claims they apply. It must also tell us which observations would force revision. Without those commitments, we wouldn’t know what a successful explanation had added or how to recognize its failure.

The inherited physical frameworks perform their native jobs with extraordinary success. Mechanics organizes motion, while thermodynamics tracks state variables, heat, and work. Field theory describes distributed interaction, relativity relates clocks and intervals, and quantum theory organizes microscopic measurements and transitions. The unification question becomes harder when we ask how the objects in these different languages belong to one reality. Their mathematical usefulness alone doesn’t settle that question.

With RSI , I ask whether their readouts can be reconstructed through a common order of physical explanation. I begin by declaring the system and its carrier, then build the ledger on which its admission and change tests depend. Once the participating identities close under those conditions, I can construct the familiar overlay that reports the result.

This gives the model obligations in both directions. It has to respect the arguments against absolute nothingness, completed physical infinity, hidden temporal storage, and undeclared sources. Its geometry must be explicit wherever it affects the calculation. At the same time, it has to recover the measurements, scaling behavior, and domain successes that make existing physical frameworks useful. Coherence without those physical results would leave the implementation unfinished. Predictive success without a warranted account of its primitives would leave its ontology underdetermined. The bridge has to answer to both.

Admission and change answer different questions

Chapter 13, §13.2. ^[1]

RSI first asks whether a proposed configuration holds as a resolved identity now. Once that admission question is answered, it asks whether the admitted configuration can remain in the same form or must reconfigure. The distinction matters because being present and being stable tell us different things about a system.

A bridge can exist and still be close to failure. An atom can exist in a state that will decay. A star can retain one stellar identity while continuously converting and redistributing energy. You can remain one organized living system while changing biologically and psychologically. A galaxy can likewise be admitted as one system while its members move and its support terrain evolves. In each case, we need to say which identity we’re testing before deciding what its persistence means.

RSI assigns admission to the existence gate,

$$\boxed{ S =\frac{ E_A }{ A_P } }$$

Here $E_A$ is the anchored budget available at the relevant interface, and $A_P$ is the declared carrier requirement. The carrier includes its calibrated conversion into the same ledger units as the anchored budget. It isn’t bare area divided into energy. That conversion lets the dimensionless ratio compare the available budget with the requirement it must cover. In the baseline reading,

$$S \ge 1 \quad\Longrightarrow\quad \text{configuration admitted},$$

while

$$S <1 \quad\Longrightarrow\quad \text{configuration not supported in that declared form}.$$

The change gate compares the recursive field-side budget $E_F$ with the anchor-side budget,

$$\boxed{ D_c =\frac{ E_F }{ E_A } }$$

Its baseline thresholds distinguish stability, the boundary of transition, and forced reconfiguration,

$$D_c <1\Rightarrow\text{stable}, \qquad D_c =1\Rightarrow\text{threshold}, \qquad D_c >1\Rightarrow\text{forced reconfiguration}.$$

These tests belong to the configuration, interface, and system we declared. RSI therefore evaluates admission before interpreting a transition verdict. Reaching the threshold doesn’t, on its own, say how quickly a system changes or which route it takes. The participating channels and pacing conditions still have to be resolved.

I’m using existence here in an operational sense tied to a particular configuration. A result of $S <1$ rejects the proposed membership or identity under the declared carrier and ledger. It doesn’t turn an object into absolute nothingness. The object may participate in a different configuration, and the account has to determine what that configuration is. Keeping this meaning explicit prevents a failed admission test from becoming a claim of metaphysical annihilation.

The positive ledger

Chapter 13, §13.3. ^[1]

To evaluate either gate, we need to know what its quantities represent. RSI begins with three base carriers whose roles remain distinct as the system changes.

The recursive field budget is written as

$$E_F =T\, D_E ,$$

where $T$ is the energy per resolved layer and $D_E$ is the dimensionless recursion depth of the declared relation. At the anchor boundary, RSI writes the identity relation as

$$E_A =\frac{ E_F }{ D_E }=T.$$

The positive ledger then closes as

$$\boxed{ \Sigma E = E_F + E_A }$$

These relations give RSI a particular way to meet the accounting burden developed in Chapter 12. The field and anchor contributions have to be identified within one declared account. If the system exchanges the tracked quantity with its environment, those incoming and outgoing transfers must be included. If it is closed relative to that quantity, redistribution must be accounted for within the boundary. As before, any conservation claim also needs the physical law and conditions that warrant it.

The word positive describes this ledger convention. I’m not denying the usefulness of signed coordinates, orientations, charges, potentials, or conventional negative values in a physical representation. A negative potential may have a well-defined meaning relative to a chosen reference. It cannot supply an unexplained reservoir merely because a minus sign appears in the equation. RSI carries direction and orientation through the relevant closure terms and readouts while keeping the energy partition auditable.

This is also where the no-second-ledger result returns. Any source capable of supplying a real contribution, and any recipient capable of receiving one, belongs to total reality. A local system can draw on its environment because both belong to the same wider reality. Total reality cannot draw on a second reality outside itself.

That membership condition doesn’t derive every conservation law. The quantities, symmetries, equations, and regimes that establish a particular conservation result remain part of the physical work.

Geometry belongs to relations

Chapter 13, §13.4. ^[1]

A great deal can be assumed before we even finish saying the word distance. We may already be picturing objects placed inside an independently existing geometry, with that geometry serving as the stage on which forces act. In RSI, I begin with the physical relation whose geometry needs to be described.

That means identifying the participating identities and the boundary or interface joining them. A complete shell, a corridor, an overlap, and a relation among several anchors impose different requirements. We have to say which applies and which geometric quantity the ledger must cover. This geometry enters the carrier declaration before the gates are evaluated.

Explicit distance and area behavior belongs inside $A_P (\cdot)$. For a spherical shell relation, the standard helper form is

$$\boxed{ A_P (r)=4\pi r^{2}C }$$

where $C$ is the calibrated coefficient that converts the geometric requirement into the ledger units of the domain. Its units therefore depend on the declared normalization. The same coefficient must be retained when we test what that calibration predicts elsewhere in its regime.

If separation doubles while both the anchored budget and $C$ remain fixed, the shell requirement grows by a factor of four. The existence ratio then has the inverse-square dependence

$$S (r)=\frac{ E_A }{4\pi r^{2}C}.$$

The ratio changes because the interface requirement changes. RSI doesn’t obtain that dependence by weakening the energy per layer $T$ with distance or by turning recursion depth $D_E$ into a disguised radius. This establishes a scaling relation for the ratio. Recovering a measured acceleration or another observable also requires the corresponding domain mapping.

Recursion depth counts resolved recursive participation in the declared relation. It isn’t measured in meters. Distance may be correlated with that participation or used to map it in a particular application, but the two quantities retain different jobs.

Nor is every interface a complete sphere. A constrained overlap may admit only a corridor or local pocket, and a system with several anchors may require several active interfaces. Choosing one of these is a physical declaration that needs justification. We can revise it when evidence reveals a mistaken boundary or carrier. We then have to disclose the revision and test what follows from it, rather than treating a choice made to fit one answer as an independent prediction.

The dedicated RSI treatment retains a separately audited strong-domain contact-normalization exception with explicit $R^{2}$ structure. I don’t require every domain to use one shell formula. I require departures to have a stated physical role and their own checks, so that geometry doesn’t migrate unnoticed between equations.

The core physical roles

Chapter 13, §13.5. ^[1]

The full RSI Core 12 includes specialized strong- and weak-domain structure. Here I want to bring together the relations that make the common solver understandable. Each row identifies a physical role and the question it is meant to answer.

These relations have to be used at their declared levels. The bare anchor identity, the budget assembled from participating identities, and the closure of several anchors are different constructions. They can describe the same anchor budget only when the system definition and normalization make them equivalent. We cannot move between them just because the same symbol appears on the left.

For example, substituting the bare identity relations into the unregulated change ratio gives $D_c = D_E$. With positive integer recursion depth, that particular construction cannot by itself produce the stable band below one. A composite anchor budget or an engine-regulated capacity requires its own declared construction and solution. Distinguishing those cases tells us what must be calculated. It doesn’t make an unsuccessful calculation correct.

The underlying questions remain ordinary. We want to know what holds, what carries its account, and which relations participate when it changes. We then need to identify what persists through that change and what an observer can measure. The symbols help keep those questions from collapsing into one familiar word. My unification claim is that the same order of explanation should remain useful when different physical domains require different observable mappings.

Existence now and change next

Chapter 13, §13.6. ^[1]

The gates become useful together when we place them within a complete account. We first fix the physical system, its boundary, the participating anchors, and the candidate identity. On that declared carrier geometry, we build the positive ledger and evaluate admission through $S$. We can then interpret the change test $D_c$, applying engine, pacing, identity, and multi-anchor closure where required. The resulting persistence or reconfiguration verdict determines what the observable readout may report.

The recursive engine enters because a raw ratio may leave the channel and pacing of reconfiguration unresolved. RSI represents the engine schematically as

$$K =\sum_i\left(K_{\mathrm{ch},i}\, \theta _i\,D_{c,i}\right),$$

and writes the regulated change relation as

$$D_c =\frac{ E_F }{ K B_T }.$$

Here $K_{\mathrm{ch}}$ records the contribution of a participating closure channel. The dimensionless factor $\theta$ carries orientation or coherence information, including sign where the domain calls for it, while $B_T$ regulates boundary pacing. Their physical interpretation and normalization have to be declared for the application. In particular, the product $K B_T$ must supply an effective change capacity in the same ledger units as $E_F$.

Because the change contributions enter the engine that regulates change, these equations may require a self-consistent solution. Writing them in sequence doesn’t guarantee that a solution exists or that an iteration converges. The domain calculation has to establish the resulting closure and its behavior.

When several anchors participate, we also need an account of their joint membership and allocation. Splitting one budget into convenient pairwise pieces can conceal contributions counted twice or conditions that cannot hold together. RSI uses identity summation and multi-anchor closure to keep those relations in one account. Each partner belongs to the same physical whole, so what we assign to one relation must remain compatible with what we assign to the others.

Timing readouts follow the physical account

Chapter 13, §13.7. ^[1]

RSI treats a clock as a physical system whose changes can be compared with another process. The clock and its changing relations belong to the account from the beginning. What follows the solve is the reported comparison.

In RSI, a redshift is interpreted through a stability contrast, and a delay through accumulated pacing differences along declared paths. We first determine the relevant physical relation and then ask how it paces relative to another state, path, or detector. The basic shift diagnostic is

$$\boxed{ Z =\frac{\Delta S }{ S } }$$

For a comparison using the emitted state as the reference, the denominator is the emitted stability value and the difference is the observed value minus that reference. The corresponding ratio is

$$1+ Z =\frac{ S _{\mathrm{obs}}}{ S _{\mathrm{emit}}}.$$

This fixes the reference and sign of this diagnostic. Translating it into a frequency shift, clock-rate comparison, path delay, or spectral displacement still requires the appropriate calibrated observable map. The clock coordinate reports a difference whose proposed physical basis lies in the relation between the configurations.

Recursion depth $D_E$ matters here because it records participation in the declared system. It doesn’t replace distance. The anchor fixes the energy per layer $T$, the system fixes the participating depth, and explicit geometry remains in $A_P (\cdot)$. A timing calculation has to respect all of those roles when relating a clock, path, orbit, or photon to the stability terrain.

Different clocks can therefore register different pacing because they participate in different physical relations.

Vector readouts follow the physical account

Chapter 13, §13.8. ^[1]

The same distinction applies to arrows and field maps. A vector lets us report magnitude and direction, while a field map shows how a quantity varies across position or context. These representations are useful precisely because they make relations easier to inspect. Drawing them doesn’t yet identify the physical carrier responsible for what they report.

RSI’s scalar-first approach solves the declared stability and allocation terrain before comparing nearby or alternative resolved states. A directional diagnostic can then summarize the difference. For positive $S$, the canonical increasing-stability overlay uses a terrain potential $\Phi_{ S }=-\ln S$. Its descending direction is the increasing direction of $\ln S$, giving the schematic readout

$$\vec v_{\mathrm{readout}} \propto \nabla_{\! A_P }\,\ln S .$$

Here the gradient is evaluated in a declared representation of the solved carrier terrain. The carrier supplies the physical geometry needed for that comparison. The gradient operation supplies a direction of variation, while the domain mapping must establish its sign convention, scale, units, and relation to the measured quantity. It isn’t an additional source of energy or a complete acceleration law.

This direction matters even in the shell example. With the anchor budget and calibration fixed, stability decreases outward, so an increasing-stability arrow points inward. That establishes the orientation of this diagnostic. It doesn’t calculate the acceleration’s magnitude or determine an entire orbit.

A falling-object arrow therefore needs the local relation and its acceleration mapping. An orbital tangent also requires the resolved motion of the participating identity, since a radial stability gradient alone doesn’t specify a tangent. A lensing deflection field requires the propagation calculation on the declared terrain, and a halo profile requires the mapping from the support readout into that reconstruction. Each report has its own physical and mathematical conditions. We cannot replace those conditions with the general instruction to draw an arrow after solving.

Finite closure as a model example

Chapter 13, §13.9. ^[1]

The Finite Closure Band Theorem gives a bounded example of this order of explanation. ^[S16] We can begin with an ideal circle and ask how a finite system approximates it. Here the question begins with a native selector that determines which finite carrier the model admits. Only then do we compare its readout with the smooth representation,

$$\text{native selector} \longrightarrow \text{admitted finite carrier}$$ $$\Downarrow$$ $$\text{native readout} \longrightarrow \text{smooth shadow}.$$

Within the declared one-anchor, one-orbit weighted-core model, every selected finite recurring loop remains below the continuum ceiling,

$$\Pi_{\mathrm{carrier}}(N,\kappa)<\pi,$$

while the family approaches the ideal from below as the finite loop becomes smoother.

The theorem establishes that selection can precede the continuum comparison within this model. Its carrier geometry is already part of the native declaration on which the ledger and gates operate. What comes afterward is the smooth representational shadow. Calling the carrier admitted records the model’s verdict. Establishing that a physical system realizes the model requires the further physical and empirical connection.

That scope is useful in its own right. We can see how finite closure selects a carrier without treating an ideal circle as the object from which the physical system must be inferred. The result doesn’t require every physical domain to use the same loop family.

The annular-branch work carries this question into the galactic domain. Closure Cartography asks which native finite support carrier can account for rotation and lensing readouts, then subjects related onset, delay, and cluster proposals to their own tests. A spherical hidden-halo reconstruction is one description to explain, rather than an object whose primitive status we can assume from the start. ^[S17]

The application has its own empirical burdens. Its connection to the argument here is the order in which it asks what produces the reported structure.

This is the representational-shadow method from Chapter 4 made concrete enough to face a physical test.

Following a released apple through the solve

Chapter 13, §13.10. ^[1]

Let me bring the whole order together with an apple held above Earth and then released. We already know the familiar direction of its fall. The purpose here is to identify what RSI would have to account for to reproduce that result, beginning with the supported configuration and following what changes when the support is removed.

Declaring the system

Before release, the relevant configuration includes Earth, the apple, your hand or another support such as a table or branch, and the local interfaces among them. We also need the boundary within which we’re making the account. The apple is one identity participating in this relation among several anchors. Treating it as an isolated point can be a useful approximation, but that approximation doesn’t remove the support from the physical situation.

Choosing the carrier

Earth’s large-scale relation is represented through a shell-type carrier, while contact support is represented through a local interface or corridor. The shell describes one geometric requirement and the contact another. Keeping both explicit prevents a convenient distance factor from concealing the physical role of the support relation.

Building the ledger

On those carriers, the solve declares the anchor-side and field-side budgets while retaining the support contribution. We have to account for that contribution physically. The words gravity, law, and falling identify aspects of the problem, but none supplies an extra reservoir or substitutes for the relation we’re trying to explain.

Evaluating admission

The candidate is the apple remaining at rest at this location in the declared system formed by Earth, apple, and support. That is more specific than asking whether the apple exists. While the support is present, the complete carrier and ledger may admit this configuration because they include the contribution maintaining its local closure.

This is why a meaningful gate verdict needs a sufficiently explicit candidate. The identity of the apple and the persistence of this particular arrangement are related questions with different conditions.

Removing the support

Release removes the support interface from the source state. We now test whether the apple can remain at the same location and at rest without that relation. Starting a clock can record the release, but it is the changed physical configuration that makes a new calculation necessary. The earlier admission verdict cannot simply be carried over after one of its supporting conditions has gone.

Evaluating change and closure

The gates are recalculated under the new boundary conditions. If the unsupported configuration at rest cannot close, RSI must determine the successor through the participating channels and boundary pacing. The proposed account has to yield the apple’s new position, motion, and relation to Earth. Merely rejecting the old configuration doesn’t yet provide those quantities.

Constructing the readout

Once that physical calculation is complete, we can report its result as a downward acceleration arrow, trajectory, time series, Newtonian force overlay, or another calibrated observable. Its accuracy has to be checked against the measured motion. A successful arrow would summarize the relation that produced the motion. Drawing it would not add another cause.

We can now see why the support matters to the boundary and ledger, why release changes the admission question, and why the change verdict still needs a route to the observable motion. Each connection would otherwise be easy to hide inside the familiar statement that the apple falls because of gravity.

What RSI establishes and what it still has to earn

Chapter 13, §13.11. ^[1]

I judge RSI by the claim being made in the domain where it is made. The evidence standard distinguishes five burdens so that internal coherence, a recovered scaling relation, and a successful prediction don’t get reported as the same achievement.

Those burdens apply to different kinds of claims. A logical constraint has the arguments supporting it, a scoped theorem has its premises and proof, and a physical application has the measurements its calculation must meet. The following distinctions keep the reach of each visible.

RSI gives the philosophical framework a candidate physical implementation with identifiable carriers and a positive ledger. Its separate gates ask whether a configuration is admitted and whether it must change, while engine, pacing, identity, and multi-anchor relations supply the proposed closure. Geometry enters where the carrier requires it, and the readout must follow from the solved account.

The work that makes this architecture physically credible is equally concrete. Derivations have to close with coherent units. Calibrations have to remain usable across the cases they claim to cover. Predictions need numerical values, uncertainty estimates, and independent data comparisons. Reproducible calculations and stated failure conditions let other people test whether a result survives. Each success or failure then informs the claims that actually depend on it.

This is how an inquiry that includes gravity reaches beings with memories, needs, attachments, and capacities for action. A gravitational model doesn’t determine how to treat a person. A wider account of reality can nevertheless change what we understand a person to be, what they can know or control, and which conditions shape their decisions. Following those connections gives physics a place in the inquiry without asking a force law to answer the whole moral question.

Physical admission and stability concern a declared configuration. An arrangement can persist while harming the people within it. My commitment to reducing suffering requires attention to those people, including the chooser’s finite knowledge, time, capacity, personal stakes, and available alternatives. A defensible decision may still leave someone hurt and need not be immoral for that reason. We can recognize a better option, criticize a part of the decision, and care for those hurt without condemning the whole person. Understanding why they acted, assessing the choice, and responding to the harm each require the actual situation. The conditions that forced the choice may be what most needs changing. ^[S2]

Our response becomes part of that situation. An explanation can make information available, and preparation can alter what someone is able to do. Care or criticism can influence the next decision, just as institutional arrangements can narrow or widen the available options. Those contributions answer to the same practical standard through their effects on everyone involved. Recognizing that they are caused doesn’t make them idle, and recognizing that a choice was caused doesn’t automatically justify it. The account of Pattern Reality in Chapter 14 begins with the organized identities through which this further inquiry becomes possible.

Reading the equations and their conditions

The symbols have local physical jobs. I cannot identify two quantities merely because their numerical values coincide, or change a definition when moving from an atom to a galaxy. The following key helps keep those roles visible as the common architecture becomes a domain calculation. ^[1][2]

State, carrier, and budget

The declared configuration identifies what is being tested. E_A is its anchor-side budget, E_F its field-side budget, and A_P the carrier requirement in the same ledger units. A geometric area alone is not that normalized requirement. The same carrier and boundary must remain in force throughout a claimed comparison.

Depth and participation

D_E records recursion-depth participation, while U_i identifies the participating contributions in the identity sum. Q_i supplies the quota contribution in the multi-anchor closure. Those sums describe one anchor budget only under the shared-system conditions stated in Proposition A.68. They are not interchangeable merely because each is written as E_A.

Channels, orientation, and regulated capacity

K aggregates the participating channel terms. The orientation factor θ is not an undeclared distance law. In the regulated closure, the product K B_T must have the declared capacity and units required to be compared with E_F. A coupled solution still has to be constructed and tested; the equation’s appearance is not a convergence proof.

Admission, change, and readout

S tests support for the proposed identity. D_c supplies the change comparison under its declared construction. Z reports a stability contrast with its stated reference. None of those roles is identical with elapsed coordinate time, an acceleration, a force, or a moral evaluation. A further physical mapping must earn each additional claim.

The source imports the declared system and interface discipline of Finite Resolution, the transition requirements of the Causal-Resolution Burden, and the measurable obligations of the Physical Accounting Contract. Its deterministic architecture remains connected to the actual PPD argument and premises. Merely observing one outcome does not independently supply that stronger argument. ^[3][4]

The twelve rows state the source relations and their roles. They do not have to be used indiscriminately in every domain. Where a special construction, normalization, approximation, or readout is required, it must be declared rather than supplied silently by the familiar name of a phenomenon. The weak-domain row is a closure statement, not an extra algebraic formula omitted from the display. The two criteria and the two subsequent results retain that distinction.

Formal argument: RSI as a proposed physical model

The full Appendix A.10.1 passage follows: the Core 12, two criteria, a proposition, a theorem, both proofs, and the complete scope note. The source numbers are retained. These results state the required roles and conditional bridges, not an announcement that every physical domain has been validated. ^[2]

Questions about the physical bridge

Sources and further reading

The explanation follows the book’s complete physical-bridge account. Its historical references identify preserved contributions and benchmarks, not predecessors credited with holding RSI. EL, FMFG, and EG supply the connected philosophical arguments. RSI and the scoped physical applications retain their own mathematical, calibration, and observational burdens.

1. Matthew Tripp Zejda. Existential Ground, Chapter 13, “RSI as the Physical Bridge,” printed pp. 208–227. This is the explanatory source, including the examples, tables, figures, and scope statements. Book and reading access.
2. Matthew Tripp Zejda. Existential Ground, Appendix A, §A.10.1, “RSI as a proposed physical model,” printed pp. 433–436: the Core 12, Criteria A.66–A.67, Proposition A.68 and proof, Theorem A.69 and proof, and the complete scope note. Complete passage on this page.
3. Matthew Tripp Zejda. Existential Ground, Appendix A: the criterion against transferring warrant between claim levels; §A.9.1, Finite Resolution; §A.9.2, Causal-Resolution Burden; and §A.9.4, Physical Accounting Contract. These are inherited arguments, not numerical confirmations of RSI.
4. Matthew Tripp Zejda. Existential Logicism: A Logic-Based Engine for Navigating Reality, Persistent Present Determinism, Contingency Guillotine, and Deterministic Moral Forces. Finite Mind, Finite God develops the finite-interface, access, capacity, and fairness connections; Existential Ground, Chapters 14 and 16, develops maintained identity and caused agency.

The works cited in Chapter 13

• [S1] Matthew Tripp Zejda. (2026). Resolution state interface (RSI): Introduction to universal relativity by matthew tripp zejda. Zenodo. Version 5. Source record.
• [S2] Matthew Tripp Zejda. (2025). Existential logicism: A logic-based engine for navigating reality. Existential Logicism website. PDF manuscript. Source record.
• [S3] Isaac Newton. (1999). The principia: Mathematical principles of natural philosophy. University of California Press. Translation of the third edition (1726); the Scholium to the Definitions distinguishes absolute from relative time. Source record.
• [S4] Joseph-Louis Lagrange. (1997). Analytical mechanics. Kluwer Academic Publishers. English edition of the work first published as <i>Mécanique analytique</i>. Source record.
• [S5] William Rowan Hamilton. (1834). On a general method in dynamics; by which the study of the motions of all free systems of attracting or repelling points is reduced to the search and differentiation of one central relation, or characteristic function. Philosophical Transactions of the Royal Society of London. 124. 247-308. Source record.
• [S6] Michael Faraday. (1852). On the physical character of the lines of magnetic force. The London, Edinburgh, and Dublin Philosophical Magazine and Journal of Science. 3. 401-428. Source record.
• [S7] James Clerk Maxwell. (1873). A treatise on electricity and magnetism. Clarendon Press.
• [S8] Albert Einstein. (1905). Zur elektrodynamik bewegter körper. Annalen der Physik. 322. 10. 891-921. English title: “On the Electrodynamics of Moving Bodies.”. Source record.
• [S9] Werner Heisenberg. (1925). Über quantentheoretische umdeutung kinematischer und mechanischer beziehungen. Zeitschrift für Physik. 33. 879-893. Source record.
• [S10] Erwin Schrödinger. (1926). Quantisierung als eigenwertproblem. Annalen der Physik. 384. 4. 361-376. Source record.
• [S11] Max Born. (1926). Zur quantenmechanik der stoßvorgänge. Zeitschrift für Physik. 37. 863-867. Source record.
• [S12] Claude E. Shannon. (1948). A mathematical theory of communication. The Bell System Technical Journal. 27. 3–4. 379-423, 623-656. Published in two parts, July and October 1948. Second-part DOI: https://doi.org/10.1002/j.1538-7305.1948.tb00917.x. Source record.
• [S13] Alan M. Turing. (1937). On computable numbers, with an application to the entscheidungsproblem. Proceedings of the London Mathematical Society. 42. 1. 230-265. Received 28 May 1936 and read 12 November 1936. Source record.
• [S14] Konrad Zuse. (1969). Rechnender raum. Friedrich Vieweg & Sohn. English translation published as <i>Calculating Space</i>, MIT Technical Translation AZT-70-164-GEMIT, 1970. Source record.
• [S15] Edward Fredkin. (1990). Digital mechanics: An informational process based on reversible universal cellular automata. Physica D: Nonlinear Phenomena. 45. 1–3. 254-270. Source record.
• [S16] Matthew Tripp Zejda. (2026). The finite closure band theorem and the continuum pi ceiling. Unpublished theorem manuscript; included in the finite-closure treatment of the Resolution State Interface.
• [S17] Matthew Tripp Zejda. (2026). Closure cartography and the annular branch: A unified-terrain replacement candidate for dark matter support in disk galaxies that can potentially survive the bullet cluster. Zenodo. Version 3. Source record.