Federico L. G. Faroldi

dblp:147/5999 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2024
0000-0002-0069-2022ORCID · corroborated

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

Theory of computation · 2 · 2 first-author · 2 since 2021
YearPublicationVenuePosition
2024 Consistency and permission in deontic justification logic
abstract
Abstract Different notions of the consistency of obligations collapse in standard deontic logic. In justification logics, which feature explicit reasons for obligations, the situation is different. Their strength depends on a constant specification and on the available set of operations for combining different reasons. We present different consistency principles in justification logic and compare their logical strength. We propose a novel semantics for which justification logics with the explicit version of axiom D, $\textbf {jd}$, are complete for arbitrary constant specifications. Consistency is sometimes formulated in terms of permission. We therefore study permission in the context of justification logic, introducing a notion of free-choice permission for the first time. We then discuss the philosophical implications with regard to some deontic paradoxes.
Federico L. G. Faroldi, Meghdad Ghari, Eveline Lehmann, Thomas Studer
J. Log. Comput.1
2023 Conditional Obligations in Justification Logic
Federico L. G. Faroldi, Atefeh Rohani, Thomas Studer
WoLLIC1