English
Related papers

Related papers: Directional Deduction

200 papers

Intuitionistic grammar logics fuse constructive and multi-modal reasoning while permitting the use of converse modalities, serving as a generalization of standard intuitionistic modal logics. In this paper, we provide definitions of these…

Logic in Computer Science · Computer Science 2025-12-04 Tim S. Lyon

In this paper we consider noetherianity for formulas of propositional and predicate calculus over different fields. Three types of noetherianity are considered: standard noetherianity, logical noetherianity and denumerable noetherianity.

Algebraic Geometry · Mathematics 2008-02-05 Aivars Berzins

The logic FO(ID) uses ideas from the field of logic programming to extend first order logic with non-monotone inductive definitions. Such logic formally extends logic programming, abductive logic programming and datalog, and thus formalizes…

Logic in Computer Science · Computer Science 2012-07-12 Ping Hou , Johan Wittocx , Marc Denecker

In this paper we explore the design of sequent calculi operating on graphs. For this purpose, we introduce a set of logical connectives allowing us to extend the correspondence between cographs and classical propositional formulas to any…

Logic in Computer Science · Computer Science 2024-02-13 Matteo Acclavio

In this paper we provide a unifying description of different types of semantics of modal logic found in the literature via the framework of topological categories. In the style of categorical logic, we establish an exact correspondence…

Category Theory · Mathematics 2023-08-01 Lingyuan Ye

In this paper we present methods of transition from one perspective on logic to others, and apply this in particular to obtain a coalgebraic presentation of logic. The central ingredient in this process is to view consequence relations as…

Logic · Mathematics 2012-02-07 Dirk Hofmann , Manuel A. Martins

The logic of constant domains is intuitionistic logic extended with the so-called forall-shift axiom, a classically valid statement which implies the excluded middle over decidable formulas. Surprisingly, this logic is constructive and so…

Logic · Mathematics 2018-10-19 Federico Aschieri

When proving theorems from large sets of logical assertions, it can be helpful to restrict the search for a proof to those assertions that are relevant, that is, closely related to the theorem in some sense. For example, in the Watson…

Logic in Computer Science · Computer Science 2019-05-23 David A. Plaisted

This paper presents and discusses several methods for reasoning from inconsistent knowledge bases. A so-called argumentative-consequence relation taking into account the existence of consistent arguments in favor of a conclusion and the…

Artificial Intelligence · Computer Science 2013-03-08 Salem Benferhat , Didier Dubois , Henri Prade

Many-valued logics in general, and fuzzy logics in particular, usually focus on a notion of consequence based on preservation of full truth, typical represented by the value 1 in the semantics given the real unit interval [0,1]. In a recent…

Logic · Mathematics 2025-10-08 Guillermo Badia , Ronald Fagin , Carles Noguera

In this paper we present two terminating tableau calculi for propositional Dummett logic obeying the subformula property. The ideas of our calculi rely on the linearly ordered Kripke semantics of Dummett logic. The first calculus works on…

Logic in Computer Science · Computer Science 2012-06-21 Guido Fiorino

We develop a second-order extension of intuitionistic modal logic, allowing quantification over propositions, both syntactically and semantically. A key feature of second-order logic is its capacity to define positive connectives from the…

Logic in Computer Science · Computer Science 2026-02-09 Justus Becker , Anupam Das , Sonia Marin , Paaras Padhiar

A simple framework for reasoning under uncertainty and intervention is introduced. This is achieved in three steps. First, logic is restated in set-theoretic terms to obtain a framework for reasoning under certainty. Second, this framework…

Statistics Theory · Mathematics 2010-08-18 Pedro A. Ortega

Deduction, induction, and abduction are fundamental reasoning paradigms, core for human logical thinking. Although improving Large Language Model (LLM) reasoning has attracted significant research efforts, the extent to which the…

Computation and Language · Computer Science 2026-02-11 Mingzi Cao , Xingwei Tan , Mahmud Elahi Akhter , Marco Valentino , Maria Liakata , Xi Wang , Nikolaos Aletras

In functional programming, datatypes a la carte provide a convenient modular representation of recursive datatypes, based on their initial algebra semantics. Unfortunately it is highly challenging to implement this technique in proof…

Logic in Computer Science · Computer Science 2015-09-11 Paolo Torrini , Tom Schrijvers

The implication relationship between subsystems in Reverse Mathematics has an underlying logic, which can be used to deduce certain new Reverse Mathematics results from existing ones in a routine way. We use techniques of modal logic to…

Logic · Mathematics 2015-04-21 Carl Mummert , Alaeddine Saadaoui , Sean Sovine

We study a synthetic corpus based approach for language models (LMs) to acquire logical deductive reasoning ability. The previous studies generated deduction examples using specific sets of deduction rules. However, these rules were limited…

Artificial Intelligence · Computer Science 2023-11-15 Terufumi Morishita , Gaku Morio , Atsuki Yamaguchi , Yasuhiro Sogawa

The introduction of explicit notions of rejection, or disbelief, into logics for knowledge representation can be justified in a number of ways. Motivations range from the need for versions of negation weaker than classical negation, to the…

Artificial Intelligence · Computer Science 2007-05-23 Samir Chopra , Johannes Heidema , Thomas Meyer

The preferential conditional logic PCL, introduced by Burgess, and its extensions are studied. First, a natural semantics based on neighbourhood models, which generalise Lewis' sphere models for counterfactual logics, is proposed. Soundness…

Logic in Computer Science · Computer Science 2020-02-17 Marianna Girlando , Sara Negri , Nicola Olivetti

We define a family of intuitionistic non-normal modal logics; they can bee seen as intuitionistic counterparts of classical ones. We first consider monomodal logics, which contain only one between Necessity and Possibility. We then consider…

Logic in Computer Science · Computer Science 2019-01-30 Tiziano Dalmonte , Charles Grellois , Nicola Olivetti