Related papers: A Basic {\L}ukasiewicz m-valued conditional logic
We investigate some finitely-valued generalizations of propositional dynamic logic with tests. We start by introducing the (n+1)-valued Kripke models and a corresponding language based on a modal extension of {\L}ukasiewicz many-valued…
In this paper, we introduce a new defeasible version of propositional standpoint logic by integrating Kraus et al.'s defeasible conditionals, Britz and Varzinczak's notions of defeasible necessity and distinct possibility, along with…
The Tarskian classical relevant logic TR arises from Tarski's work on the foundations of the calculus of relations and on first-order logic restricted to finitely many variables, presented by Tarski and Givant their book, A Formalization of…
We explore the problem of explaining observations in contexts involving statements with truth degrees such as `the lift is loaded', `the symptoms are severe', etc. To formalise these contexts, we consider infinitely-valued {\L}ukasiewicz…
We propose analyzing conditional reasoning by appeal to a notion of intervention on a simulation program, formalizing and subsuming a number of approaches to conditional thinking in the recent AI literature. Our main results include a…
We study whether a logic based on team semantics can be enriched with a conditional satisfying minimal requirements--namely, preservation of the closure property of the logic, Modus Ponens, and the Deduction Theorem. We show that such…
In this chapter, we introduce a new dialogical system for first order classical logic which is close to natural language argumentation, and we prove its completeness with respect to usual classical validity. We combine our dialogical system…
The classical propositional logic is known to be sound and complete with respect to the set semantics that interprets connectives as set operations. The paper extends propositional language by a new binary modality that corresponds to…
We introduce a new logic that combines Adjoint Logic with Graded Necessity Modalities. This results in a very expressive system capable of controlling when and how structural rules are used. We give a sequent calculus, natural deduction,…
We study two notions of definability for classes of relational structures based on modal extensions of {\L}ukasiewicz finitely valued-logics. The main results of the paper are the equivalent of the Goldblatt - Thomason theorem for these…
Classically, two propositions are logically equivalent precisely when they are true under the same logical valuations. Also, two logical valuations are distinct if, and only if, there is a formula that is true according to one valuation,…
In this paper, once recalled some properties of CMV-algebras, we introduce an expansion of the one-variable fragment of Lukasiewicz propositional logic whose algebraic semantics is the variety of CMV-algebras.
Propositional Dynamic Logic, PDL, is a modal logic designed to formalize the reasoning about programs. By extending accessibility between states to states and state sets, concurrent propositional dynamic logic CPDL, is introduced to include…
We introduce a basic intuitionistic conditional logic $\mathsf{IntCK}$ that we show to be complete both relative to a special type of Kripke models and relative to a standard translation into first-order intuitionistic logic. We show that…
In this paper we will see deductive systems for classical propositional and predicate logic in the calculus of structures. Like sequent systems, they have a cut rule which is admissible. In addition, they enjoy a top-down symmetry and some…
Logical formalisms provide a natural and concise means for specifying and reasoning about preferences. In this paper, we propose lexicographic logic, an extension of classical propositional logic that can express a variety of preferences,…
In this paper we present, by way of case studies, a proof of concept, based on a prototype working on a automotive data set, aimed at showing the potential usefulness of using formulas of {\L}ukasiewicz propositional logic to query…
Causal reasoning (CR) is a crucial aspect of intelligence, essential for problem-solving, decision-making, and understanding the world. While language models (LMs) can generate rationales for their outputs, their ability to reliably perform…
The formal construction of the second-order logic or predicate calculus essentially adds quantifiers to propositional logic. Why second-order logic cannot be reduced to that of the first order? How to demonstrate that certain predicates are…
Nonmonotonic logics are usually characterized by the presence of some notion of 'conditional' that fails monotonicity. Research on nonmonotonic logics is therefore largely concerned with the defeasibility of argument forms and the…