{"id":25882065,"url":"https://github.com/groupoid/axio","last_synced_at":"2026-01-27T06:01:09.767Z","repository":{"id":10350651,"uuid":"12487725","full_name":"groupoid/axio","owner":"groupoid","description":"🧊 Методологія верифікації теорем","archived":false,"fork":false,"pushed_at":"2025-08-12T08:41:47.000Z","size":12137,"stargazers_count":93,"open_issues_count":0,"forks_count":11,"subscribers_count":13,"default_branch":"main","last_synced_at":"2025-10-16T17:10:04.224Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":"http://axio.groupoid.space/","language":"Pug","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"other","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/groupoid.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null,"zenodo":null,"notice":null,"maintainers":null,"copyright":null,"agents":null,"dco":null,"cla":null}},"created_at":"2013-08-30T14:02:18.000Z","updated_at":"2025-08-12T08:41:50.000Z","dependencies_parsed_at":"2022-09-26T16:20:29.514Z","dependency_job_id":"a762e05b-4d42-4690-a21a-6513182700c5","html_url":"https://github.com/groupoid/axio","commit_stats":{"total_commits":64,"total_committers":2,"mean_commits":32.0,"dds":0.015625,"last_synced_commit":"be43213fa13e748fb1044482d3033fac6372ede2"},"previous_names":["groupoid/formal.uno","groupoid/axoim.dev","groupoid/axiom.dev","groupoid/axio.pro","groupoid/monography","groupoid/formal.one","groupoid/axio"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/groupoid/axio","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/groupoid%2Faxio","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/groupoid%2Faxio/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/groupoid%2Faxio/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/groupoid%2Faxio/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/groupoid","download_url":"https://codeload.github.com/groupoid/axio/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/groupoid%2Faxio/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":28805317,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-01-27T05:43:52.625Z","status":"ssl_error","status_checked_at":"2026-01-27T05:43:48.957Z","response_time":168,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.6:443 state=error: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":[],"created_at":"2025-03-02T15:57:06.835Z","updated_at":"2026-01-27T06:01:09.760Z","avatar_url":"https://github.com/groupoid.png","language":"Pug","funding_links":[],"categories":[],"sub_categories":[],"readme":"\u003cH1\u003eAXIO/1\u003c/h1\u003e\n\u003cp\u003eArtificial Experienced Intelligent Ontology v10.0 (2025)\u003c/p\u003e\n\n\u003cul\u003e\n  \u003cli\u003eУкраїнською: Штучна Досвідчена Інтелектуальна Онтологія\u003c/li\u003e\n  \u003cli\u003eТибетською: བཟོ་བཀོད་ཀྱི་ཉམས་ཡོད་པའི་རིག་པའི་ངོ་བོ་ལུགས། (bzo bkod kyi nyams yod pa'i rig pa'i ngo bo lugs)\u003c/li\u003e\n\u003c/ul\u003e\n\n\u003ch2\u003eTable of Contents (དཀར་ཆག dkar chag)\u003c/h2\u003e\n\u003cul\u003e\n    \u003cli\u003eIntroduction\u003c/li\u003e\n    \u003cli\u003eProcess\u003c/li\u003e\n    \u003cli\u003eComponents\u003c/li\u003e\n    \u003cli\u003eOperators\u003c/li\u003e\n    \u003cli\u003eRefinments\u003c/li\u003e\n    \u003cli\u003eGoals\u003c/li\u003e\n    \u003cli\u003eRuntime Languages\u003c/li\u003e\n    \u003cli\u003eHigher Languages\u003c/li\u003e\n\u003c/ul\u003e\n\n\u003ch2\u003e1. Introduction (ངོ་སྤྲོད ngo sprod)\u003c/h2\u003e\n\u003cp\u003eThe \u003cstrong\u003eAXIO/1 Framework\u003c/strong\u003e is a layered system for \u003cstrong\u003einfinite reasoning\u003c/strong\u003e, structured into:\u003c/p\u003e\n\u003cul\u003e\n    \u003cli\u003e\u003cstrong\u003eRuntime Languages\u003c/strong\u003e: Execute computations and manage concurrency.\u003c/li\u003e\n    \u003cli\u003e\u003cstrong\u003eHigher Languages\u003c/strong\u003e: Handle theorem proving and formal verification.\u003c/li\u003e\n\u003c/ul\u003e\n\u003cp\u003eThis framework operates as a \u003cstrong\u003ecyclic, iterative system\u003c/strong\u003e for formal reasoning,\n   where an \u003cstrong\u003eoperator\u003c/strong\u003e (human, AI, or hybrid) directs a process that continuously refines itself.\u003c/p\u003e\n\n\u003ch2\u003e2. Process (ལས་ཀ las ka)\u003c/h2\u003e\n\u003cp\u003eAXIO/1 follows a structured flow:\u003c/p\u003e\n\u003col\u003e\n    \u003cli\u003e\u003cstrong\u003eConditions\u003c/strong\u003e: Foundational elements (Axioms, Definitions, Types, Propositions, Syntax).\u003c/li\u003e\n    \u003cli\u003e\u003cstrong\u003eEnvironment\u003c/strong\u003e: The structured setting (Model, Consistency, Completeness, Library).\u003c/li\u003e\n    \u003cli\u003e\u003cstrong\u003eThinking\u003c/strong\u003e: Reasoning mechanisms (Hypotheses, Computation, Deduction, Conjecture, Inference Rules, General Induction).\u003c/li\u003e\n    \u003cli\u003e\u003cstrong\u003eFruit\u003c/strong\u003e: Logical results (Proof, Judgment, Theorem).\u003c/li\u003e\n    \u003cli\u003e\u003cstrong\u003eInsight\u003c/strong\u003e: Higher-level understanding (Semantics, Categorical Frameworks, Abstraction).\u003c/li\u003e\n\u003c/ol\u003e\n\n\u003ch2\u003e3. Components (ཆ་ཤས cha shas)\u003c/h2\u003e\n\n\u003ch3\u003eCondition (C) རྐྱེན Умова rkyen\u003c/h3\u003e\n\u003cpre\u003e\n    C = (A, D, T, P, X)\n\u003c/pre\u003e\n\u003cul\u003e\n    \u003cli\u003e\u003cstrong\u003eAxioms (A)\u003c/strong\u003e: Fundamental truths.\u003c/li\u003e\n    \u003cli\u003e\u003cstrong\u003eDefinitions (D)\u003c/strong\u003e: Precise descriptions of entities.\u003c/li\u003e\n    \u003cli\u003e\u003cstrong\u003eTypes (T)\u003c/strong\u003e: Categorization of objects.\u003c/li\u003e\n    \u003cli\u003e\u003cstrong\u003eSyntax (X)\u003c/strong\u003e: Structural rules.\u003c/li\u003e\n\u003c/ul\u003e\n\n\u003ch3\u003eEnvironment (E) ཁོར་ཡུག Середовище khor yug \u003c/h3\u003e\n\u003cpre\u003e\n    E = (M, C, K, L)\n\u003c/pre\u003e\n\u003cul\u003e\n    \u003cli\u003e\u003cstrong\u003eModel (M)\u003c/strong\u003e: Formal representation of the system.\u003c/li\u003e\n    \u003cli\u003e\u003cstrong\u003eConsistency (C)\u003c/strong\u003e: No contradictions within the system.\u003c/li\u003e\n    \u003cli\u003e\u003cstrong\u003eCompleteness (K)\u003c/strong\u003e: The extent to which all truths can be derived.\u003c/li\u003e\n    \u003cli\u003e\u003cstrong\u003eLibrary (L)\u003c/strong\u003e: Repository of known results.\u003c/li\u003e\n\u003c/ul\u003e\n\n\u003ch3\u003eReason (T) རྒྱུ Причина rgyu \u003c/h3\u003e\n\u003cpre\u003e\n    T = (J, H, C, D, G)\n\u003c/pre\u003e\n\u003cul\u003e\n    \u003cli\u003e\u003cstrong\u003eJudgment (J)\u003c/strong\u003e: Logical assertions.\u003c/li\u003e\n    \u003cli\u003e\u003cstrong\u003eHypotheses (H)\u003c/strong\u003e: Presupposition, Assumption, Supposition, Proposition.\u003c/li\u003e\n    \u003cli\u003e\u003cstrong\u003eComputation (C)\u003c/strong\u003e: Lambda Calculus, Pi-Calculus.\u003c/li\u003e\n    \u003cli\u003e\u003cstrong\u003eDeduction (D)\u003c/strong\u003e: Inference Rules, General Induction.\u003c/li\u003e\n    \u003cli\u003e\u003cstrong\u003eConjecture/Assertion (G)\u003c/strong\u003e: Formulation of potential truths.\u003c/li\u003e\n\u003c/ul\u003e\n\n\u003ch3\u003eFruit (F) འབྲས་བུ Плід 'bras bu\u003c/h3\u003e\n\u003cpre\u003e\n    F = (⊢,Θ)\n\u003c/pre\u003e\n\u003cul\u003e\n    \u003cli\u003e\u003cstrong\u003eProof\u003c/strong\u003e ⊢ Verified propositions.\u003c/li\u003e\n    \u003cli\u003e\u003cstrong\u003eTheorem\u003c/strong\u003e Θ Established truths.\u003c/li\u003e\n\u003c/ul\u003e\n\n\u003ch3\u003eInsight (I) ལྟ་བའི་ཤེས་པ lta ba'i shes pa\u003c/h3\u003e\n\u003cpre\u003e\n    I = (S, C, A)\n\u003c/pre\u003e\n\u003cul\u003e\n    \u003cli\u003e\u003cstrong\u003eSemantics\u003c/strong\u003e Σ: Meaning assignment.\u003c/li\u003e\n    \u003cli\u003e\u003cstrong\u003eCategorical Frameworks \u003c/strong\u003e C: High-level abstractions..\u003c/li\u003e\n    \u003cli\u003e\u003cstrong\u003eAbstraction\u003c/strong\u003e A: Generalization of concepts.\u003c/li\u003e\n\u003c/ul\u003e\n\n\u003ch2\u003e3. Operators (བཀོལ་སྤྱོད་པ bkol spyod pa) \u003c/h2\u003e\n\u003cp\u003eThree types of operators drive the system:\u003c/p\u003e\n\u003cul\u003e\n    \u003cli\u003e\u003cstrong\u003eHuman\u003c/strong\u003e: Chooses propositions, interprets insights, and guides conjectures.\u003c/li\u003e\n    \u003cli\u003e\u003cstrong\u003eMachine\u003c/strong\u003e: Automates computations, checks consistency, and suggests hypotheses.\u003c/li\u003e\n    \u003cli\u003e\u003cstrong\u003eHybrid\u003c/strong\u003e: Human sets goals, machine executes reasoning steps.\u003c/li\u003e\n\u003c/ul\u003e\n\n\u003ch2\u003e4. Refinements (ལེགས་བཅོས legs bcos) \u003c/h2\u003e\n\u003cp\u003eEnsuring correctness and progression:\u003c/p\u003e\n\u003cul\u003e\n    \u003cli\u003e\u003cstrong\u003eInfinite Thinking\u003c/strong\u003e: Achieved via iteration \u003ccode\u003eSₙ → ∞\u003c/code\u003e.\u003c/li\u003e\n    \u003cli\u003e\u003cstrong\u003eFinite Steps\u003c/strong\u003e: Each step is discrete, \u003ccode\u003eSₙ → Sₙ₊₁\u003c/code\u003e.\u003c/li\u003e\n    \u003cli\u003e\u003cstrong\u003eOperator-Driven\u003c/strong\u003e: The direction of reasoning is controlled by \u003ccode\u003eO\u003c/code\u003e.\u003c/li\u003e\n\u003c/ul\u003e\n\n\u003cp\u003eThe cycle repeats indefinitely, refining knowledge.\u003c/p\u003e\n\u003cpre\u003e\n    S₀ → S₁ → S₂ → ... → Sₙ → Sₙ₊₁ → ...\n\u003c/pre\u003e\n\u003cp\u003eWhere:\u003c/p\u003e\n\u003cul\u003e\n    \u003cli\u003e\u003ccode\u003eSₙ\u003c/code\u003e is a finite reasoning step.\u003c/li\u003e\n    \u003cli\u003e\u003ccode\u003eSₙ₊₁\u003c/code\u003e builds upon \u003ccode\u003eSₙ\u003c/code\u003e, ensuring refinement.\u003c/li\u003e\n    \u003cli\u003e\u003cstrong\u003eLimit process\u003c/strong\u003e: \u003ccode\u003elim (n → ∞) Sₙ\u003c/code\u003e represents \u003cstrong\u003einfinite reasoning\u003c/strong\u003e.\u003c/li\u003e\n\u003c/ul\u003e\n\n\u003ch2\u003e5. Design Goals (དམིགས་ཡུལ dmigs yul)\u003c/h2\u003e\n\u003cul\u003e\n    \u003cli\u003e\u003cstrong\u003eRuntime Languages\u003c/strong\u003e: Handle computation and concurrency.\u003c/li\u003e\n    \u003cli\u003e\u003cstrong\u003eHigher Languages\u003c/strong\u003e: Ensure theorem proving and soundness.\u003c/li\u003e\n    \u003cli\u003e\u003cstrong\u003eInfinite Thinking\u003c/strong\u003e: Achieved via refinements cycles.\u003c/li\u003e\n    \u003cli\u003e\u003cstrong\u003eOperator-Driven\u003c/strong\u003e: Collaboration between humans and machines.\u003c/li\u003e\n\u003c/ul\u003e\n\n## Runtime Languages (ལག་ལེན་གྱི་སྐད lag len gyi skad)\n\n### Joe\n\nRole: Certified bytecode stack interpreter and compiler to Intel/ARM.\nFeatures: Executes Lambda Calculus terms as bytecode, compiles to native code.\nFit: Computes concrete results. Certified for reliability.\nUse Case: Operator runs algebraic steps or tests hypotheses on hardware.\n\n### Bob\n\nRole: Parallel, concurrent, non-blocking, zero-copy runtime with CAS cursors (compare-and-swap).\nFeatures: Implements Pi-Calculus-style concurrency, optimized for matrix operations (BLAS-like).\nFit: Manages distributed validation across nodes, computes in parallel (e.g., parity table cases).\nUse Case: Operator coordinates multi-threaded proof checks or simulations.\n\n### Alice\n\nRole: Linear types calculus with partial fractions for BLAS level 3 programming.\nFeatures: Ensures resource safety (linear types), optimizes matrix computations (e.g., tensor products).\nFit: Handles complex (e.g., matrix-based proofs), enforces no redundant copies.\nUse Case: Operator proves theorems involving linear algebra or tensor structures.\n\n## Higher Languages (མཐོ་རིམ་གྱི་སྐད mtho rim gyi skad)\n\n### Henk\n\nRole: Pure Type System (PTS-91), Calculus of Constructions (CoC-88), infinite universes, AUTOMATH-68 syntax.\nFeatures: Flexible typing.\nUse Case: Operator formalizes recursive or foundational proofs.\nRationale: Henk subsumes Alonzo’s STLC with richer types, making it a strong starting point.\n\n### Per\n\nRole: ΠΣ (MLTT-72) prover with CoC, identity types (MLTT-75), well-founded trees (MLTT-80).\nFeatures: Dependent types, equality proofs.\nFit: Proves (e.g., \"parity preservation\"), ensures consistency.\nUse Case: Operator handles equality or model-specific theorems.\n\n### Frank\n\nRole: Pure Lambda (CoC-88, PTS-91) + Inductive Constructions (CIC-89).\nFeatures: Dependent types, equality proofs.\nFit: Proves (e.g., \"parity preservation\"), ensures consistency.\nUse Case: Operator handles equality or model-specific theorems.\n\n### Christine\n\nRole: ΠΣ (MLTT-72) prover with CoC, identity types (MLTT-75), extended to CIC (IND-89).\nFeatures: Dependent types, equality proofs.\nFit: Proves (e.g., \"parity preservation\"), ensures consistency.\nUse Case: Operator handles equality or model-specific theorems.\n\n### Anders\n\nRole: Homotopy Type System (HTS-2013) with Strict Equality and Cubical Agda (CCHM-2016).\nFeatures: Higher-dimensional types, paths, cubical primitives.\nFit: Extracts (e.g., \"parity as a homotopy group\"), builds cat.\nUse Case: Operator abstracts to categorical or topological structures.\n\n### Dan\n\nRole: Simplicial CCHM-based system, replacing Rzk/GAP.\nFeatures: Simplicial types, primitives (Simplex, Chain, Monoid, Category, Group).\nFit: Formalizes cat (e.g., \"parity as a monoid\"), verifies geometric proofs.\nUse Case: Operator proves simplicial or algebraic topology insights.\n\n### Jack \n\nRole: A Framework for Chromatic Homotopy Theory and K-Theory.\nFeatures: Hopf Fibrations, Suspensions, Truncations, Π, Σ, Id, ℕ, ℕ∞.\nUse Case: Operator links proofs to topological or physical systems.\n\n### Urs\n\nRole: A Framework for Supergeometry in Cohesive Topos.\nFeatures: Hopf Fibrations, Suspensions, Truncations, Π, Σ, Id, ℕ, ℕ∞.\nUse Case: Operator links proofs to topological or physical systems.\n\n### Fabien\n\nRole: Motivic A^1-Homotopy Theory.\nFeatues: Π,Σ,Path,𝑘:𝑈,0_𝑘,1_𝑘,point_𝑘,𝐴^1:U,point:𝑘→𝐴^1., a1contr, 𝐿_{A^1}:U→𝑈, 𝜂_{A^1}, rec_{A^1}, n-Trunc, 𝑁, Suspension,S^{1,1}.\nUse case: derives all structural theorems of A^1-Homotopy Theory—such as A^1-connectivity (X×A^1)≅π_n(A^1), contractibility\nof 𝐴^1, and unstable connectivity — while providing a foundation for stable A^1-homotopy via suspensions and motivic spheres.\n\n### Laurent\n\nRole: Mathematical and Functional Analysis, Calculus.\nFeatures: ℝ, C, Nat, Boo, Forall, Exists, Set, Measure, Lebesgue. Seq, Inf, Sup, Lim.\nUse case: Real Analysis, Functional Analysis.\n\n### Ernst \n\nRole: ZFC LEM theories.\nFeatures: 𝑉, Pow(𝐴), 𝑥 ∈ 𝐴, 𝐴 ⊆ 𝐵; LEM: ⊢ 𝑃 ∨ ¬𝑃\nUse case: Classical Logic Support.\n\n### Paul \n\nRole: Forced Cardinals.\nFeatures: ⊢ 𝜅 : Card, inaccessible(𝜅), measurable(𝜅), Force(𝑃, 𝐺) : 𝑉 → 𝑉, 𝑝 ⊩ 𝜙\nUse case: Generic filter 𝐺 over a poset 𝑃, yielding a new model 𝑉[𝐺], adjoin reals and control cardinalities or axioms.\n\n## AXIOSIS\n\nAxiomatic Extended Integrated Ordered System for Infinite Structures is a novel type theory engineered\nto mechanically verify all existing theorems across mathematics, from classical analysis to modern set\ntheory and homotopy. Building on top of advanced frameworks:\n\n* **Henk Barendregt** Type Theory for Pure Dependent Lambda Calculus,\n* **Per Martin-Löf** Type Theory for Fibrational setting and inductive types,\n* **Anders Mörtberg** Type Theory for CCHM/CHM/HTS bootstrap,\n* **Dan Kan** Simplicial HoTT,\n* **Jack Morava** Type Theory for Chromatic Homotopy Theory and K-Theory,\n* **Urs Schreiber** Type Theory for Equivariant Supergeometry,\n* **Fabien Morel** Type Theory for A¹-homotopy theory,\n* **Laurent Schwartz** Type Theory for Functional Analysis and Calculus,\n* **Ernst Zermelo** Type Theory for ZFC with LEM, and\n* **Paul Cohen** Type Theory for cardinals system incorporating large cardinals and forcing\n\nthis system synthesis unifies synthetic homotopy, stable homotopy spectra, cohesive geometry, real analysis,\nand set-theoretic foundations into a single, computationally verifiable formalism. We demonstrate its\npower through key theorems:\n\n* Number Theory: Prime Number Theorem\n* Fundamental Theorem of Calculus (Analysis):\n* Analysis: Lebesgue Dominated Convergence Theorem\n* Topology: Poincaré Conjecture (3D)\n* Algebra: Classification of Finite Simple Groups\n* Set Theory: Independence of the Continuum Hypothesis (CH)\n* Category Theory: Adjoint Functor Theorem\n* Homotopy Theory: Adams Conjecture (via K-theory)\n* Consistency of ZFC with Large Cardinals\n* Fermat’s Last Theorem\n* Large Cardinal Theorem: Martin’s Maximum\n\nshowcasing its ability to span algebraic, analytic, topological, and\nfoundational domains. AXIOSIS stands as a candidate for a universal mechanized mathematics platform,\nrivaling systems like Cubical Type Theory while extending their scope.\n\nAXIOSIS achieves a landmark synthesis, unifying synthetic and classical mathematics in a mechanically\nverifiable framework. Its type formers—spanning simplicial ∞-categories, stable spectra, cohesive modalities,\nreals, ZFC, large cardinals, and forcing — cover all known mathematical domains as of 2025.\n\n## Monography\n\n* Compilation: https://axiosis.github.io/books/axio/axio.pdf\n* Github Organization: https://github.com/groupoid/\n\n## LaTeX \n\n```\n$ cp *.ttf ~/.local/share/fonts\n$ sudo apt install texlive-full\n$ sudo fc-cache -f\n$ fc-match Geometria\n$ make\n```\n\n## Sole Copyright\n\nNamdak Tonpa\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgroupoid%2Faxio","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fgroupoid%2Faxio","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgroupoid%2Faxio/lists"}