Image de couverture de livre

Representation Theorems for Cumulative Propositional Dependence Logics

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Kontinen, Juha, Meier, Arne, Sauerwald, Kai
Format:	Preprint
Publié:	2026
Sujets:	Logic in Computer Science Artificial Intelligence 03B70, 03B62 I.2.3; F.4.1
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

On the Complexity of Entailment for Cumulative Propositional Dependence Logics
par: Sauerwald, Kai, et autres
Publié: (2026)

On the Complexity and Properties of Preferential Propositional Dependence Logic
par: Sauerwald, Kai, et autres
Publié: (2025)

A Primer for Preferential Non-Monotonic Propositional Team Logics
par: Sauerwald, Kai, et autres
Publié: (2024)

Which are the True Defeasible Logics?
par: Maher, Michael J.
Publié: (2024)

Encoding argumentation frameworks with set attackers to propositional logic systems
par: Tang, Shuai, et autres
Publié: (2025)

Encoding higher-order argumentation frameworks with supports to propositional logic systems
par: Tang, Shuai
Publié: (2025)

Propositional Dynamic Logic has Craig Interpolation: a tableau-based proof
par: Borzechowski, Manfred, et autres
Publié: (2025)

First-Order Coalition Logic
par: Catta, Davide, et autres
Publié: (2025)

Encoding Argumentation Frameworks to Propositional Logic Systems
par: Tang, Shuai, et autres
Publié: (2025)

Approximate Axiomatization for Differentially-Defined Functions
par: Platzer, André, et autres
Publié: (2025)

Defeasible Reasoning via Datalog$^\neg$
par: Maher, Michael J.
Publié: (2021)

Bennett's Conjecture in Lean 4: Counter-Models for the PSR-Reducibility of Spinoza's Propositions V and XIV
par: Nakamura, Yuki
Publié: (2026)

Universal Algebra in UniMath
par: Amato, Gianluca, et autres
Publié: (2021)

Evaluating Autoformalization Robustness via Semantically Similar Paraphrasing
par: Moore, Hayden, et autres
Publié: (2025)

Description Logics with Two Types of Definite Descriptions: Complexity, Expressiveness, and Automated Deduction
par: Sochański, Michał, et autres
Publié: (2025)

Mechanised uniform interpolation for modal logics K, GL, and iSL
par: Férée, Hugo, et autres
Publié: (2024)

Fixed-Point Theorems and the Ethics of Radical Transparency: A Logic-First Treatment
par: Alpay, Faruk, et autres
Publié: (2025)

The Hamiltonian Syllogistic
par: Pratt-Hartmann, Ian
Publié: (2010)

A novel framework for systematic propositional formula simplification based on existential graphs
par: de Mas, Jordina Francès, et autres
Publié: (2024)

Two strong undefinability results in inquisitive and team semantics
par: Barbero, Fausto
Publié: (2024)

ProofCloud: A Proof Retrieval Engine for Verified Proofs in Higher Order Logic
par: Wang, Shuai
Publié: (2024)

Complexity Results in Team Semantics: Nonemptiness Is Not So Complex
par: Anttila, Aleksi, et autres
Publié: (2025)

Thoughts on sub-Turing interactive computability
par: Japaridze, Giorgi
Publié: (2024)

Hereditary First-Order Logic: the tractable quantifier prefix classes
par: Bodirsky, Manuel, et autres
Publié: (2024)

Coalgebraic Satisfiability Checking for Arithmetic $μ$-Calculi
par: Hausmann, Daniel, et autres
Publié: (2022)

Univalent Material Set Theory
par: Gylterud, Håkon Robbestad, et autres
Publié: (2023)

Complete Robust Hybrid Systems Reachability
par: Wafa, Noah Abou El, et autres
Publié: (2026)

Terminal Coalgebras and Non-wellfounded Sets in Homotopy Type Theory
par: Gylterud, Håkon Robbestad, et autres
Publié: (2020)

Discernment is all you need
par: Fuenmayor, David
Publié: (2026)

Normal forms in cubical type theory
par: Huang, Xu
Publié: (2026)

Extracting total Amb programs from proofs
par: Berger, Ulrich, et autres
Publié: (2023)

Inclusion with repetitions and Boolean constants -- implication problems revisited
par: Häggblom, Matilda
Publié: (2025)

Axiomatization of approximate exclusion
par: Häggblom, Matilda
Publié: (2024)

Axiomatizing approximate inclusion
par: Häggblom, Matilda
Publié: (2025)

Sufficient conditions for local tabularity of a polymodal logic
par: Shapirovsky, Ilya B.
Publié: (2022)

DHoTT: A Temporal Extension of Homotopy Type Theory for Semantic Drift
par: Poernomo, Iman
Publié: (2025)

ASP Chef grows Mustache to look better
par: Alviano, Mario, et autres
Publié: (2025)

Serial Properties, Selector Proofs, and the Provability of Consistency
par: Artemov, Sergei
Publié: (2024)

Non-Compact Proofs
par: Artemov, Sergei
Publié: (2025)

Consistency formula is strictly stronger in PA than PA-consistency
par: Artemov, Sergei
Publié: (2025)