Skip to content
Descubridor Institucional UMAR
Inicio
Búsqueda avanzada
Explorar
Inicio
Búsqueda avanzada
Explorar
Login
Language
English
Deutsch
Español
Français
Italiano
All Fields
Title
Author
Subject
Call Number
ISBN/ISSN
Tag
Find
Advanced
Machine-Checkable Weak Covering for the Collatz (3x+1) Problem
Machine-Checkable Weak Covering for the Collatz (3x+1) Problem
Fuente:
Zenodo
Saved in:
Bibliographic Details
Main Author:
Kawanishi, Yoshihito
Format:
Recurso digital
Language:
English
Published:
Zenodo
2025
Subjects:
Collatz Conjecture
Structural Proof
Recursive Compression
Arithmetic Logic
Induction
Number Theory
finite-cover certificate
Lyapunov
automated reasoning
certificate
formal verification
Online Access:
Acceder al recurso
Tags:
Add Tag
No Tags, Be the first to tag this record!
Cite this
Text this
Email this
Print
Export Record
Export to RefWorks
Export to EndNoteWeb
Export to EndNote
Save to List
Permanent link
Holdings
Description
Comments
Similar Items
Staff View
Internet
https://doi.org/10.5281/zenodo.17421484
Similar Items
Layered Recursive Compression as a Structural Proof of the Collatz Conjecture (Version 92)
by: Kawanishi, Yoshihito
Published: (2025)
A Finite–Depth Structural Resolution of the Collatz Conjecture via Hierarchical Height Functions and Mother Chains (JNT Submission Version)
by: Matsuua, Yoshihito
Published: (2025)
An Attempted Symbolic Entropy Proof of the Collatz Conjecture via Canonical Rewrite Grammars
by: Fathi, Kevin
Published: (2025)
Receipts That Move: The Transportable Proof Conjecture (TPC) — A Proposal for Verifiable Decisions
by: Figurelli, Rogério
Published: (2025)
Fermat's Last Theorem: Fully Constructive Proof by Absolute Dynamic Residual Exhaustion Descent (ADRED) — Proof-Theoretic Minimalization
by: Onodera, Hiroaki
Published: (2025)