| 1. Domain | 1.1 Scope of the Domain | Boundaries | The range of phenomena the science includes and excludes. | Studies forcing extensions, independence proofs, Boolean-valued models, generic filters, preservation theorems, combinatorial independence, and relative consistency results. Excludes absolute results provable within ZFC unless used as contrast; does not cover constructive forcing unless explicitly adopted. |
| | Scale | The spatial, temporal, or organizational level at which the science operates (e.g., quantum, cellular, social, cosmic). | Operates at the meta-mathematical and universe-construction scale: models of ZFC, forcing posets, generic extensions, Boolean algebras, names, and rank-assigned interpretations. |
| 1.2 Ontological Commitments | Entities | The kinds of things assumed to exist within the domain (particles, organisms, agents, fields, etc.). | Forcing posets ((\mathbb{P}, \leq)), conditions, dense sets, filters, generics, names, valuations, Boolean-valued models, complete Boolean algebras, ground models, forcing extensions. |
| | Properties | The fundamental attributes these entities possess (mass, charge, genotype, preference, etc.). | Genericity, preservation, absoluteness, chain conditions (ccc, properness), closure properties, cardinal preservation, definability, forcing equivalence, independence strength. |
| | Categories | The basic ontological types used to classify domain elements (substances, processes, relations, structures). | Forcing notions (ccc, proper, semi-proper, closed, strategically closed), Boolean algebras, names, ground models, intermediate models, equivalence classes of forcing notions. |
| 1.3 State-Variables | Variables | The measurable or definable properties that describe system conditions. | Forcing conditions, generic filters, rank levels of names, valuations, cardinal characteristics, chain-condition parameters, closure degrees. |
| | Parameterization | How variables encode and represent the system’s state. | Encoding states via forcing posets, generic filters, Boolean values, valuation functions, rank of names, and definability of statements across ground and extension models. |
| 1.4 Admissible Idealizations | Simplifications | Conceptual reductions used to make the domain tractable (point masses, rational agents, perfect gases). | Treat generics as existent (via meta-theory), ignore coding overhead of names, idealize completeness of Boolean algebras, assume transitivity of ground models, and treat ZFC as background. |
| | Validity Conditions | The limits and contexts in which idealizations hold or break down. | Fail in non-well-founded settings, in models without Choice, when chain-condition assumptions collapse, or when forcing destroys structure required for definability or absoluteness. |
| 1.5 Domain Assumptions | Structural Assumptions | Background ontological stances such as determinism, continuity, randomness, discreteness. | Assumes classical ZFC, transitive ground models, well-foundedness, definability of names/valuations, existence of generic filters in meta-theory, and stability of truth across rank levels. |
| | Implicit Commitments | Unstated but necessary assumptions that shape the field’s conceptual structure. | Assumes meta-theoretic existence of generics; that forcing accurately simulates universe extensions; that independence proofs reflect genuine structural limitations of ZFC; that the hierarchy of forcing methods is coherent. |
| 1.6 Internal Coherence Requirements | Consistency | The demand that domain concepts do not contradict one another. | Requires that forcing constructions produce models satisfying ZFC; Boolean algebras must yield coherent Boolean-valued models; independence results cannot contradict established consistency bounds. |
| | Compatibility | The requirement that entities, variables, and assumptions fit together into a unified descriptive framework. | Requires compatibility across forcing extensions, preservation theorems, chain conditions, Boolean-valued semantics, rank structure, and definability systems connecting ground models and extensions. |
| 2. Evidence Layer | 2.1 Observable Phenomena | Observables | The aspects of the domain that can produce detectable signals accessible to measurement. | Cardinal changes across forcing extensions, collapse phenomena, preservation or destruction of combinatorial principles, truth-value variation of statements (e.g., CH), behavior of generic filters, Boolean truth values, absoluteness patterns. |
| | Detection Limits | The boundaries of what can be resolved or sensed by current instruments or methods. | ZFC’s inability to decide CH or other independent statements; inability to detect generic filters internally; first-order limits preventing observation of meta-theoretic forcing; constraints of definability and rank-based coding. |
| 2.2 Measurement Systems | Units | Standardized quantifications (meters, seconds, volts, decibels, dollars, etc.) necessary for consistent comparison. | Cardinal characteristics, chain conditions (ccc, properness), closure degrees, Boolean truth values, ranks of names, lengths of forcing iterations, complexity of posets. |
| | Instruments | Devices and tools (microscopes, spectrometers, sensors, surveys, detectors) used to produce measurements. | Forcing posets, names, valuations, Boolean algebras, dense sets, generic filters (in the meta-theory), iterated forcing machinery, preservation theorems, absoluteness tests. |
| 2.3 Operational Definitions | Definitions | Terms defined by specific measurement procedures, ensuring empirical clarity. | Definitions of forcing relations (\Vdash), names, valuations, dense sets, genericity, Boolean-valued truth, iteration schemes, reduction from forcing to Boolean-valued models. |
| | Procedures | The explicit steps required to perform a measurement in a reproducible way. | Constructing posets, producing names, evaluating truth via valuations, building generic filters externally, performing iterated forcing, checking preservation or collapse of cardinals, verifying absoluteness. |
| 2.4 Data Acquisition | Protocols | Formal processes for gathering data under controlled or standardized conditions. | Building forcing extensions, generating Boolean-valued models, constructing intermediate models, applying preservation theorems, performing comparison of outcomes across different forcings. |
| | Sampling | Rules determining which subset of the domain is measured and how representative it is. | Selecting representative forcing notions, sampling dense sets for genericity, examining names of varying ranks, analyzing extension behavior across alternative posets, evaluating changes to multiple cardinals or combinatorial properties. |
| 2.5 Data Character & Format | Data Types | The form raw evidence takes (time series, spectra, images, counts, qualitative records). | Names, Boolean values, forcing diagrams, extension lattices, iteration trees, cardinal-change tables, preservation charts, rank-calculation diagrams. |
| | Resolution | The granularity or precision with which data is captured. | Determined by rank of names, granularity of Boolean algebras, chain-condition precision, closure depth, and expressibility of forcing relations within the meta-theory. |
| 2.6 Reliability & Calibration | Calibration | Adjustment procedures ensuring instruments produce accurate results. | Checking that forcing preserves ZFC; ensuring well-foundedness of extensions; validating correctness of forcing relations; recalibrating posets for cardinal preservation; verifying absoluteness under known frameworks. |
| | Error Characterization | Identification and quantification of noise, uncertainty, bias, and measurement error. | Ill-founded extensions, misidentified generic filters, incorrect forcing relations, miscoded names, collapse of unintended cardinals, failure of preservation theorems, errors in iteration strategies. |
| 3. Structural Layer | 3.1 Patterns & Regularities | Laws / Relations | Stable, repeatable patterns governing how observables behave across conditions. | Preservation theorems; collapse behaviors; absoluteness patterns; genericity laws; forcing equivalence; chain-condition relationships; stability of forcing axioms under iteration. |
| | Invariants | Quantities or properties that remain constant under transformations (symmetries, conservation laws). | Cardinal invariants preserved under forcing; cofinalities; closure properties; forcing equivalence classes; Boolean values of absolute statements; rank invariants of names. |
| 3.2 Causal Architecture | Mechanisms | Underlying processes or structures that produce the observed regularities. | Forcing mechanisms generating new sets; Boolean-valued semantics driving truth conditions; generic filter construction; iteration mechanisms creating long forcing sequences; preservation mechanisms ensuring ZFC holds in extensions. |
| | Pathways | Organized sequences of interactions forming a causal chain or network. | Forcing iteration trees; Boolean algebra completions; chain-condition pathways; extension ladders; embedding-inspired pathways for advanced forcing (e.g., extender-based forcing). |
| 3.3 Theoretical Vocabulary | Concepts | Core terms that encode the domain’s structure (force, gene, equilibrium, field). | Forcing, names, valuations, generic filters, dense sets, Boolean-valued models, preservation, collapse, absoluteness, iteration, chain conditions (ccc, proper, closed), forcing axioms. |
| | Classifications | Taxonomies, categories, or typologies that organize entities and relations. | Types of forcing (ccc, proper, semi-proper, κ-closed, stationary-preserving, Suslin, random, Cohen, Sacks, Laver); forcing equivalence classes; independence classifications; Boolean algebra completions. |
| 3.4 Formal Representations | Equations | Mathematical constructs expressing laws, relations, or mechanisms. | Forcing relation (p \Vdash \varphi); Boolean-value equations; iteration formulas; collapse definitions; definitions of chain conditions; absoluteness conditions; embedding characterizations for advanced forcing notions. |
| | Models | Structured representations—mathematical, computational, or conceptual—used to predict and explain phenomena. | Ground models, generic extensions, Boolean-valued models, intermediate models, iterated-forcing models, collapse models, models witnessing independence of CH or other statements. |
| 3.5 Idealized Structures | Simplified Models | Purposeful abstractions that capture essential dynamics while omitting irrelevant detail. | Toy posets (finite conditions), canonical Cohen/Random forcing models, simplified Boolean-valued universes, basic iterated extensions, pedagogical versions of collapse forcing. |
| | Limit Conditions | Regimes where specific models or approximations hold (classical vs. quantum, linear vs. nonlinear). | Forcing fails under non-well-foundedness; loss of Choice under certain forcings; non-preservation of cardinals; failure of chain conditions; breakdown of absoluteness at high complexity levels; improper iteration. |
| 3.6 Integrative Frameworks | Unifying Theories | Higher-order structures that connect disparate laws or mechanisms under a coherent whole. | Boolean-valued semantics; forcing axioms (MA, PFA, MM); absoluteness theory; iterated forcing theory; generic absoluteness frameworks; connections to large-cardinal strength. |
| | Interdisciplinary Links | Points where the theory connects to adjacent sciences or larger explanatory systems. | Links to model theory (Boolean-valued models), recursion theory (coding), descriptive set theory (absoluteness), large-cardinal theory (forcing strength), topology (forcing as neighborhood/approximation system), and proof theory (consistency proofs). |
| 4. Method Layer | 4.1 Inquiry Design | Experimental Design | Structured plans for manipulating variables to test causal claims. | Altering forcing notions, adjusting chain conditions (ccc, properness, closure), modifying iterated forcing schemes, and varying Boolean algebras to test preservation, collapse, or independence behavior. |
| | Observational Design | Systematic approaches for gathering non-manipulated data (surveys, field studies, natural experiments). | Studying forcing extensions without altering the poset; observing cardinal changes, truth-value shifts, absoluteness behavior, preservation failures, or structural differences between ground and extension models. |
| 4.2 Testing & Validation | Hypothesis Testing | Procedures for evaluating whether evidence supports or contradicts specific claims. | Checking whether a poset preserves cardinals, testing absoluteness of statements, verifying correctness of forcing relations (p \Vdash \varphi), determining collapse behavior, validating consistency or independence results. |
| | Replication | The requirement that results be independently reproducible under similar conditions. | Rebuilding forcing extensions with different codings; repeating chain-condition checks; reproducing collapses or preservations; iterating forcing to confirm stability of independence outcomes across different ground models. |
| 4.3 Inference & Evaluation | Statistical Inference | Rules for drawing conclusions from noisy or incomplete data. | Logical analogues: analyzing frequencies of preservation vs. collapse, comparing effects of different forcings on cardinal characteristics, evaluating patterns of absoluteness across hierarchies, assessing sensitivity of statements to forcing. |
| | Model Comparison | Criteria (fit, simplicity, predictive accuracy, robustness) used to evaluate competing models. | Comparing ground models with their forcing extensions; comparing the impact of different posets (Cohen vs. random vs. Sacks vs. Laver); evaluating relative strength of independence results; assessing robustness of iterated forcing schemes. |
| 4.4 Error Management | Error Analysis | Identification and quantification of random and systematic errors. | Identifying faulty forcing relations, misconstructed names, incorrect valuations, failure of preservation theorems, misidentified generic filters, non-well-founded extensions, and improper iteration strategies. |
| | Bias Control | Methods for minimizing subjective, instrumental, or procedural biases. | Avoiding selective choice of posets that artificially enforce desired outcomes; ensuring fair comparison across forcing notions; not privileging particular ground models; avoiding meta-theoretic assumptions that guarantee generic existence. |
| 4.5 Adjudication & Revision | Peer Scrutiny | Collective evaluation of claims through critique, review, and debate. | External evaluation of forcing constructions, independence proofs, preservation arguments, chain-condition verifications, and iterated forcing frameworks by experts in set theory. |
| | Theory Revision | Procedures for modifying, replacing, or discarding models based on new evidence. | Revising forcing definitions; adjusting iteration trees; refining Boolean-algebra completions; updating preservation theorems; modifying independence frameworks in response to discovered inconsistencies or stronger axioms. |
| 4.6 Integrity Conditions | Transparency | Requirements to disclose methods, data, assumptions, and limitations. | Full disclosure of forcing definitions, Boolean-valued semantics, chain-condition assumptions, iteration methods, absoluteness claims, and all meta-theoretic dependencies. |
| | Ethical Standards | Norms ensuring responsible conduct in experimentation, data handling, and publication. | Accurate reporting of independence proofs, explicit acknowledgment of consistency assumptions, avoidance of overstating generality of results, and proper attribution of forcing techniques and theorems. |