:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Genco, Francesco A.
Format:	Preprint
Published:	2025
Subjects:	Logic
Online Access:	https://arxiv.org/abs/2503.21264
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

Decidability of Quantum Modal Logic
by: Tokuo, Kenji
Published: (2026)

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

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

A Typed Lambda-Calculus for Establishing Trust in Probabilistic Programs
by: Genco, Francesco A., et al.
Published: (2023)

The Alternation Hierarchy of First-Order Logic on Words is Decidable
by: Barloy, Corentin, et al.
Published: (2025)

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

Proof Complexity of Linear Logics
by: Tabatabai, Amirhossein Akbar, et al.
Published: (2026)

Proof-theoretic Semantics for Second-order Logic
by: Gheorghiu, Alexander V., et al.
Published: (2025)

Proof-theoretic Semantics for the Logic of Bunched Implications
by: Gu, Tao, et al.
Published: (2023)

Proof-theoretic Semantics for First-order Logic
by: Gheorghiu, Alexander V.
Published: (2024)

Local Tabularity is Decidable for Bi-Intermediate Logics of Trees and of Co-Trees
by: Martins, Miguel, et al.
Published: (2024)

Possibilistic Computation Tree Logic: Decidability and Complete Axiomatization
by: Li, Yongming
Published: (2025)

Skolemization and Decidability of the Bernays-Schoenfinkel Class in Goedel Logics
by: Gamsakhurdia, Mariami, et al.
Published: (2025)

Deciding Separation Logic with Pointer Arithmetic and Inductive Definitions
by: Su, Wanyun, et al.
Published: (2024)

Deciding Predicate Logical Theories of Real-Valued Functions
by: Ratschan, Stefan
Published: (2023)

Decidability of Graph Neural Networks via Logical Characterizations
by: Benedikt, Michael, et al.
Published: (2024)

Proof-Theoretic Functional Completeness for the Connexive Logic C
by: Ayhan, Sara, et al.
Published: (2025)

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

Checking Trustworthiness of Probabilistic Computations in a Typed Natural Deduction System
by: D'Asaro, Fabio Aurelio, et al.
Published: (2022)

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

Decidability for Sturmian words
by: Hieronymi, Philipp, et al.
Published: (2021)

Deciding the Existence of Interpolants and Definitions in First-Order Modal Logic
by: Kurucz, Agi, et al.
Published: (2023)

Proof-theoretic Semantics for Classical Propositional Logic with Assertion and Denial
by: Gheorghiu, Alexander V., et al.
Published: (2025)

Proof Theory for Bimodal Provability Logics
by: Miranda, Borja Sierra, et al.
Published: (2026)

Proof-theoretic Semantics for Intuitionistic Multiplicative Linear Logic (Extended Abstract)
by: Gheorghiu, Alexander V., et al.
Published: (2023)

Deciding Boolean Separation Logic via Small Models (Technical Report)
by: Dacík, Tomáš, et al.
Published: (2024)

Tableau Proof Systems for Justification Logics
by: Ghari, Meghdad
Published: (2014)

Generalized Decidability via Brouwer Trees
by: de Jong, Tom, et al.
Published: (2026)

Deciding Equations in the Time Warp Algebra
by: van Gool, Sam, et al.
Published: (2023)

Decidability Results for Fragments of First-Order Logic via a Symbolic Model Property
by: Elad, Neta, et al.
Published: (2026)

From Proof-theoretic Validity to Base-extension Semantics for Intuitionistic Propositional Logic
by: Gheorghiu, Alexander V., et al.
Published: (2022)

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

A Proof-Theoretic Study of Modal Logic
by: Kushida, Hirohiko
Published: (2026)

A Decidable Bundled Fragment of First-Order Modal Logic Without Finite Model Property
by: Joshi, Varad, et al.
Published: (2025)

Automata-Theoretic Characterisations of Branching-Time Temporal Logics
by: Benerecetti, Massimo, et al.
Published: (2024)

Algebraic Semantics for the Logic of Proofs
by: Parsa, Amir Farahmand, et al.
Published: (2021)

Adding Circumscription to Decidable Fragments of First-Order Logic: A Complexity Rollercoaster
by: Lutz, Carsten, et al.
Published: (2024)

Decidability of Being a Union-splitting
by: Takahashi, Tenyo
Published: (2025)