English
Related papers

Related papers: Normalisation for Some Infectious Logics and Their…

200 papers

This paper presents an extension of Defeasible Deontic Logic to deal with the Pragmatic Oddity problem. The logic applies three general principles: (1) the Pragmatic Oddity problem must be solved within a general logical treatment of CTD…

Logic in Computer Science · Computer Science 2022-09-13 Guido Governatori , Silvano Colombo Tosatto , Antonino Rotolo

In this paper we provide a simplified semantics for the logic KD45(G), i.e. the many-valued G\"odel counterpart of the classical modal logic KD45. More precisely, we characterize KD45(G) as the set of valid formulae of the class of…

Logic in Computer Science · Computer Science 2016-11-15 Félix Bou , Francesc Esteva , Lluís Godo , Ricardo Oscar Rodriguez

In this paper, we present a generalisation of a theorem of David and Rob Pollack. In 'A construction of rigid analytic cohomology classes for congruence subgroups of SL(3,Z)', they give a very general argument for lifting ordinary…

Number Theory · Mathematics 2018-06-18 Chris Williams

We introduce a new Gentzen-style framework of grafted hypersequents that combines the formalism of nested sequents with that of hypersequents. To illustrate the potential of the framework, we present novel calculi for the modal logics…

Logic in Computer Science · Computer Science 2023-08-01 Roman Kuznets , Björn Lellmann

In 1965 Dag Prawitz presented an extension of Gentzen-type systems of Natural Deduction to modal concepts of S4. Maria da Paz Medeiros showed in 2006 that the proof of normalisation for classical S4 does not hold and proposed a new proof of…

Logic in Computer Science · Computer Science 2015-09-22 Bruno Lopes , Cecília Englander , Fernanda Lobo , Marcela Cruz

We introduce a paraconsistent expansion of the G\"{o}del logic with a De Morgan negation $\neg$ and modalities $\blacksquare$ and $\blacklozenge$. We equip it with Kripke semantics on frames with two (possibly fuzzy) relations: $R^+$ and…

Logic · Mathematics 2023-09-26 Marta Bilkova , Sabine Frittella , Daniil Kozhemiachenko

In this paper we study the logical foundations of automated inductive theorem proving. To that aim we first develop a theoretical model that is centered around the difficulty of finding induction axioms which are sufficient for proving a…

Logic in Computer Science · Computer Science 2023-06-22 Stefan Hetzl , Tin Lok Wong

We endow prioritised default logic (PDL) with argumentation semantics using the ASPIC+ framework for structured argumentation, and prove that the conclusions of the justified arguments are exactly the prioritised default extensions.…

Artificial Intelligence · Computer Science 2015-07-02 Anthony P. Young , Sanjay Modgil , Odinaldo Rodrigues

It is standard to regard the intuitionistic restriction of a classical logic as increasing the expressivity of the logic because the classical logic can be adequately represented in the intuitionistic logic by double-negation, while the…

Logic in Computer Science · Computer Science 2010-06-17 Kaustuv Chaudhuri

This article presents modal versions of resource-conscious logics. We concentrate on extensions of variants of Linear Logic with one minimal non-normal modality. In earlier work, where we investigated agency in multi-agent systems, we have…

Logic in Computer Science · Computer Science 2015-09-07 Daniele Porello , Nicolas Troquard

Most non-classical logics are subclassical, that is, every inference/theorem they validate is also valid classically. A notable exception is the three-valued propositional Logic of Ordinary Discourse (OL) proposed and extensively motivated…

Logic · Mathematics 2024-05-07 Vitor Greati , Sérgio Marcelino , Umberto Rivieccio

We axiomatize the provability logic of $\HA$ and prove its decidability. Furthermore, we axiomatize the preservativity and relative admissibility relations for several modal logics extending iK4. A principal technical tool is the…

Logic · Mathematics 2026-01-05 Mojtaba Mojtahedi

We translate the argumentation networks ${\cal A}=(S, R)$ into a theory $D$ of intuitionistic logic, retaining $S$ as the domain and using intuitionistic negation to model the attack $R$ in ${\cal A}$: the attack $xRy$ is translated to…

Logic in Computer Science · Computer Science 2015-10-02 Dov Gabbay , Michael Gabbay

The paper considers the representation of k-valued logical functions in the class of disjunctive normal forms. Various classes of monotone functions of k-valued logic are investigated. Theorems are proved on the coincidence of reduced and…

Logic · Mathematics 2024-02-01 Anvar Kabulov , Abdussattar Baizhumanov , Mansur Berdimurodov

Developing a suggestion by Russell, Prawitz showed how the usual natural deduction inference rules for disjunction, conjunction and absurdity can be derived using those for implication and the second order quantifier in propositional…

Logic · Mathematics 2019-08-30 Luca Tranchini , Paolo Pistone , Mattia Petrolo

We introduce and study single-conclusioned nested sequent calculi for a broad class of intuitionistic multi-modal logics known as "intuitionistic grammar logics (IGLs)." These logics serve as the intuitionistic counterparts of classical…

Logic in Computer Science · Computer Science 2026-05-06 Tim S. Lyon

We consider an extension of first-order logic with a recursion operator that corresponds to allowing formulas to refer to themselves. We investigate the obtained language under two different systems of semantics, thereby obtaining two…

Logic · Mathematics 2022-07-18 Reijo Jaakkola , Antti Kuusisto

A survey of paraconsistent logics that are prominent representatives of the different approaches that have been followed to develop paraconsistent logics is provided. The paraconsistent logics that will be discussed are an enrichment of…

Logic in Computer Science · Computer Science 2017-11-15 C. A. Middelburg

We study the properties of the language of Stratified Sets (first-order logic with $\in$ and a stratification condition) as used in TST, TZT, and (with stratifiability instead of stratification) in Quine's NF. We find that the syntax forms…

Logic in Computer Science · Computer Science 2023-06-22 Murdoch J. Gabbay

We develop a model of abduction in abstract argumentation, where changes to an argumentation framework act as hypotheses to explain the support of an observation. We present dialogical proof theories for the main decision problems (i.e.,…

Artificial Intelligence · Computer Science 2014-07-16 Richard Booth , Dov Gabbay , Souhila Kaci , Tjitze Rienstra , Leendert van der Torre