Eugenio Orlandelli

dblp:138/3766 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
3since 2021 · last 2023
0000-0002-4021-8667ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 3 · 2 first-author · 3 since 2021
YearPublicationVenuePosition
2023 Nested Sequents for Quantified Modal Logics
abstract
Abstract This paper studies nested sequents for quantified modal logics. In particular, it considers extensions of the propositional modal logics definable by the axioms D , T , B , 4 , and 5 with varying, increasing, decreasing, and constant domains. Each calculus is proved to have good structural properties: weakening and contraction are height-preserving admissible and cut is (syntactically) admissible. Each calculus is shown to be equivalent to the corresponding axiomatic system and, thus, to be sound and complete. Finally, it is argued that the calculi are internal—i.e., each sequent has a formula interpretation—whenever the existence predicate is expressible in the language.
Tim S. Lyon, Eugenio Orlandelli
TABLEAUX2
2022 Labelled sequent calculi for logics of strict implication
Eugenio Orlandelli, Matteo Tesi
AiML1
2021 Labelled calculi for quantified modal logics with definite descriptions
abstract
Abstract We introduce labelled sequent calculi for quantified modal logics with definite descriptions. We prove that these calculi have the good structural properties of G3-style calculi. In particular, all rules are height-preserving invertible, weakening and contraction are height-preserving admissible and cut is syntactically admissible. Finally, we show that each calculus gives a proof-theoretic characterization of validity in the corresponding class of models.
Eugenio Orlandelli
J. Log. Comput.1