English
Related papers

Related papers: Bilateral Inversion Principles

200 papers

This paper maps out the relation between different approaches for handling preferences in argumentation with strict rules and defeasible assumptions by offering translations between them. The systems we compare are: non-prioritized defeats…

Artificial Intelligence · Computer Science 2017-10-02 Jesse Heyninck , Christian Straßer , Pere Pardo

Adjoint logic is a general approach to combining multiple logics with different structural properties, including linear, affine, strict, and (ordinary) intuitionistic logics, where each proposition has an intrinsic mode of truth. It has…

Logic in Computer Science · Computer Science 2024-02-05 Junyoung Jang , Sophia Roshal , Frank Pfenning , Brigitte Pientka

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

In this paper we introduce Commutative/Non-Commutative Logic (CNC logic) and two categorical models for CNC logic. This work abstracts Benton's Linear/Non-Linear Logic by removing the existence of the exchange structural rule. One should…

Logic in Computer Science · Computer Science 2019-04-16 Jiaming Jiang , Harley Eades , Valeria de Paiva

Relational properties arise in many settings: relating two versions of a program that use different data representations, noninterference properties for security, etc. The main ingredient of relational verification, relating aligned pairs…

Logic in Computer Science · Computer Science 2016-11-29 Anindya Banerjee , David A. Naumann , Mohammad Nikouei

This paper introduces a logical system, called BV, which extends multiplicative linear logic by a non-commutative self-dual logical operator. This extension is particularly challenging for the sequent calculus, and so far it is not achieved…

Logic in Computer Science · Computer Science 2007-05-23 Alessio Guglielmi

We show that the main results of the expected utility and dual utility theories can be derived in a unified way from two fundamental mathematical ideas: the separation principle of convex analysis, and integral representations of continuous…

Functional Analysis · Mathematics 2012-11-20 Darinka Dentcheva , Andrzej Ruszczynski

Since Voiculescu introduced his bi-free probability theory in 2013, the major development of the theory has been on its combinatorial side; in particular, on the combinatorics of bi-free cumulants and its application to the bi-free…

Operator Algebras · Mathematics 2016-05-02 Hao-Wei Huang , Jiun-Chau Wang

In this paper an approach to automated deduction under uncertainty,based on possibilistic logic, is proposed ; for that purpose we deal with clauses weighted by a degree which is a lower bound of a necessity or a possibility measure,…

Artificial Intelligence · Computer Science 2013-04-08 Didier Dubois , Jerome Lang , Henri Prade

The postulates of comprehension and extensionality in set theory are based on an inversion principle connecting set-theoretic abstraction and the property of having a member. An exactly analogous inversion principle connects functional…

Category Theory · Mathematics 2007-05-23 K. Dosen

Bi-intuitionistic logic is the extension of intuitionistic logic with a connective dual to implication. Bi-intuitionistic logic was introduced by Rauszer as a Hilbert calculus with algebraic and Kripke semantics. But her subsequent…

Logic in Computer Science · Computer Science 2007-05-23 Linda Buisman , Rajeev Goré

In classical analysis, the convergence behavior of power series solutions to differential or recurrence equations is generally assumed to be invariant under internal rearrangement. This paper challenges that belief by proving that, for…

Classical Analysis and ODEs · Mathematics 2025-04-15 Yoon-Seok Choun

We introduce a new boundary Harnack principle in Lipschitz domains for equations with right hand side. Our approach, which uses comparisons and blow-ups, will adapt to more general domains as well as other types of operators. We prove the…

Analysis of PDEs · Mathematics 2019-07-24 Mark Allen , Henrik Shahgholian

Many theorems of mathematics have the form that for a certain problem, e.g. a differential equation or polynomial (in)equality, there exists a solution. The sequential version then states that for a sequence of problems, there is a sequence…

Logic · Mathematics 2024-03-21 Dag Normann , Sam Sanders

Double-negation translations are used to encode and decode classical proofs in intuitionistic logic. We show that, in the cut-free fragment, we can simplify the translations and introduce fewer negations. To achieve this, we consider the…

Logic in Computer Science · Computer Science 2013-12-20 Mélanie Boudard , Olivier Hermant

In this report, we introduce observation algebras, constructed by considering the downclosed subsets of a coherence space ordered by reverse inclusion. These may be interpreted as specifications of sets of events via some predicates with…

Logic in Computer Science · Computer Science 2025-03-11 Paul Brunet

We introduce a new version of arithmetic in all finite types which extends the usual versions with primitive notions of extensionality and extensional equality. This new hybrid version allows us to formulate a strong form of extensionality,…

Logic · Mathematics 2023-10-26 Benno van den Berg

We develop a new approach to recurrence and the existence of non-constant harmonic functions on infinite weighted graphs. The approach is based on the capacity of subsets of metric boundaries with respect to intrinsic metrics. The main tool…

Functional Analysis · Mathematics 2023-01-06 Daniel Lenz , Simon Puchert , Marcel Schmidt

Fiore and Hur recently introduced a conservative extension of universal algebra and equational logic from first to second order. Second-order universal algebra and second-order equational logic respectively provide a model theory and a…

Logic in Computer Science · Computer Science 2013-08-27 Marcelo Fiore , Ola Mahmoud

We present a calculus providing a Curry-Howard correspondence to classical logic represented in the sequent calculus with explicit structural rules, namely weakening and contraction. These structural rules introduce explicit erasure and…

Logic in Computer Science · Computer Science 2012-03-23 Silvia Ghilezan , Pierre Lescanne , Dragisa Zunic