def
definition
main
show as:
view math explainer →
open explainer
Read the cached plain-language explainer.
open lean source
IndisputableMonolith.URCAdapters.Audit on GitHub at line 129.
browse module
All declarations in this module, on Recognition.
explainer page
depends on
used by
-
argon_ea_zero -
galerkinNS_hasDerivAt_duhamelRemainder_mode -
nsDuhamel_of_forall -
nsDuhamel_of_forall_kernelIntegral_of_forcing -
consistent_completeStateFrom -
Jcost_is_calibrated -
main -
main -
P_forced_to_RCL -
dalembert_deriv_ode -
xi_derived -
rar_power_law_emergence -
dirichletForm_edgeArea -
bounded_Jcost_bounded_max -
PhiLadderCutoffCert -
six_almost_prime_threehundredfiftytwo -
linking_selection_principle -
eight_tick_compactification -
endpoint_classification -
radius_sublinear -
riemann_lowered_pair_exchange -
log_sum_inequality
formal source
126def runAudit : IO Unit := do
127 IO.println audit_json_report
128
129def main : IO Unit := runAudit
130
131end URCAdapters
132end IndisputableMonolith
133
134def main : IO Unit := IndisputableMonolith.URCAdapters.runAudit