English
Related papers

Related papers: Bilateral Inversion Principles

200 papers

Logical bilateralism challenges traditional concepts of logic by treating assertion and denial as independent yet opposed acts. While initially devised to justify classical logic, its constructive variants show that both acts admit…

Logic in Computer Science · Computer Science 2026-05-05 Victor Barroso-Nascimento , Maria Osório , Elaine Pimentel

Bilateralists hold that the meanings of the connectives are determined by rules of inference for their use in deductive reasoning with asserted and denied formulas. This paper presents two bilateral connectives comparable to Prior's tonk,…

Logic in Computer Science · Computer Science 2021-08-13 Nils Kürbis

Prawitz formulated the so-called inversion principle as one of the characteristic features of Gentzen's intuitionistic natural deduction. In the literature on proof-theoretic semantics, this principle is often coupled with another that is…

Logic in Computer Science · Computer Science 2022-01-03 Alberto Naibo , Yuta Takahashi

Bilateralism is the position according to which assertion and rejection are conceptually independent speech acts. Logical bilateralism demands that systems of logic provide conditions for assertion and rejection that are not reducible to…

Logic · Mathematics 2025-05-06 Victor Barroso-Nascimento , Maria Osório

A bilateralist take on proof-theoretic semantics can be understood as demanding of a proof system to display not only rules giving the connectives' provability conditions but also their refutability conditions. On such a view, then, a…

Logic in Computer Science · Computer Science 2025-10-17 Sara Ayhan

The paper presents a method for obtaining problems whose conclusions contain disjunctive propositions. These problems constitute a version of inverse problems with a given logical structure. The logical models in the groups of problems…

History and Overview · Mathematics 2014-11-24 Julia Ninova , Vesselka Mihova

By suitable examples we illustrate an algorithm for composition of inverse problems.

History and Overview · Mathematics 2014-11-24 Julia Ninova , Vesselka Mihova

Bi-intuitionistic logic is the conservative extension of intuitionistic logic with a connective dual to implication. It is sometimes presented as a symmetric constructive subsystem of classical logic. In this paper, we compare three sequent…

Logic in Computer Science · Computer Science 2011-01-31 Luís Pinto , Tarmo Uustalu

We present a unified theory for formal mathematical systems including recursive systems closely related to formal grammars, including the predicate calculus as well as a formal induction principle. We introduce recursive systems generating…

Logic · Mathematics 2021-12-21 Matthias Kunik

In an impressive series of papers, Krivine showed at the edge of the last decade how classical realizability provides a surprising technique to build models for classical theories. In particular, he proved that classical realizability…

Logic in Computer Science · Computer Science 2020-07-16 Étienne Miquey

In this paper we cover a few topics on how to treat inverse problems. There are two different flows of ideas. One approach is based on Morse Lemma. The other is based on analyticity which proves that the number of solutions to the inverse…

Classical Analysis and ODEs · Mathematics 2024-08-28 Marian Petrica , Ionel Popescu

The aim of this article is to generalize logics of formal inconsistency ($\textbf{LFI}$s) to systems dealing with the concept of incompatibility, expressed by means of a binary connective. The basic idea is that having two incompatible…

Logic · Mathematics 2022-02-23 Marcelo Esteban Coniglio , Guilherme Vicentin de Toledo

In this paper I will develop a lambda-term calculus, lambda-2Int, for a bi-intuitionistic logic and discuss its implications for the notions of sense and denotation of derivations in a bilateralist setting. Thus, I will use the Curry-Howard…

Logic in Computer Science · Computer Science 2024-02-26 Sara Ayhan

Gradual semantics with abstract argumentation provide each argument with a score reflecting its acceptability, i.e. how "much" it is attacked by other arguments. Many different gradual semantics have been proposed in the literature, each…

Artificial Intelligence · Computer Science 2022-02-02 Nir Oren , Bruno Yun , Srdjan Vesic , Murilo Baptista

Gradual semantics within abstract argumentation associate a numeric score with every argument in a system, which represents the level of acceptability of this argument, and from which a preference ordering over arguments can be derived.…

Artificial Intelligence · Computer Science 2022-03-03 Nir Oren , Bruno Yun , Assaf Libman , Murilo S. Baptista

Alternation of forward and backward analyses is a standard technique in abstract interpretation of programs, which is in particular useful when we wish to prove unreachability of some undesired program states. The current state-of-the-art…

Programming Languages · Computer Science 2017-08-08 Alexey Bakhirkin , David Monniaux

The paper is a contribution both to the theoretical foundations and to the actual construction of efficient automatizable proof procedures for non-classical logics. We focus here on the case of finite-valued logics, and exhibit: (i) a…

Logic in Computer Science · Computer Science 2014-08-19 Carlos Caleiro , João Marcos , Marco Volpe

This work was intended to be an attempt to introduce the meta-language for working with multiple-conclusion inference rules that admit asserted propositions along with the rejected propositions. The presence of rejected propositions, and…

Logic · Mathematics 2014-12-01 Alex Citkin

The bilateralist approach to logical consequence maintains that judgments of different qualities should be taken into account in determining what-follows-from-what. We argue that such an approach may be actualized by a two-dimensional…

Logic in Computer Science · Computer Science 2021-07-20 Vitor Greati , Sérgio Marcelino , João Marcos

We describe a new method of finding interpolants for classical logic using certain refutation system as a starting point. Refutation can be thought of as an alternative approach to the analysis of formal systems: instead of focusing on…

Logic in Computer Science · Computer Science 2026-03-18 Adam Trybus , Karolina Rożko , Tomasz Skura
‹ Prev 1 2 3 10 Next ›