| 1. Domain | 1.1 Scope of the Domain | Boundaries | The range of phenomena the science includes and excludes. | Studies the proof-theoretic strength of formal systems by assigning ordinals or comparable measures of transfinite complexity. Includes ordinal assignments, well-ordering principles, reflection principles, consistency strength comparisons, and calibration of theories via transfinite induction. Excludes semantic model-theoretic strength measures except as tools for ordinal characterization. |
| | Scale | The spatial, temporal, or organizational level at which the science operates (e.g., quantum, cellular, social, cosmic). | Operates at transfinite ordinal levels, proof-theoretic hierarchies, levels of induction or recursion, reflection height, and systems ranging from arithmetic to large-cardinal-adjacent frameworks. |
| 1.2 Ontological Commitments | Entities | The kinds of things assumed to exist within the domain (particles, organisms, agents, fields, etc.). | Ordinals (up to and beyond ε₀, Γ₀, Bachmann–Howard, and larger systems), well-orderings, proof-theoretic hierarchies, reflection schemas, induction rules, recursive function hierarchies, combinatorial principles (e.g., WOP(α)). |
| | Properties | The fundamental attributes these entities possess (mass, charge, genotype, preference, etc.). | Well-foundedness, order type, transfinite rank, reflection height, induction strength, consistency strength, reducibility, ordinal collapsing behavior, recursion-theoretic growth rates. |
| | Categories | The basic ontological types used to classify domain elements (substances, processes, relations, structures). | Ordinal notation systems, proof-theoretic ordinals, classification of theories by strength, reflection principles, induction schemas, recursion hierarchies (fast-growing, slow-growing), collapsing functions. |
| 1.3 State-Variables | Variables | The measurable or definable properties that describe system conditions. | Assigned ordinal, rank of induction, reflection level, complexity class of recursion, proof length relative to ordinal bounds, depth of the ordinal notation system used. |
| | Parameterization | How variables encode and represent the system’s state. | Encoded through ordinal notations (Veblen hierarchy, collapsing functions, ψ-systems), reflection schemas, induction parameters, recursion-theoretic measures, and hierarchies of combinatorial principles with known ordinal calibrations. |
| 1.4 Admissible Idealizations | Simplifications | Conceptual reductions used to make the domain tractable (point masses, rational agents, perfect gases). | Idealizing ordinal notations (compressing collapsing systems), restricting to canonical representatives for large ordinals, simplifying reflection schemas, abstracting induction strength, replacing full hierarchies with subsystems. |
| | Validity Conditions | The limits and contexts in which idealizations hold or break down. | Idealizations break down when analyzing very large ordinals, non-wellfounded behavior, incomplete collapsing systems, or when ordinal notations require fine-grained distinctions beyond simplified representations. |
| 1.5 Domain Assumptions | Structural Assumptions | Background ontological stances such as determinism, continuity, randomness, discreteness. | Formal systems have well-defined proof-theoretic ordinals; ordinal assignments correlate with induction/recursion strength; well-ordering principles reflect the relative strength of theories; reflection schemas encode transfinite power. |
| | Implicit Commitments | Unstated but necessary assumptions that shape the field’s conceptual structure. | Assumes ordinals are well-founded; assumes ordinal notations accurately reflect conceptual transfinite strength; assumes collapsing functions behave consistently; presumes existence of canonical ordinal benchmarks. |
| 1.6 Internal Coherence Requirements | Consistency | The demand that domain concepts do not contradict one another. | Consistency strength comparisons must align with ordinal calibrations; ordinal assignments must not contradict known hierarchies; collapsing systems must yield well-founded representations. |
| | Compatibility | The requirement that entities, variables, and assumptions fit together into a unified descriptive framework. | Requires coherence among ordinal notation systems, reflection schemas, induction principles, recursion hierarchies, and the meta-theoretic framework relating formal theories to their assigned ordinal strength. |
| 2. Evidence Layer | 2.1 Observable Phenomena | Observables | The aspects of the domain that can produce detectable signals accessible to measurement. | Ordinal assignments to theories, proof-theoretic reductions, termination of transfinite induction, collapsing-function behavior, derivation length bounds, reflection principle activation, growth-rate comparisons in recursive hierarchies. |
| | Detection Limits | The boundaries of what can be resolved or sensed by current instruments or methods. | Restricted by complexity of ordinal notation systems, undecidability of well-orderings at high levels, inability to compute collapsing functions past certain ordinals, and the limits of formal proof-checking at extreme transfinite heights. |
| 2.2 Measurement Systems | Units | Standardized quantifications (meters, seconds, volts, decibels, dollars, etc.) necessary for consistent comparison. | Ordinal height, order type, induction level, reflection rank, recursion-growth class, proof-length bounds parameterized by ordinal size, fast-growing hierarchy indices (e.g., F_α). |
| | Instruments | Devices and tools (microscopes, spectrometers, sensors, surveys, detectors) used to produce measurements. | Ordinal notation generators, collapsing-function calculators, proof assistants with ordinal-analysis modules, automated systems for reflection checking, recursion-theoretic analyzers, well-ordering verification tools. |
| 2.3 Operational Definitions | Definitions | Terms defined by specific measurement procedures, ensuring empirical clarity. | Ordinal assignment defined via proof-theoretic transformations; induction level defined by the maximal ordinal supporting transfinite induction; reflection strength defined relative to schemas; recursion growth defined via fast/slow-growing hierarchies. |
| | Procedures | The explicit steps required to perform a measurement in a reproducible way. | Constructing ordinal notations, performing cut-elimination relative to ordinal bounds, executing transfinite induction proofs, computing collapsing mappings, verifying consistency strength reductions, analyzing reflection iterations. |
| 2.4 Data Acquisition | Protocols | Formal processes for gathering data under controlled or standardized conditions. | Standardized ordinal-derivation workflows, canonical collapsing-function computations, structured proof-theoretic reduction sequences, controlled tests of induction strength, systematic verification of well-ordering proofs. |
| | Sampling | Rules determining which subset of the domain is measured and how representative it is. | Selecting representative theories (arithmetic fragments, comprehension schemes, reflection principles), sampling ordinal notations across hierarchical levels, analyzing typical ordinal collapses, testing reflection formulas of varying strength. |
| 2.5 Data Character & Format | Data Types | The form raw evidence takes (time series, spectra, images, counts, qualitative records). | Ordinal notation strings, collapsing-function outputs, reflection traces, induction trees, proof-length growth curves, recursion-hierarchy indices, consistency strength reductions. |
| | Resolution | The granularity or precision with which data is captured. | Determined by granularity of ordinal notations, precision of collapsing-function implementation, detail level of transfinite recursion, and the expressive strength of the proof assistant or analytic framework. |
| 2.6 Reliability & Calibration | Calibration | Adjustment procedures ensuring instruments produce accurate results. | Verifying well-foundedness of ordinal notations, validating collapsing functions, confirming correctness of transfinite-induction steps, checking consistency of reflection hierarchies, aligning ordinal analyses across different frameworks. |
| | Error Characterization | Identification and quantification of noise, uncertainty, bias, and measurement error. | Misclassified ordinals, incorrect collapsing-function outputs, non-wellfounded notations, flawed reflection calculations, termination failures in induction proofs, discrepancies between ordinal systems across tools. |
| 3. Structural Layer | 3.1 Patterns & Regularities | Laws / Relations | Stable, repeatable patterns governing how observables behave across conditions. | Ordinal assignment laws (e.g., systems of arithmetic ↔ ε₀; predicative systems ↔ Γ₀; impredicative systems ↔ Bachmann–Howard); consistency-strength relations; reflection–ordinal correspondences; transfinite induction behavior across ordinal levels; recursion-growth laws (fast-growing vs. slow-growing). |
| | Invariants | Quantities or properties that remain constant under transformations (symmetries, conservation laws). | Well-foundedness of ordinal notations; consistency-strength monotonicity; invariance of ordinal assignments under proof-theoretic reductions; stable order-type relationships across equivalent theories; invariance of collapsing-function structure. |
| 3.2 Causal Architecture | Mechanisms | Underlying processes or structures that produce the observed regularities. | Cut-elimination driving ordinal reduction; collapsing functions controlling ordinal size; transfinite induction as the mechanism determining provability strength; reflection principles generating ordinal jumps; recursion hierarchies controlling growth behavior. |
| | Pathways | Organized sequences of interactions forming a causal chain or network. | Cut-elimination → ordinal reduction → normalized proof; collapsing-function chains mapping large ordinals to manageable notations; induction up to α → proof power up to α; reflection iteration → strength increase; recursion progression through fast-growing hierarchies. |
| 3.3 Theoretical Vocabulary | Concepts | Core terms that encode the domain’s structure (force, gene, equilibrium, field). | Ordinal notations, collapsing functions, proof-theoretic ordinals, consistency strength, induction rank, reflection height, well-ordering principles (WOP(α)), fast-growing hierarchies (F_α), ordinal-indexed recursion, transfinite induction. |
| | Classifications | Taxonomies, categories, or typologies that organize entities and relations. | Predicative vs. impredicative strength, arithmetic vs. set-theoretic ordinals, large ordinal frameworks, collapsible vs. non-collapsible ordinals, reflection-based classifications, hierarchies of inductive definitions, recursion-based classifications (slow/fast-growing). |
| 3.4 Formal Representations | Equations | Mathematical constructs expressing laws, relations, or mechanisms. | Ordinal equations defining collapsing functions (ψ-systems), Veblen hierarchy equations, fast-growing hierarchy definitions (F_α(n)), induction reflection equivalences, order-type equations. |
| | Models | Structured representations—mathematical, computational, or conceptual—used to predict and explain phenomena. | Ordinal notation systems (Veblen functions, ψ-collapsing), recursion-theoretic growth models, proof-transformation models tied to ordinal reduction, reflection hierarchies, well-ordering models of theories, ordinal-indexed semantic approximations. |
| 3.5 Idealized Structures | Simplified Models | Purposeful abstractions that capture essential dynamics while omitting irrelevant detail. | Truncated ordinal hierarchies, simplified collapsing functions, canonical ordinal representatives (ε₀, Γ₀, BH), restricted reflection schemas, bounded induction systems, finite approximations to fast-growing hierarchies. |
| | Limit Conditions | Regimes where specific models or approximations hold (classical vs. quantum, linear vs. nonlinear). | Break down at very large ordinals requiring stronger collapsing mechanisms; failure of simplified notations; non-wellfounded anomalies near ordinal limits; inadequacy of subrecursive hierarchies for impredicative theories; inability to normalize beyond certain ordinal heights. |
| 3.6 Integrative Frameworks | Unifying Theories | Higher-order structures that connect disparate laws or mechanisms under a coherent whole. | The proof-theoretic ordinal hierarchy as a unifier of theory strength; collapsing-function frameworks; ordinal analysis of reflection principles; connections between recursion-theoretic growth and provability; well-ordering principles as global organizing schemes. |
| | Interdisciplinary Links | Points where the theory connects to adjacent sciences or larger explanatory systems. | Links to recursion theory (fast-growing hierarchies), combinatorics (well-ordering principles), set theory (large-cardinal-adjacent ordinals), computational complexity (growth-rate classifications), type theory (inductive definitions), and constructive mathematics. |
| 4. Method Layer | 4.1 Inquiry Design | Experimental Design | Structured plans for manipulating variables to test causal claims. | Manipulating ordinal notation systems, varying collapsing functions, adjusting reflection schemas, bounding induction levels, altering recursion hierarchies, and modifying proof-transformations to test effects on assigned ordinal strength. |
| | Observational Design | Systematic approaches for gathering non-manipulated data (surveys, field studies, natural experiments). | Observing behavior of collapsing functions, tracking transfinite induction performance, monitoring proof-length growth, examining well-ordering properties, and recording how reflection principles alter ordinal height without changing the system. |
| 4.2 Testing & Validation | Hypothesis Testing | Procedures for evaluating whether evidence supports or contradicts specific claims. | Testing whether a formal system corresponds to a given ordinal, checking whether a collapsing function correctly generates an expected ordinal, evaluating equivalence between ordinal-reduction procedures, and verifying consistency-strength comparisons. |
| | Replication | The requirement that results be independently reproducible under similar conditions. | Recomputing ordinal assignments across independent notation systems, replicating collapsing-function outputs, re-running induction proofs up to specific ordinals, validating reflection-based strength measurements, and confirming consistency-strength reductions across different frameworks. |
| 4.3 Inference & Evaluation | Statistical Inference | Rules for drawing conclusions from noisy or incomplete data. | Analyzing growth-rate patterns, comparing relative sizes of ordinals via recursion hierarchies, examining distribution of proof lengths relative to ordinal bounds, and evaluating consistency-strength changes across sampled theories. |
| | Model Comparison | Criteria (fit, simplicity, predictive accuracy, robustness) used to evaluate competing models. | Comparing ordinal notation systems, evaluating strength differences between theories, checking robustness of ordinal assignments under alternative collapses, comparing recursion-growth models (fast vs. slow hierarchies), and assessing simplicity vs. expressive power of ordinal frameworks. |
| 4.4 Error Management | Error Analysis | Identification and quantification of random and systematic errors. | Identifying miscalculated ordinal notations, detecting non-wellfounded constructions, spotting incorrect collapsing outputs, finding errors in reflection-level indexing, and diagnosing failures in transfinite induction computations. |
| | Bias Control | Methods for minimizing subjective, instrumental, or procedural biases. | Avoiding over-reliance on a single notation system, ensuring neutral comparison across frameworks, preventing collapse-function bias, standardizing reflection schemas, and controlling researcher-dependent choices in ordinal representation. |
| 4.5 Adjudication & Revision | Peer Scrutiny | Collective evaluation of claims through critique, review, and debate. | Cross-verifying ordinal assignments, reviewing collapsing-function definitions, critiquing reflection schemas, checking transfinite induction correctness, comparing results across proof theorists, and evaluating reductions between theories. |
| | Theory Revision | Procedures for modifying, replacing, or discarding models based on new evidence. | Updating ordinal notation systems, refining collapsing functions, modifying reflection principles, adjusting induction schemas, strengthening or weakening theory formulations based on new ordinal evidence, and repairing inconsistencies in ordinal assignments. |
| 4.6 Integrity Conditions | Transparency | Requirements to disclose methods, data, assumptions, and limitations. | Full disclosure of ordinal notations, collapsing mechanisms, reflection schema definitions, recursion hierarchies, induction procedures, and proof-transformation steps that justify ordinal assignments. |
| | Ethical Standards | Norms ensuring responsible conduct in experimentation, data handling, and publication. | Honest reporting of ordinal bounds, avoiding concealed assumptions about well-foundedness, maintaining reproducible transfinite computations, documenting limitations of notation systems, and clearly stating unresolved ordinal-identification issues. |