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
retracted
retracted
Fuente:
Zenodo
Saved in:
Bibliographic Details
Main Author:
Fathi, Kevin
Format:
Recurso digital
Language:
English
Published:
Zenodo
2025
Subjects:
Kolmogorov complexity
Incompleteness theorem
Peano Arithmetic
Symbolic proof systems
Chaitin incompleteness
Canonical CNF grammar
Entropy-bound derivation
Computability theory
Formal logic
Information-theoretic logic
Proof theory
Compression-based unprovability
Constructive logic
Theoretical computer science
Meta-mathematics
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.15580644
Similar Items
A Closed-Form Entropy-Based Lower Bound for Diagonal Ramsey Numbers
by: Fathi, Kevin
Published: (2025)
Automated Reasoning with Analytic Tableaux and Related Methods
Published: (2023)
Fermat's Last Theorem: Fully Constructive Proof by Absolute Dynamic Residual Exhaustion Descent (ADRED) — Proof-Theoretic Minimalization
by: Onodera, Hiroaki
Published: (2025)
(Hyper)sequent Calculi for the ALC(S4) Description Logics
by: Juan Pablo Muñoz
Published: (2016)
Harmony and Paradox
by: Tranchini, Luca
Published: (2024)