activity
20202026
most citedIntuitionistic S4 is decidable

7 citations · 15 across the 10 of their papers we have counts for

collaborators

11 papers

cs.LO2026

Library-Grade Modal Logic

Marianna Girlando, Fabrizio Montesi

Modal logic comprises a broad family of logics to reason about relational structures. The literature presents many such logics, displaying diverse operators, semantics, and applica…

cs.LO2026

A decision procedure for intuitionistic modal logic IS4 (and IK4)

Marianna Girlando, Roman Kuznets, Sonia Marin +1

In this paper, we show that the two intuitionistic modal logics IS4 and IK4 are decidable. We provide a constructive decision procedure, that, given a formula, produces either a pr…

cs.LO2026

Labelled Sequent Calculi for Propositional Team Logics

Fausto Barbero, Marianna Girlando, Valentin Müller +1

Team semantics is a general framework where formulas are not interpreted with respect to a single point of evaluation, but with respect to sets of such points. Team semantics is us…

cs.LO2025

A Proof-Theoretic View of Basic Intuitionistic Conditional Logic (Extended Version)

Tiziano Dalmonte, Marianna Girlando

Intuitionistic conditional logic, studied by Weiss, Ciardelli and Liu, and Olkhovikov, aims at providing a constructive analysis of conditional reasoning. In this framework, the wo…

cs.LO2025

A Bi-nested Calculus for Intuitionistic K: Proofs and Countermodels

Han Gao, Marianna Girlando, Nicola Olivetti

The logic IK is the intuitionistic variant of modal logic introduced by Fischer Servi, Plotkin and Stirling, and studied by Simpson. This logic is considered a fundamental intuitio…

cs.LO2023

A significance-based account of ceteris paribus counterfactuals

Avgerinos Delkos, Marianna Girlando

When evaluating a counterfactual statement, it is often convenient to specify conditions that ought to be kept unchanged. Formally, this can be done by associating to each counterf…

cs.LO2023

Internal and External Calculi: Ordering the Jungle without Being Lost in Translations

Tim S. Lyon, Agata Ciabattoni, Didier Galmiche +5

This paper gives a broad account of the various sequent-based proof formalisms in the proof-theoretic literature. We consider formalisms for various modal and tense logics, intuiti…

cs.LO2023★ 7 cited

Intuitionistic S4 is decidable

Marianna Girlando, Roman Kuznets, Sonia Marin +2

In this paper we demonstrate decidability for the intuitionistic modal logic S4 first formulated by Fischer Servi. This solves a problem that has been open for almost thirty years…

cs.LO2022

Comparative plausibility in neighbourhood models: axiom systems and sequent calculi

Tiziano Dalmonte, Marianna Girlando

We introduce a family of comparative plausibility logics over neighbourhood models, generalising Lewis' comparative plausibility operator over sphere models. We provide axiom syste…

cs.LO2022★ 1 cited

Cyclic Proofs, Hypersequents, and Transitive Closure Logic

Anupam Das, Marianna Girlando

We propose a cut-free cyclic system for Transitive Closure Logic (TCL) based on a form of hypersequents, suitable for automated reasoning via proof search. We show that previously…

cs.LO2020★ 7 cited

Uniform labelled calculi for preferential conditional logics based on neighbourhood semantics

Marianna Girlando, Sara Negri, Nicola Olivetti

The preferential conditional logic PCL, introduced by Burgess, and its extensions are studied. First, a natural semantics based on neighbourhood models, which generalise Lewis' sph…