| 1. Domain | 1.1 Scope of the Domain | Boundaries | The range of phenomena the science includes and excludes. | Studies the behavior, expressive power, and elimination of quantifiers; includes quantifier-rank analysis, prenex forms, definability via quantifier patterns, and the theory of model completeness (every embedding is elementary). Excludes higher-order quantifiers not interpreted in first-order semantics. |
| | Scale | The spatial, temporal, or organizational level at which the science operates (e.g., quantum, cellular, social, cosmic). | Operates at the formal/logical scale: formulas, quantifiers, signatures, structures, embeddings, reducts/expansions, and elementary diagrams. |
| 1.2 Ontological Commitments | Entities | The kinds of things assumed to exist within the domain (particles, organisms, agents, fields, etc.). | Formulas in prenex form, quantifiers (∃, ∀), quantifier blocks, quantifier rank, Skolem functions, structures, embeddings, elementary substructures, diagrams. |
| | Properties | The fundamental attributes these entities possess (mass, charge, genotype, preference, etc.). | Quantifier complexity, alternation depth, preservation behavior under embeddings, definability strength, expressiveness, model completeness, quantifier elimination success/failure. |
| | Categories | The basic ontological types used to classify domain elements (substances, processes, relations, structures). | Quantifier classes (existential, universal, alternating), prenex classes, definability classes, model-complete theories, quantifier-eliminable theories, embeddings (strong, elementary). |
| 1.3 State-Variables | Variables | The measurable or definable properties that describe system conditions. | Variable assignments, bound/free variable status, tuples from the domain used to instantiate quantifiers, satisfaction states of quantified formulas. |
| | Parameterization | How variables encode and represent the system’s state. | Encoding system states via assignments, quantifier blocks, Skolemization parameters, and interpretations of constants and function symbols used to replace quantifier dependencies. |
| 1.4 Admissible Idealizations | Simplifications | Conceptual reductions used to make the domain tractable (point masses, rational agents, perfect gases). | Treat formulas in strict prenex normal form; assume clean alternation structure; idealize quantifier elimination as exact; ignore computational constraints; assume full closure under Skolemization. |
| | Validity Conditions | The limits and contexts in which idealizations hold or break down. | Breakdown occurs with infinitary languages, higher-order quantifiers, ambiguous scopes, non-elementary embeddings, or theories lacking compactness needed for quantifier-elimination theorems. |
| 1.5 Domain Assumptions | Structural Assumptions | Background ontological stances such as determinism, continuity, randomness, discreteness. | Assumes first-order logic, Tarskian semantics, bivalent truth, well-formed quantifier scoping, stable substitution rules, and classical model-theoretic interpretability. |
| | Implicit Commitments | Unstated but necessary assumptions that shape the field’s conceptual structure. | Assumes definability aligns with quantifier structure, Skolemization behaves consistently, satisfaction is absolute under isomorphisms, and quantifier-elimination mirrors semantic truth conditions. |
| 1.6 Internal Coherence Requirements | Consistency | The demand that domain concepts do not contradict one another. | Requires non-contradictory quantifier rules, coherent Skolem functions, stable prenex transformations, and compatibility between quantifier structure and definability results. |
| | Compatibility | The requirement that entities, variables, and assumptions fit together into a unified descriptive framework. | Requires alignment between formulas, structures, embeddings, quantifier-elimination procedures, and model-completeness conditions; satisfaction must be invariant under isomorphisms. |
| 2. Evidence Layer | 2.1 Observable Phenomena | Observables | The aspects of the domain that can produce detectable signals accessible to measurement. | Truth conditions of quantified formulas, quantifier-elimination success/failure, preservation under embeddings, alternation depth effects, definability changes after Skolemization, model-completeness behavior. |
| | Detection Limits | The boundaries of what can be resolved or sensed by current instruments or methods. | Expressive boundaries of first-order logic: inability to distinguish elementarily equivalent models, quantifier-rank limits, failure to define certain relations, compactness restrictions, Skolem paradox effects. |
| 2.2 Measurement Systems | Units | Standardized quantifications (meters, seconds, volts, decibels, dollars, etc.) necessary for consistent comparison. | Quantifier rank, alternation depth, formula length, domain cardinality, signature size, definability complexity, degree of Skolemization. |
| | Instruments | Devices and tools (microscopes, spectrometers, sensors, surveys, detectors) used to produce measurements. | Satisfaction tests (⊨), prenex transformations, Skolemization, quantifier-elimination procedures, EF-games for quantifier comparison, embedding tests for model completeness, type spaces. |
| 2.3 Operational Definitions | Definitions | Terms defined by specific measurement procedures, ensuring empirical clarity. | Quantifier classes (∃, ∀, alternating); definability conditions; Skolem functions as definability proxies; definitions via equivalent quantifier-free formulas; operational definitions of model completeness. |
| | Procedures | The explicit steps required to perform a measurement in a reproducible way. | Checking satisfaction of quantified formulas, running quantifier-elimination algorithms, performing Skolemization, applying EF-games, evaluating embeddings for elementary status, verifying equivalence of prenex forms. |
| 2.4 Data Acquisition | Protocols | Formal processes for gathering data under controlled or standardized conditions. | Constructing models to test quantifier behavior, forming reducts/expansions, creating elementary chains, computing quantifier-rank spectra, generating Skolem functions, testing definability across embeddings. |
| | Sampling | Rules determining which subset of the domain is measured and how representative it is. | Selecting representative formulas, quantifier blocks, tuples from domains, partial isomorphisms, fragments for EF testing, definability witnesses, or structures for quantifier-elimination testing. |
| 2.5 Data Character & Format | Data Types | The form raw evidence takes (time series, spectra, images, counts, qualitative records). | Formulas, prenex forms, Skolemized forms, definable sets/functions, EF-game outcomes, type distributions, elementary mapping results, quantifier-elimination outputs. |
| | Resolution | The granularity or precision with which data is captured. | Fineness of logical discrimination: quantifier-rank granularity, alternation-depth precision, expressive power of the language, complexity of Skolem terms, definability sensitivity. |
| 2.6 Reliability & Calibration | Calibration | Adjustment procedures ensuring instruments produce accurate results. | Verifying correctness of quantifier elimination; calibrating Skolem functions; ensuring embeddings preserve all formulas; checking equivalence of formulas across prenex transformations. |
| | Error Characterization | Identification and quantification of noise, uncertainty, bias, and measurement error. | Errors from mis-scoped quantifiers, incorrect substitutions, faulty Skolemization, non-elementary embeddings, definability illusions, compactness-driven anomalies, quantifier-rank miscalculations. |
| 3. Structural Layer | 3.1 Patterns & Regularities | Laws / Relations | Stable, repeatable patterns governing how observables behave across conditions. | Preservation theorems, monotonicity of quantifier behavior, compactness effects on quantifier patterns, equivalence of prenex transformations, characterizations of model completeness via quantifier elimination. |
| | Invariants | Quantities or properties that remain constant under transformations (symmetries, conservation laws). | Quantifier rank, alternation depth, definability invariants, elementary equivalence, EF-game invariants, Skolem-function invariants, stability of truth under embeddings or isomorphisms. |
| 3.2 Causal Architecture | Mechanisms | Underlying processes or structures that produce the observed regularities. | Mechanisms by which quantifiers alter expressiveness; Skolemization producing definable functions; elimination processes reducing formulas; embedding mechanisms ensuring elementary preservation in model-complete theories. |
| | Pathways | Organized sequences of interactions forming a causal chain or network. | Prenex-normalization pathways, Skolemization sequences, quantifier-elimination chains, EF back-and-forth strategies, embedding/extension chains verifying model completeness, definability refinement steps. |
| 3.3 Theoretical Vocabulary | Concepts | Core terms that encode the domain’s structure (force, gene, equilibrium, field). | Quantifier rank, alternation depth, Skolem functions, model completeness, quantifier elimination, prenex normal form, elementary embedding, existential/universal theories, definability spectra. |
| | Classifications | Taxonomies, categories, or typologies that organize entities and relations. | Quantifier classes (∃, ∀, alternating), prenex classes, definability hierarchies, model-complete theories, theories with quantifier elimination, stable/simple/o-minimal theory classifications. |
| 3.4 Formal Representations | Equations | Mathematical constructs expressing laws, relations, or mechanisms. | Formal equivalence φ ≡ ψ after elimination, satisfaction relations 𝔐 ⊨ ∀x φ, Skolemization equalities, EF-game characterizations of quantifier rank, elementary-embedding equivalences. |
| | Models | Structured representations—mathematical, computational, or conceptual—used to predict and explain phenomena. | Structures serving as witnesses of quantifier behavior, elementary substructures, Skolemized models, models with quantifier elimination, saturated models in model-complete theories, prime models. |
| 3.5 Idealized Structures | Simplified Models | Purposeful abstractions that capture essential dynamics while omitting irrelevant detail. | Purely relational signatures for clean quantifier behavior, quantifier-free cores of theories, toy models exhibiting elimination or failure, finite-variable fragments, simplified prenex classes. |
| | Limit Conditions | Regimes where specific models or approximations hold (classical vs. quantum, linear vs. nonlinear). | Limits of first-order expressiveness, compactness constraints, undefinability of certain relations (e.g., well-ordering), failures under higher-order logics, breakdown of elimination in non-elementary extensions. |
| 3.6 Integrative Frameworks | Unifying Theories | Higher-order structures that connect disparate laws or mechanisms under a coherent whole. | Quantifier-elimination frameworks, model-completeness frameworks, stability theory, classification theory, Tarski-style semantics unifying quantifier behavior, syntax–semantics correspondence. |
| | Interdisciplinary Links | Points where the theory connects to adjacent sciences or larger explanatory systems. | Ties to algebra (quantifier elimination in algebraically closed fields), real analysis (o-minimal structures), computer science (descriptive complexity), combinatorics (EF games), and topology (Stone spaces). |
| 4. Method Layer | 4.1 Inquiry Design | Experimental Design | Structured plans for manipulating variables to test causal claims. | Manipulating quantifier arrangements, alternation depth, prenex forms, or signature richness to test quantifier-elimination behavior, definability strength, or model-completeness conditions. |
| | Observational Design | Systematic approaches for gathering non-manipulated data (surveys, field studies, natural experiments). | Observing natural behavior of quantified formulas under embeddings, studying EF-game outcomes, tracking definability changes without altering the structure or language. |
| 4.2 Testing & Validation | Hypothesis Testing | Procedures for evaluating whether evidence supports or contradicts specific claims. | Testing equivalence of formulas after elimination; checking whether embeddings are elementary; verifying that existential/universal formulas behave as predicted; evaluating model-completeness claims. |
| | Replication | The requirement that results be independently reproducible under similar conditions. | Repeating quantifier-elimination procedures across different models; reproducing EF-game results; verifying elementary-embedding behavior in isomorphic or differently presented structures. |
| 4.3 Inference & Evaluation | Statistical Inference | Rules for drawing conclusions from noisy or incomplete data. | Logical analogs: analyzing quantifier-complexity distributions, counting definable equivalence classes, evaluating type multiplicities impacted by quantifier structure. |
| | Model Comparison | Criteria (fit, simplicity, predictive accuracy, robustness) used to evaluate competing models. | Comparing theories by quantifier-elimination success, expressive strength, quantifier-rank stability, definability behavior, and the robustness of embeddings under model-completeness tests. |
| 4.4 Error Management | Error Analysis | Identification and quantification of random and systematic errors. | Identifying mis-scoped quantifiers, faulty prenex transformations, incorrect Skolemization, failure of embeddings to preserve formulas, and errors arising from compactness or infinitary drift. |
| | Bias Control | Methods for minimizing subjective, instrumental, or procedural biases. | Preventing biased selection of structures or signatures; avoiding artificially enriched languages that trivialize quantifier elimination; ensuring fair EF-game comparisons. |
| 4.5 Adjudication & Revision | Peer Scrutiny | Collective evaluation of claims through critique, review, and debate. | Reviewing quantifier-elimination proofs, Skolemization chains, EF-game arguments, and claims of model completeness; critical checking of embedding tests. |
| | Theory Revision | Procedures for modifying, replacing, or discarding models based on new evidence. | Adjusting axioms or languages to improve elimination behavior; modifying Skolem functions; refining quantifier blocks; updating diagrams in response to new counterexamples. |
| 4.6 Integrity Conditions | Transparency | Requirements to disclose methods, data, assumptions, and limitations. | Full disclosure of quantifier structure, prenex conversions, Skolemization steps, embedding conditions, and all assumptions behind model-completeness arguments. |
| | Ethical Standards | Norms ensuring responsible conduct in experimentation, data handling, and publication. | Honest representation of eliminability limits; avoidance of hidden Skolem assumptions; proper attribution of preservation theorems; clarity in quantifier-scope claims. |