Image de couverture de livre

A Direct Characterisation of Logical Grounds and a Decidability Proof

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Genco, Francesco A.
Format:	Preprint
Publié:	2025
Sujets:	Logic
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A Logic of Knowledge and Justifications, with an Application to Computational Trust
par: Genco, Francesco A.
Publié: (2024)

A Strongly Normalising System of Dependent Types for Transparent and Opaque Probabilistic Computation
par: Genco, Francesco A.
Publié: (2024)

Decidability of Quantum Modal Logic
par: Tokuo, Kenji
Publié: (2026)

Dynamic Probability Logic: Decidability & Computability
par: Chopoghloo, Somayeh, et autres
Publié: (2024)

Decidability of Quasi-Dense Modal Logics
par: Ostropolski-Nalewaja, Piotr, et autres
Publié: (2024)

A Typed Lambda-Calculus for Establishing Trust in Probabilistic Programs
par: Genco, Francesco A., et autres
Publié: (2023)

Decidability in First-Order Modal Logic with Non-Rigid Constants and Definite Descriptions
par: Artale, Alessandro, et autres
Publié: (2025)

The Alternation Hierarchy of First-Order Logic on Words is Decidable
par: Barloy, Corentin, et autres
Publié: (2025)

Proof Complexity of Linear Logics
par: Tabatabai, Amirhossein Akbar, et autres
Publié: (2026)

Proof-theoretic Semantics for Second-order Logic
par: Gheorghiu, Alexander V., et autres
Publié: (2025)

Proof-theoretic Semantics for the Logic of Bunched Implications
par: Gu, Tao, et autres
Publié: (2023)

Proof-theoretic Semantics for First-order Logic
par: Gheorghiu, Alexander V.
Publié: (2024)

Local Tabularity is Decidable for Bi-Intermediate Logics of Trees and of Co-Trees
par: Martins, Miguel, et autres
Publié: (2024)

Possibilistic Computation Tree Logic: Decidability and Complete Axiomatization
par: Li, Yongming
Publié: (2025)

Skolemization and Decidability of the Bernays-Schoenfinkel Class in Goedel Logics
par: Gamsakhurdia, Mariami, et autres
Publié: (2025)

Proof-Theoretic Functional Completeness for the Connexive Logic C
par: Ayhan, Sara, et autres
Publié: (2025)

Deciding Separation Logic with Pointer Arithmetic and Inductive Definitions
par: Su, Wanyun, et autres
Publié: (2024)

Deciding Predicate Logical Theories of Real-Valued Functions
par: Ratschan, Stefan
Publié: (2023)

Decidability of Graph Neural Networks via Logical Characterizations
par: Benedikt, Michael, et autres
Publié: (2024)

Proof Theory and Decision Procedures for Deontic STIT Logics
par: Lyon, Tim S., et autres
Publié: (2024)

Cut elimination for Cyclic Proofs: A Case Study in Temporal Logic
par: Afshari, Bahareh, et autres
Publié: (2024)

Proof-theoretic Semantics for Classical Propositional Logic with Assertion and Denial
par: Gheorghiu, Alexander V., et autres
Publié: (2025)

Proof Theory for Bimodal Provability Logics
par: Miranda, Borja Sierra, et autres
Publié: (2026)

Deciding the Existence of Interpolants and Definitions in First-Order Modal Logic
par: Kurucz, Agi, et autres
Publié: (2023)

Decidability for Sturmian words
par: Hieronymi, Philipp, et autres
Publié: (2021)

Proof-theoretic Semantics for Intuitionistic Multiplicative Linear Logic (Extended Abstract)
par: Gheorghiu, Alexander V., et autres
Publié: (2023)

Deciding Boolean Separation Logic via Small Models (Technical Report)
par: Dacík, Tomáš, et autres
Publié: (2024)

Generalized Decidability via Brouwer Trees
par: de Jong, Tom, et autres
Publié: (2026)

Deciding Equations in the Time Warp Algebra
par: van Gool, Sam, et autres
Publié: (2023)

From Proof-theoretic Validity to Base-extension Semantics for Intuitionistic Propositional Logic
par: Gheorghiu, Alexander V., et autres
Publié: (2022)

Decidability Results for Fragments of First-Order Logic via a Symbolic Model Property
par: Elad, Neta, et autres
Publié: (2026)

Checking Trustworthiness of Probabilistic Computations in a Typed Natural Deduction System
par: D'Asaro, Fabio Aurelio, et autres
Publié: (2022)

Tableau Proof Systems for Justification Logics
par: Ghari, Meghdad
Publié: (2014)

Taking Bi-Intuitionistic Logic First-Order: A Proof-Theoretic Investigation via Polytree Sequents
par: Lyon, Tim S., et autres
Publié: (2024)

A Proof-Theoretic Study of Modal Logic
par: Kushida, Hirohiko
Publié: (2026)

A Decidable Bundled Fragment of First-Order Modal Logic Without Finite Model Property
par: Joshi, Varad, et autres
Publié: (2025)

Decidability of Being a Union-splitting
par: Takahashi, Tenyo
Publié: (2025)

Automata-Theoretic Characterisations of Branching-Time Temporal Logics
par: Benerecetti, Massimo, et autres
Publié: (2024)

Algebraic Semantics for the Logic of Proofs
par: Parsa, Amir Farahmand, et autres
Publié: (2021)

Adding Circumscription to Decidable Fragments of First-Order Logic: A Complexity Rollercoaster
par: Lutz, Carsten, et autres
Publié: (2024)