Neutral encyclopedia-style edition · 2 September 2026

The KURPISHEV LOGIC 2 project

Ivan Borisovich Kurpishev’s interdisciplinary research, publication and software project.

Editorial status. This article on the author’s site follows neutrality, verifiability and source-based editing. It is not a Wikipedia publication and does not itself establish the project’s encyclopedic notability.

Overview

KURPISHEV LOGIC 2 is the title of a corpus in which Ivan Borisovich Kurpishev combines his terminology of packet reper logic, projective-harmonic constructions, nonassociative packet geometry, evidence registers and software implementations. The primary site presents it as KLT / KLT-RBD and as research into space and time.[1]

Descriptions of the mathematical architecture and its novelty mainly originate in the author’s own publications. Thus “authorial”, “proposed” and “claimed novelty” are substantive qualifications. State registration of software or a database records that object’s registration; it does not replace mathematical peer review or validate a physical theory.[2]

Development and publications

The project develops through successive editions of monographs, articles, formal packages, databases and programs. In 2026 the primary author site provides navigation to volumes, key articles, geometry, physics, chemistry, anthropology and registration documents.[1] The Unified Exhibition Site explains the corpus structure, preserves evidence statuses and leads readers to primary publications while retaining the archive’s distinct role.

The Russian edition of Volume I describes 52 chapters, seven appendices and a separate PN.2 track. The document states the rule truth_layer_promotion=0, which prohibits upgrading scientific status without new grounds.[3] Volumes I–VII remain the main exhibition corpus on this site; the author archive also contains entries for later volumes.

Conceptual architecture

The publications use the following central elements:

ElementRole in the projectEditorial status
C@C“Event@state” as a minimal descriptive unit.Author’s terminology
Reper(R,I,U;D)A quadruple of realization, identification, possibilities and sufficient ground.Author’s formal scheme
D / DomSufficient ground and the admissible domain of inference.Methodological boundary
Projective-harmonic layerCross-ratio, harmonic closure and λ-coordinates.Classical tools + authorial synthesis
FOS“Fundamental support connectivity”, from which the author specifies reductions to subject domains.Author’s concept
NAPGNonassociative packet reper geometry and a reduced deformation layer.Author’s model; manuscript and source files
KLT-RBD / RPDReper database, dependency graph, evidence-D, prediction and abstention ABSTAIN.Software and methodological implementation

The author’s texts distinguish classical antecedents—cross-ratio, Desargues’ theorem, projectivization, the Hodge operator, stratified spaces and deformation theory—from their proposed synthesis within KLT-RBD/NAPG.[4]

Desargues–Kurpishev theorem

Under this title, the author publishes a construction involving two central conics, their polar centers, the line of centers, the Desargues axis and a harmonic point.[5] It must be distinguished from the classical Desargues theorem on perspective triangles. An article and proof within the project do not automatically establish independent use of the name or result in mathematical literature.

PN.2 uncertainty principle

PN.2 is central to the project’s physics–mathematics branch. Its current formalization relates the nonassociative defect of a packet operation, distinguishability of a structural coordinate and minimax estimation error. The corpus distinguishes three forms:

eSeD ≥ ¼ΔSΔD
eReD ≥ ¼‖K‖ΔD
eSeD ≥ (c/4)‖K‖ΔD

The internal proof ledger separates mathematical obligations from physical hypotheses. At the C3.8R checkpoint, statuses were not upgraded: PO-9=CLOSED_ABSTRACT_CATEGORY, PO-11/PO-12=CLOSED_ABSTRACTLY; PO-1–PO-8 and PO-10 remain open, while F-1–F-14=OPEN_PHYSICAL_HYPOTHESIS.[6] Closing an abstract obligation does not prove physical realization. The statistical form with the factor (1−τ)² remains a candidate theorem pending a separate audit.

Disciplinary branches

Geometry and NAPG

The NAPG manuscript combines a finite stratified time space, a packet formalism based on the Hodge operator, a family of seven-dimensional Lie algebras with G₂ structures and a reduced deformation scheme. “Associator rigidity” is restricted to a fixed isotropic ansatz; broader dynamic interpretations are conditional.[7]

Physics and cosmology

The physical materials treat mass, gravity, time, measurement and V*P relations as a research program connecting mathematical objects to observables. A physical claim requires a concrete experimental channel, an instrument model, a unit ledger and an independent run; without them, such conclusions remain hypotheses.

Chemistry

The chemistry branch includes KLT-RBD-CHEM, a projective periodic map, Evidence-D and KLT-MATDES. The reviewed DHCchem protocol proposes a matched null class and a blind prediction gate; it retains protocol status without promotion to a confirmed chemical doctrine.[8]

Philosophy and anthropology of cognition

The philosophical branch connects the project with the foundations of knowledge, Kant and historical perception types P-01/P-1 through P-04/P-4. These form the author’s philosophical-epistemological system rather than an accepted periodization of philosophy. Separate λ-audits of the doctrine and Kant are published.[9]

Software implementations

Programs and databases support structural text analysis, graphs of grounds and candidate-material search. Volume V describes the route source → semantic unit → PIX/PEAKS → C@C → Reper → D/Dom → λ/CGI → graph → PredRep → certificate or ABSTAIN.[10]

The Unified Exhibition presents KLT-RBDv6 Analyzer and KLT-MATDES as computational testbeds. A successful software test supports reproducibility of that implementation; it does not independently verify mathematical novelty, physical interpretation or a chemical prediction.

Verification, reception and limitations

AUTHORSHIPAuthorship of the corpus and software is claimed and documented through primary sources.
CLAIMED NOVELTYNovelty is presented as the author’s position; a full independent prior-art audit has not been conducted here.
FORMAL PROOFThe corpus includes proofs and proof obligations with different statuses.
SOFTWARE IMPLEMENTATIONPrograms, SDK/APK packages, databases and test reports are presented.
EMPIRICAL VALIDATIONPhysical hypotheses F-1–F-14 remain open; EXT_RUN has not been performed.

Most available publications are by the author or hosted on project resources. As of 2 September 2026, the editorial audit of this page had not established a sufficient body of independent authoritative publications discussing the project as a whole. The article therefore does not assert Wikipedia notability and does not treat software registration, AI reviews or internal QA as substitutes for independent sources.

Sources and notes

  1. Kurpishev I. B. Author’s research site KURPISHEV LOGIC 2 · KLT-RBD. Primary source.
  2. KLT-RBD v2.2 registration documents and KLT software. Administrative primary sources; not proof of scientific truth.
  3. Kurpishev I. B. Volume I, Foundations of Kurpishev Logic · v197. Primary source.
  4. Kurpishev I. B. KLT-RBD basic project, Volume I: axioms of packet reper logic. Primary source.
  5. Desargues–Kurpishev theorem — the author’s extended article. Primary source.
  6. Unified Exhibition: PN.2 Proof Observatory and PO-1–PO-12 register. The project’s editorial evidence ledger.
  7. Kurpishev I. B. Associator Rigidity and Nonassociative Packet Geometry — publication gateway. Author’s manuscript and source files.
  8. Chemistry corpus and Volume VI; KLT-MATDES: description and technical specification. Primary sources.
  9. λ-audit of Kant and anthropology volume. Primary sources.
  10. Volume V: KLT-RBD/RPD computational architecture. Primary source.

Editorial principles

The article structure was checked against the principles of neutral point of view, verifiability, no original research and notability. These links describe this page’s editorial method; they do not substantiate the project’s claims.