Distinction Ontology

Preprints

Preprints presenting and formally developing Distinction Ontology.

  1. Distinction Ontology: From the Undistinguished to the Generator

    A Generative Outline

    Distinction Ontology begins from a simple question: how can determinate structures arise if we do not assume objects, subjects, relations, spaces, or rules in advance? Its starting point is the undistinguished, understood not as nothingness or chaos, but as the absence of operative distinctions.

    The article follows one generative line opened by a bare distinction. Along this line, repetition produces multiplicity, relations acquire direction, recurring invariants become forms, and self-preserving forms develop into localities. From locality arise the developed possibilities of choice, knowledge, trace, history, and symbol.

    The Generator names the recurring work visible across this movement: distinction, determination, reproduction, exhaustion, radical distinction, and restructuring. It is not an entity or a final stage. The paper offers a compact presentation of this core unfolding, while the articles on this site develop its steps and consequences in greater detail.

    DOIPDF

  2. Distinction Ontology: A Sketch of Computational Formalization

    Transformational Form Calculus (TFC)

    Transformational Form Calculus (TFC) carries a line developed in Distinction Ontology into an executable setting. It asks what computation looks like when we begin not with fixed objects, operations, or networks, but with forms, distinctions, and possible movement.

    A form in TFC is surrounded by a space of possible transformations. A distinction changes and narrows that space. A transformation is selected and applied. The resulting form gives rise to another distinction. Computation is therefore understood as an open sequence in which what can happen next is itself changed by what has just emerged.

    From this simple contour, familiar computational organizations begin to appear: projection and materialization, identity and repair, generation and synthesis, verification, locality, networks, concurrency, symbolic search, continuous parameters, and numeric execution. The paper develops these structures step by step and tests them in a small reference implementation. The experiments do not establish a universal calculus. They show that these different regimes can share a compact executable language.

    DOIPDF