Imagen de Portada

Bridging Computational Notions of Depth

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Bienvenu, Laurent, Porter, Christopher P.
Formato:	Preprint
Publicado:	2024
Materias:	Logic in Computer Science Logic
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Problems and Consequences of Bilateral Notions of (Meta-)Derivability
por: Ayhan, Sara
Publicado: (2025)

Abductive Reasoning in a Paraconsistent Framework
por: Bienvenu, Meghyn, et al.
Publicado: (2024)

Queries With Exact Truth Values in Paraconsistent Description Logics
por: Bienvenu, Meghyn, et al.
Publicado: (2024)

Relators and Notions of Simulation Revisited
por: Goncharov, Sergey, et al.
Publicado: (2025)

Knowledge Problems in Protocol Analysis: Extending the Notion of Subterm Convergent
por: Bunch, Carter, et al.
Publicado: (2024)

Dynamic Probability Logic: Decidability & Computability
por: Chopoghloo, Somayeh, et al.
Publicado: (2024)

Fixed Point Theorems in Computability Theory
por: Terwijn, Sebastiaan A.
Publicado: (2024)

Computing with Infinite Objects: the Gray Code Case
por: Spreen, Dieter, et al.
Publicado: (2021)

A Faithful and Quantitative Notion of Distant Reduction for the Lambda-Calculus with Generalized Applications
por: Santo, José Espírito, et al.
Publicado: (2022)

Decidability in First-Order Modal Logic with Non-Rigid Constants and Definite Descriptions
por: Artale, Alessandro, et al.
Publicado: (2025)

Meta-Mathematics of Computational Complexity Theory
por: Oliveira, Igor C.
Publicado: (2025)

Constructive Quantum Logics
por: Aguilera, Juan P., et al.
Publicado: (2025)

Forbidden Induced Subgraphs for Bounded Shrub-Depth and the Expressive Power of MSO
por: Mählmann, Nikolas
Publicado: (2025)

Querying and Repairing Inconsistent Prioritized Knowledge Bases: Complexity Analysis and Links with Abstract Argumentation
por: Bienvenu, Meghyn, et al.
Publicado: (2020)

Inconsistency Handling in Prioritized Databases with Universal Constraints: Complexity Analysis and Links with Active Integrity Constraints
por: Bienvenu, Meghyn, et al.
Publicado: (2023)

Querying Inconsistent Prioritized Data with ORBITS: Algorithms, Implementation, and Experiments
por: Bienvenu, Meghyn, et al.
Publicado: (2022)

Central Submonads and Notions of Computation: Soundness, Completeness and Internal Languages
por: Carette, TItouan, et al.
Publicado: (2022)

On Homomorphism Indistinguishability and Hypertree Depth
por: Scheidt, Benjamin
Publicado: (2024)

Demystifying $μ$
por: Afshari, Bahareh, et al.
Publicado: (2024)

Cut elimination for Cyclic Proofs: A Case Study in Temporal Logic
por: Afshari, Bahareh, et al.
Publicado: (2024)

On the logical structure of some maximality and well-foundedness principles equivalent to choice principles
por: Herbelin, Hugo
Publicado: (2024)

The strength of the dominance rule
por: Kołodziejczyk, Leszek Aleksander, et al.
Publicado: (2024)

A Coalgebraic Semantics for Intuitionistic Modal Logic
por: Almeida, Rodrigo Nicolau, et al.
Publicado: (2024)

Decidability of Quasi-Dense Modal Logics
por: Ostropolski-Nalewaja, Piotr, et al.
Publicado: (2024)

The subTuring degrees
por: Kihara, Takayuki, et al.
Publicado: (2024)

The Category of Iterative Sets in Homotopy Type Theory and Univalent Foundations
por: Gratzer, Daniel, et al.
Publicado: (2024)

Incompleteness theorems via Turing category
por: Savelyev, Yasha
Publicado: (2024)

Unifying Sequent Systems for Gödel-Löb Provability Logic via Syntactic Transformations
por: Lyon, Tim S.
Publicado: (2024)

Correspondence and Inverse Correspondence for Input/Output Logic and Region-Based Theories of Space
por: De Domenico, Andrea, et al.
Publicado: (2024)

The Arithmetical Hierarchy: A Realizability-Theoretic Perspective
por: Kihara, Takayuki
Publicado: (2024)

Interpretation of Inaccessible Sets in Martin-Löf Type Theory with One Mahlo Universe
por: Takahashi, Yuta
Publicado: (2024)

Proof Theory and Decision Procedures for Deontic STIT Logics
por: Lyon, Tim S., et al.
Publicado: (2024)

Normalisation for Negative Free Logics without and with Definite Descriptions
por: Kürbis, Nils
Publicado: (2024)

Further remarks on the dual negation in team logics
por: Anttila, Aleksi
Publicado: (2024)

Some General Completeness Results for Propositionally Quantified Modal Logics
por: Ding, Yifeng, et al.
Publicado: (2024)

First-order Logic with Being a Thesis Modal Operator
por: Łyczak, Marcin
Publicado: (2024)

Taking Bi-Intuitionistic Logic First-Order: A Proof-Theoretic Investigation via Polytree Sequents
por: Lyon, Tim S., et al.
Publicado: (2024)

A Cut-free, Sound and Complete Russellian Theory of Definite Descriptions
por: Indrzejczak, Andrzej, et al.
Publicado: (2024)

On Explicit Solutions to Fixed-Point Equations in Propositional Dynamic Logic
por: Lyon, Tim S.
Publicado: (2024)

Denotational semantics driven simplicial homology?
por: Barbarossa, Davide
Publicado: (2024)