English
Related papers

Related papers: Bilateral Inversion Principles

200 papers

We show that numerous distinctive concepts of constructive mathematics arise automatically from an "antithesis" translation of affine logic into intuitionistic logic via a Chu/Dialectica construction. This includes apartness relations,…

Logic · Mathematics 2022-07-27 Michael Shulman

This paper proposes a mechanism for learning pattern correspondences between two languages from a corpus of translated sentence pairs. The proposed mechanism uses analogical reasoning between two translations. Given a pair of translations,…

cmp-lg · Computer Science 2008-02-03 Ilyas Cicekli , H. Altay Guvenir

We prove that for the intermediate logics with the disjunction property any basis of admissible rules can be reduced to a basis of admissible m-rules (multiple-conclusion rules), and every basis of admissible m-rules can be reduced to a…

Logic · Mathematics 2015-09-03 Alex Citkin

It is well known that if a function from set A to set B has a right inverse then the function is a surjection and the right inverse is an injection. For finite sets, the number of functions, injections, and surjections can also be counted.…

Discrete Mathematics · Computer Science 2015-01-09 Roy S. Freedman

It is commonly agreed that the success of future proof assistants will rely on their ability to incorporate computations within deduction in order to mimic the mathematician when replacing the proof of a proposition P by the proof of an…

Logic in Computer Science · Computer Science 2007-07-10 Frédéric Blanqui , Jean-Pierre Jouannaud , Pierre-Yves Strub

Convolutions or Hadamard products of analytic functions is a well explored area of research and many nice results are available in literature. On the other hand, very little is known in general about the convolutions of univalent harmonic…

Complex Variables · Mathematics 2019-11-07 Chinu Singla , Sushma Gupta , Sukhjit Singh

Within the program of finding axiomatizations for various parts of computability logic, it was proved earlier that the logic of interactive Turing reduction is exactly the implicative fragment of Heyting's intuitionistic calculus. That sort…

Logic in Computer Science · Computer Science 2011-04-15 Giorgi Japaridze

This paper proposes an alternative to the classical price-adjustment mechanism (called "t\^{a}tonnement" after Walras) that is second-order in time. The proposed mechanism, an analogue to the damped harmonic oscillator, provides a dynamic…

General Finance · Quantitative Finance 2011-08-25 Eric Kemp-Benedict

This paper addresses the issue of inversion in cases where (1) the observation system is modeled by a linear transformation and additive noise, (2) the problem is ill-posed and regularization is introduced in a Bayesian framework by an a…

Machine Learning · Statistics 2026-02-12 Jean-François Giovannelli

Counterfactual inference aims to estimate the counterfactual outcome at the individual level given knowledge of an observed treatment and the factual outcome, with broad applications in fields such as epidemiology, econometrics, and…

Machine Learning · Computer Science 2025-10-06 Peng Wu , Haoxuan Li , Chunyuan Zheng , Yan Zeng , Jiawei Chen , Yang Liu , Ruocheng Guo , Kun Zhang

We propose to solve inverse problems involving the temporal evolution of physics systems by leveraging recent advances from diffusion models. Our method moves the system's current state backward in time step by step by combining an…

Machine Learning · Computer Science 2023-12-06 Benjamin J. Holzschuh , Simona Vegetti , Nils Thuerey

The recapture relationship is an important element to any understanding of the connexion between different systems of logic. Loosely speaking, one system of logic recaptures another if it is possible to specify a subsystem of the former…

Logic · Mathematics 2007-05-23 Andrew Aberdein

Considering a linearly ordered set, we introduce its symmetric version, and endow it with two operations extending supremum and infimum, so as to obtain an algebraic structure close to a commutative ring. We show that imposing symmetry…

Discrete Mathematics · Computer Science 2007-11-16 Michel Grabisch

Let $F(z)=z-H(z)$ with $o(H(z))\geq 2$ be a formal map from $\bC^n$ to $\bC^n$ and $G(z)$ the formal inverse of $F(z)$. In this paper, we fist study the deformation $F_t(z)=z-tH(z)$ and its formal inverse map $G_t(z)$. We then derive two…

Complex Variables · Mathematics 2007-05-23 Wenhua Zhao

The aim of this paper is to introduce a new framework for defining abductive reasoning operators based on a notion of retraction in arbitrary logics defined as satisfaction systems. We show how this framework leads to the design of…

Artificial Intelligence · Computer Science 2018-03-06 Marc Aiguier , Jamal Atif , Isabelle Bloch , Ramón Pino-Pérez

In $e^+e^-$ shape-variable studies, and in particular for the case of thrust, fixed-order QCD predictions are typically supplemented with the resummation of contributions enhanced near the two-jet limit. In this work we examine whether…

High Energy Physics - Phenomenology · Physics 2026-03-09 Luca Buonocore , Paolo Nason , Luca Rottoli , Paolo Torrielli

Prawitz suggested expanding a natural deduction system for intuitionistic logic to include rules for classical logic constructors, allowing both intuitionistic and classical elements to coexist without losing their inherent characteristics.…

Logic · Mathematics 2025-04-15 João Rasga , Cristina Sernadas

This study proposes an approach to describing personality dynamics through mathematical modelling of introversion, extroversion, and ambiversion processes. Introversion is interpreted as a recursive process characterized by deep…

Physics and Society · Physics 2025-01-03 Eldar Knar

We explore the Collatz conjecture and its variants through the lens of termination of string rewriting. We construct a rewriting system that simulates the iterated application of the Collatz function on strings corresponding to mixed…

Logic in Computer Science · Computer Science 2023-01-03 Emre Yolcu , Scott Aaronson , Marijn J. H. Heule

We propose an incremental approach for safety proofs that decomposes a proof with a complex inductive invariant into a sequence of simpler proof steps. Our proof system combines rules for (i) forward reasoning using inductive invariants,…

Logic in Computer Science · Computer Science 2026-04-17 Eden Frenkel , Kenneth L. McMillan , Oded Padon , Sharon Shoham