| 1. Domain | 1.1 Scope of the Domain | Boundaries | The range of phenomena the science includes and excludes. | Studies algebraic structures in complete generality, defined by sets equipped with operations of specified arities. Includes groups, rings, lattices, modules, Boolean algebras, semigroups, algebras over fields, and all structures definable by operations and identities. Excludes analytic, topological, and measure-theoretic structure unless encoded algebraically; excludes systems defined by partial operations unless explicitly extended. |
| | Scale | The spatial, temporal, or organizational level at which the science operates (e.g., quantum, cellular, social, cosmic). | Operates at the level of signatures (operation symbols + arities), equational theories, term algebras, homomorphisms, congruences, free algebras, varieties, quasivarieties, and categorical abstractions linking all algebraic systems. |
| 1.2 Ontological Commitments | Entities | The kinds of things assumed to exist within the domain (particles, organisms, agents, fields, etc.). | Carrier sets, operations, term functions, identities (equations), homomorphisms, subalgebras, quotient algebras, congruence relations, free algebras, varieties, clones of operations. |
| | Properties | The fundamental attributes these entities possess (mass, charge, genotype, preference, etc.). | Closure under operations; satisfaction of identities; homomorphic images; subalgebra closure; congruence permutability/modularity; existence of free objects; equational definability; algebraic invariants dependent solely on operations and identities. |
| | Categories | The basic ontological types used to classify domain elements (substances, processes, relations, structures). | Single-sorted vs multi-sorted algebras; varieties (HSP classes); quasivarieties; congruence-distributive/permutable algebras; clones; algebraic theories; term algebras; finitely generated vs infinitely generated algebras. |
| 1.3 State-Variables | Variables | The measurable or definable properties that describe system conditions. | Chosen signature; arity configuration; current term expressions; selected congruence; generating set; basis of free algebra; identity set; structural parameters defining a given variety. |
| | Parameterization | How variables encode and represent the system’s state. | Encoded via operation signatures, term-rewriting rules, equational axioms, congruence relations, homomorphic images, free-algebra generators, categorical semantics (Lawvere theories, monads). |
| 1.4 Admissible Idealizations | Simplifications | Conceptual reductions used to make the domain tractable (point masses, rational agents, perfect gases). | Restricting to finitary operations; focusing on single-sorted structures; assuming equational completeness; treating congruence lattices as modular or distributive; limiting to finitely generated free algebras; ignoring computational complexity of term rewriting. |
| | Validity Conditions | The limits and contexts in which idealizations hold or break down. | Fail in infinitary settings; multi-sorted interactions may break simplifications; non-equational theories exceed the framework; congruence lattices may fail to be manageable; some algebraic structures resist classification via equational reasoning alone. |
| 1.5 Domain Assumptions | Structural Assumptions | Background ontological stances such as determinism, continuity, randomness, discreteness. | Operations are total and well-defined; identities describe structure entirely; homomorphisms preserve operations; congruences classify quotients; free algebras exist for all signatures; HSP (Homomorphic images, Subalgebras, Products) axioms define varieties. |
| | Implicit Commitments | Unstated but necessary assumptions that shape the field’s conceptual structure. | Assumes all relevant structure is expressible equationally; assumes algebraic reasoning is signature-driven; assumes total operations; assumes closure properties (HSP) are meaningful; assumes term formation rules govern all algebraic behavior. |
| 1.6 Internal Coherence Requirements | Consistency | The demand that domain concepts do not contradict one another. | Identities must not contradict one another; operations must interact coherently; congruence structures must align with homomorphisms; free objects must satisfy universal properties; varieties must satisfy HSP closure; categorical semantics must match algebraic specifications. |
| | Compatibility | The requirement that entities, variables, and assumptions fit together into a unified descriptive framework. | Requires harmony between signatures, term functions, identities, homomorphisms, congruence lattices, HSP theorem, categorical formulations (monads, Lawvere theories), and closure properties defining varieties and quasivarieties. |
| 2. Evidence Layer | 2.1 Observable Phenomena | Observables | The aspects of the domain that can produce detectable signals accessible to measurement. | Operation outcomes; closure behavior; identity satisfaction/violation; homomorphism preservation patterns; congruence formation; subalgebra generation; product behavior; term-rewriting traces; free-algebra growth. |
| | Detection Limits | The boundaries of what can be resolved or sensed by current instruments or methods. | Limits on detecting identity validity in infinite algebras; inability to enumerate infinite term sets; difficulty visualizing large congruence lattices; computational hardness in homomorphism checking; undecidability in many varieties. |
| 2.2 Measurement Systems | Units | Standardized quantifications (meters, seconds, volts, decibels, dollars, etc.) necessary for consistent comparison. | Arity counts; number of operations; generator-set size; term-tree depth; congruence-class count; size of free algebras; identity-basis size; complexity of term reductions. |
| | Instruments | Devices and tools (microscopes, spectrometers, sensors, surveys, detectors) used to produce measurements. | Term-rewriting engines; algebraic identity checkers; congruence-lattice computation tools; homomorphism verifiers; free-algebra generators; clone calculators; universal algebra software (UACalc). |
| 2.3 Operational Definitions | Definitions | Terms defined by specific measurement procedures, ensuring empirical clarity. | Identity = universally valid equation; homomorphism = structure-preserving map; congruence = compatible equivalence relation; subalgebra = closed subset under all basic operations; product = coordinatewise algebra. |
| | Procedures | The explicit steps required to perform a measurement in a reproducible way. | Term-rewriting; building subalgebras; computing congruences; generating free algebras; testing homomorphic images; checking closure under HSP; deriving equational consequences; computing clones. |
| 2.4 Data Acquisition | Protocols | Formal processes for gathering data under controlled or standardized conditions. | Systematic term generation; finite-model identity testing; canonical congruence computation; structured homomorphism construction; closure testing under HSP operations; clone-generation procedures. |
| | Sampling | Rules determining which subset of the domain is measured and how representative it is. | Sampling bounded-depth terms; selecting finite algebras of fixed signature; sampling congruence relations; subalgebra sampling; sampling homomorphisms; extracting representative finite models. |
| 2.5 Data Character & Format | Data Types | The form raw evidence takes (time series, spectra, images, counts, qualitative records). | Term trees; operation tables; congruence partitions; identity sets; generator lists; clone operation sets; homomorphism maps; free-algebra presentations; rewriting logs. |
| | Resolution | The granularity or precision with which data is captured. | Determined by depth/size bounds on term sets; precision of congruence distinctions; completeness of rewriting rules; finiteness of sampled algebras; computational limits in enumerating free structures. |
| 2.6 Reliability & Calibration | Calibration | Adjustment procedures ensuring instruments produce accurate results. | Cross-checking identity validity via multiple rewriting systems; verifying congruence computations; confirming homomorphisms preserve operations; validating clone constructions; checking free-algebra correctness; ensuring signature–operation alignment. |
| | Error Characterization | Identification and quantification of noise, uncertainty, bias, and measurement error. | Incorrect identity detection; faulty congruence computation; failed closure tests; wrong homomorphism classification; truncated term enumeration; rewriting nontermination; inconsistencies in clone or free-algebra construction. |
| 3. Structural Layer | 3.1 Patterns & Regularities | Laws / Relations | Stable, repeatable patterns governing how observables behave across conditions. | Operations follow equational laws encoded by identities; closure under HSP (Homomorphic images, Subalgebras, Products) defines varieties; term functions obey composition rules; congruence relations interact predictably with homomorphisms; Birkhoff’s Variety Theorem provides universal structural regularity; clone operations satisfy compositional identities. |
| | Invariants | Quantities or properties that remain constant under transformations (symmetries, conservation laws). | Signature (operation arities); identity set; congruence lattice; clone of term operations; free algebra rank; equational theory; invariance of identities under homomorphisms; invariants preserved across HSP closure (e.g., congruence permutability). |
| 3.2 Causal Architecture | Mechanisms | Underlying processes or structures that produce the observed regularities. | Equational axioms generating structure; term formation through substitution; homomorphisms producing quotient structure; congruences inducing factor algebras; HSP operations generating varieties; clone composition generating all admissible operations; free-algebra mechanisms encoding universal mapping properties. |
| | Pathways | Organized sequences of interactions forming a causal chain or network. | Signature → define terms → impose identities → generate variety → compute subalgebras/quotients → classify congruences; algebra → homomorphism → kernel = congruence → quotient → structural refinement; term operations → clone → classify equational behavior. |
| 3.3 Theoretical Vocabulary | Concepts | Core terms that encode the domain’s structure (force, gene, equilibrium, field). | Signature, term, identity, equational theory, variety, quasivariety, homomorphism, congruence, subalgebra, product algebra, free algebra, clone, HSP theorem, term rewriting, universal mapping property. |
| | Classifications | Taxonomies, categories, or typologies that organize entities and relations. | Varieties (HSP classes); quasivarieties; congruence-distributive/permutable/modular varieties; types of algebras (groups, rings, lattices, Boolean algebras, semigroups, etc.); finitely generated vs infinitely generated algebras; locally finite vs non-locally finite varieties. |
| 3.4 Formal Representations | Equations | Mathematical constructs expressing laws, relations, or mechanisms. | Identities s(x₁,…,xₙ)=t(x₁,…,xₙ); homomorphism relation h(f(x))=f(h(x)); congruence compatibility equations; clone composition equations; HSP closure laws; rewrite rules for term reduction; universal property diagrams. |
| | Models | Structured representations—mathematical, computational, or conceptual—used to predict and explain phenomena. | Term algebras; free algebras; congruence lattices; product algebras; categorical diagrams (Lawvere theories, monads); clone lattices; quotient-algebra models; rewriting-system graphs. |
| 3.5 Idealized Structures | Simplified Models | Purposeful abstractions that capture essential dynamics while omitting irrelevant detail. | Single-sorted algebras; finitary operations; finite algebras; varieties with nice congruence properties (distributive/permutable); finite-term rewriting systems; finitely generated free algebras; reduced identity bases. |
| | Limit Conditions | Regimes where specific models or approximations hold (classical vs. quantum, linear vs. nonlinear). | Break down in infinitary signatures; multi-sorted complexities; non-equational classes; varieties with undecidable word problems; wild congruence lattices; non-finitary term operations; algebras lacking free objects in classical sense. |
| 3.6 Integrative Frameworks | Unifying Theories | Higher-order structures that connect disparate laws or mechanisms under a coherent whole. | Birkhoff’s Variety Theorem; clone theory unifying operations across structures; categorical perspectives (Lawvere theories, monads) unifying algebraic theories; HSP closure as a universal structural principle; equational logic as unifying deductive framework. |
| | Interdisciplinary Links | Points where the theory connects to adjacent sciences or larger explanatory systems. | Logic (equational logic, model theory); computer science (term rewriting, algebraic specification, universal constructions in programming semantics); category theory (monads, adjunctions); combinatorics (clone lattices); topology (in topological algebra variants). |
| 4. Method Layer | 4.1 Inquiry Design | Experimental Design | Structured plans for manipulating variables to test causal claims. | Varying operation signatures; altering identity sets; modifying generating sets; constructing alternative term-rewriting systems; changing congruence conditions; adjusting homomorphism definitions; exploring closure under HSP by manipulating subalgebra, product, and homomorphic-image formations. |
| | Observational Design | Systematic approaches for gathering non-manipulated data (surveys, field studies, natural experiments). | Observing natural term reductions under fixed rewrite rules; monitoring identity satisfaction; observing congruence growth; tracking formation of subalgebras without intervention; observing clone expansion; studying homomorphic images passively to detect structural patterns. |
| 4.2 Testing & Validation | Hypothesis Testing | Procedures for evaluating whether evidence supports or contradicts specific claims. | Testing whether an algebra satisfies a given identity; checking homomorphism preservation; validating congruence compatibility; confirming HSP closure properties; verifying free-algebra universal properties; testing whether two algebras belong to the same variety. |
| | Replication | The requirement that results be independently reproducible under similar conditions. | Re-running identity tests with alternate rewriting strategies; recomputing congruence lattices; repeating homomorphism checks; reconstructing free algebras using different generators; replicating clone computations; checking product/subalgebra constructions across tools. |
| 4.3 Inference & Evaluation | Statistical Inference | Rules for drawing conclusions from noisy or incomplete data. | Analyzing frequency of identity satisfaction across sampled algebras; evaluating distribution of congruence sizes; studying complexity of term reductions; comparing structural invariants across varieties; analyzing stability of clone structures under perturbations. |
| | Model Comparison | Criteria (fit, simplicity, predictive accuracy, robustness) used to evaluate competing models. | Comparing algebras under different signatures; contrasting varieties vs quasivarieties; comparing congruence-permutable vs congruence-distributive classes; contrasting clone structures; comparing free-algebra behavior under different identities; contrasting rewriting systems. |
| 4.4 Error Management | Error Analysis | Identification and quantification of random and systematic errors. | Identifying incorrect identity derivations; miscomputed congruences; faulty homomorphism verification; incomplete term enumeration; errors in clone generation; misclassification of varieties; failures of rewrite termination. |
| | Bias Control | Methods for minimizing subjective, instrumental, or procedural biases. | Avoiding signature-specific bias; ensuring unbiased term sampling; preventing overfitting to finite examples; avoiding selective identity testing; distributing sampling across diverse algebra sizes and signatures; avoiding reliance on one rewrite strategy. |
| 4.5 Adjudication & Revision | Peer Scrutiny | Collective evaluation of claims through critique, review, and debate. | Reviewing equational proofs; auditing term-rewriting correctness; verifying congruence conclusions; cross-validating homomorphism results; comparing free-algebra constructions; evaluating correctness of clone computations; challenging incorrect variety classifications. |
| | Theory Revision | Procedures for modifying, replacing, or discarding models based on new evidence. | Updating identity bases; refining congruence-lattice interpretations; modifying clone definitions; correcting HSP classification claims; adjusting term-rewriting rules; integrating new categorical generalizations (Lawvere theories, monads). |
| 4.6 Integrity Conditions | Transparency | Requirements to disclose methods, data, assumptions, and limitations. | Full disclosure of signatures, identity sets, rewriting rules, congruence algorithms, free-algebra construction methods, and clone-generating procedures; explicit statement of assumptions and computational limits. |
| | Ethical Standards | Norms ensuring responsible conduct in experimentation, data handling, and publication. | Honest reporting of non-termination or undecidability; avoiding suppression of pathological algebras; ensuring reproducibility; acknowledging limits of finite testing for infinite identities; maintaining rigor in algebraic and categorical claims. |