Formalising Propositional Information via Implication Hypergraphs
Fuente:
arXiv
Saved in:
| Main Author: | Dalal, Vibhu |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra
by: Li, Cheuk Ting
Published: (2025)
by: Li, Cheuk Ting
Published: (2025)
Formalising the Bruhat-Tits Tree
by: Ludwig, Judith, et al.
Published: (2025)
by: Ludwig, Judith, et al.
Published: (2025)
Formalising the local compactness of the adele ring
by: Mercuri, Salvatore
Published: (2024)
by: Mercuri, Salvatore
Published: (2024)
Lecture Notes on Algorithmic Information Theory
by: Bédard, Charles Alexandre
Published: (2025)
by: Bédard, Charles Alexandre
Published: (2025)
On the Computability of Finding Capacity-Achieving Codes
by: Gkekas, Angelos, et al.
Published: (2025)
by: Gkekas, Angelos, et al.
Published: (2025)
Computability Limits of Sequential Hypothesis Testing
by: Leshem, Amir
Published: (2026)
by: Leshem, Amir
Published: (2026)
Length Functions and the Dimension of Points in Self-Similar Fractal Trees
by: Porter, Christopher P.
Published: (2024)
by: Porter, Christopher P.
Published: (2024)
Towards a Unification of Logic and Information Theory
by: Lastras, Luis A., et al.
Published: (2023)
by: Lastras, Luis A., et al.
Published: (2023)
Formalising Inductive and Coinductive Containers
by: Damato, Stefania, et al.
Published: (2024)
by: Damato, Stefania, et al.
Published: (2024)
Fundamental Propositional Logic with Strict Implication
by: Chen, Zhicheng
Published: (2025)
by: Chen, Zhicheng
Published: (2025)
An extension of Priestley duality to fuzzy topologies and positive MV-algebras
by: Ortiz, Marby Zuley Bolaños, et al.
Published: (2025)
by: Ortiz, Marby Zuley Bolaños, et al.
Published: (2025)
Growth and irreducibility in path-incompressible trees
by: Barmpalias, George, et al.
Published: (2022)
by: Barmpalias, George, et al.
Published: (2022)
Complexity of inversion of functions on the reals
by: Barmpalias, George, et al.
Published: (2024)
by: Barmpalias, George, et al.
Published: (2024)
Quantifying Information Loss under Coarse-Grained Partitions: A Discrete Framework for Explainable Artificial Intelligence
by: Izumo, Takashi
Published: (2025)
by: Izumo, Takashi
Published: (2025)
Collision-resistant hash-shuffles on the reals
by: Barmpalias, George, et al.
Published: (2025)
by: Barmpalias, George, et al.
Published: (2025)
Rate-Distortion Theory for Deductive Sources under Closure Fidelity
by: Xu, Jianfeng
Published: (2026)
by: Xu, Jianfeng
Published: (2026)
Computable one-way functions on the reals
by: Barmpalias, George, et al.
Published: (2024)
by: Barmpalias, George, et al.
Published: (2024)
A Truly Concurrent Semantics for Reversible CCS
by: Melgratti, Hernán, et al.
Published: (2023)
by: Melgratti, Hernán, et al.
Published: (2023)
Non-Transferability in Communication Channels and Tarski`s Truth Theorem
by: Naderian, Farhad
Published: (2022)
by: Naderian, Farhad
Published: (2022)
Dimensionality and randomness
by: Barmpalias, George, et al.
Published: (2024)
by: Barmpalias, George, et al.
Published: (2024)
Compression of enumerations and gain
by: Barmpalias, George, et al.
Published: (2023)
by: Barmpalias, George, et al.
Published: (2023)
Von Neumann Entropy and Quantum Algorithmic Randomness
by: Bhojraj, Tejas
Published: (2024)
by: Bhojraj, Tejas
Published: (2024)
Information Physics of Intelligence: Unifying Logical Depth and Entropy under Thermodynamic Constraints
by: Xu, Jianfeng, et al.
Published: (2025)
by: Xu, Jianfeng, et al.
Published: (2025)
Quantifying Logical Consistency in Transformers via Query-Key Alignment
by: Tulchinskii, Eduard, et al.
Published: (2025)
by: Tulchinskii, Eduard, et al.
Published: (2025)
Complete Diagrammatic Axiomatisations of Relative Entropy
by: Sarkis, Ralph, et al.
Published: (2026)
by: Sarkis, Ralph, et al.
Published: (2026)
Algorithmic Randomness in Continuous-Time Markov Chains
by: Huang, Xiang, et al.
Published: (2019)
by: Huang, Xiang, et al.
Published: (2019)
Towards declarative comparabilities: application to functional dependencies
by: Nourine, Lhouari, et al.
Published: (2019)
by: Nourine, Lhouari, et al.
Published: (2019)
A Complete Propositional Dynamic Logic for Regular Expressions with Lookahead
by: Nakamura, Yoshiki
Published: (2026)
by: Nakamura, Yoshiki
Published: (2026)
First-Order Intuitionistic Linear Logic and Hypergraph Languages
by: Pshenitsyn, Tikhon
Published: (2025)
by: Pshenitsyn, Tikhon
Published: (2025)
Equivalence Hypergraphs: DPO Rewriting for Monoidal E-Graphs
by: Tiurin, Aleksei, et al.
Published: (2024)
by: Tiurin, Aleksei, et al.
Published: (2024)
Theoremizing Yablo's Paradox
by: Karimi, Ahmad, et al.
Published: (2014)
by: Karimi, Ahmad, et al.
Published: (2014)
Formalising the Double-Pushout Approach to Graph Transformation
by: Söldner, Robert, et al.
Published: (2023)
by: Söldner, Robert, et al.
Published: (2023)
Equivalence of Halting Problem to Convergence of Power Series
by: Fernandes, Antonio Joaquim
Published: (2025)
by: Fernandes, Antonio Joaquim
Published: (2025)
Building Intelligent Databases through Similarity: Interaction of Logical and Qualitative Reasoning
by: Vilchis-Medina, José-Luis
Published: (2025)
by: Vilchis-Medina, José-Luis
Published: (2025)
Order-theoretic models for decision-making: Learning, optimization, complexity and computation
by: Hack, Pedro
Published: (2024)
by: Hack, Pedro
Published: (2024)
Propositional Calculus with Multiple Negations
by: Ramírez, Oscar
Published: (2024)
by: Ramírez, Oscar
Published: (2024)
Partial decidability protocol for the Wang tiling problem from statistical mechanics and chaotic mapping
by: Canfora, Fabrizio, et al.
Published: (2025)
by: Canfora, Fabrizio, et al.
Published: (2025)
The computational inevitability of life: self-replication under resource-bounded nested algorithmic probability
by: Sarkar, Aritra
Published: (2020)
by: Sarkar, Aritra
Published: (2020)
Proof-theoretic Semantics for Classical Propositional Logic with Assertion and Denial
by: Gheorghiu, Alexander V., et al.
Published: (2025)
by: Gheorghiu, Alexander V., et al.
Published: (2025)
Some General Completeness Results for Propositionally Quantified Modal Logics
by: Ding, Yifeng, et al.
Published: (2024)
by: Ding, Yifeng, et al.
Published: (2024)
Similar Items
-
Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra
by: Li, Cheuk Ting
Published: (2025) -
Formalising the Bruhat-Tits Tree
by: Ludwig, Judith, et al.
Published: (2025) -
Formalising the local compactness of the adele ring
by: Mercuri, Salvatore
Published: (2024) -
Lecture Notes on Algorithmic Information Theory
by: Bédard, Charles Alexandre
Published: (2025) -
On the Computability of Finding Capacity-Achieving Codes
by: Gkekas, Angelos, et al.
Published: (2025)