English
Related papers

Related papers: Translating Equality Downwards

200 papers

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

We prove that the join of two sets may actually fall into a lower level of the extended low hierarchy than either of the sets. In particular, there exist sets that are not in the second level of the extended low hierarchy, EL_2, yet their…

Computational Complexity · Computer Science 2007-05-23 Lane A. Hemaspaandra , Zhigen Jiang , Joerg Rothe , Osamu Watanabe

The poset of permutations of [n] under Bruhat ordering is studied. We give nontrivial upper and lower bounds for the number of comparable pairs of permutations in both the weak and strong versions of this order. In light of numerical…

Probability · Mathematics 2007-05-23 Adam Hammett , Boris Pittel

We study the joint distributions of translated measures supported on leaves which are expanded by subgroups of diagonal matrices and generalize previous results of Kleinbock--Margulis, Dabbs--Kelly--Li, and Shi. More specifically, we…

Dynamical Systems · Mathematics 2021-05-13 Michael Björklund , Alexander Gorodnik

Forgetting variables from a propositional formula may increase its size. Introducing new variables is a way to shorten it. Both operations can be expressed in terms of common equivalence, a weakened version of equivalence. In turn, common…

Logic in Computer Science · Computer Science 2021-05-07 Paolo Liberatore

Cross-lingual transfer of word embeddings aims to establish the semantic mappings among words in different languages by learning the transformation functions over the corresponding word embedding spaces. Successfully solving this problem…

Computation and Language · Computer Science 2018-09-12 Ruochen Xu , Yiming Yang , Naoki Otani , Yuexin Wu

Across machine learning (ML) sub-disciplines, researchers make explicit mathematical assumptions in order to facilitate proof-writing. We note that, specifically in the area of fairness-accuracy trade-off optimization scholarship, similar…

Computers and Society · Computer Science 2021-09-09 A. Feder Cooper , Ellen Abrams

This paper proposes a bilevel hierarchy of strengthened complex moment relaxations for complex polynomial optimization. The key trick entails considering a class of positive semidefinite conditions that arise naturally in characterizing the…

Optimization and Control · Mathematics 2025-05-12 Jie Wang

The quality of machine translation has increased remarkably over the past years, to the degree that it was found to be indistinguishable from professional human translation in a number of empirical investigations. We reassess Hassan et…

Computation and Language · Computer Science 2020-04-06 Samuel Läubli , Sheila Castilho , Graham Neubig , Rico Sennrich , Qinlan Shen , Antonio Toral

These are the notes of my lectures at the 1996 European Congress of Mathematicians. {} Polynomials appear in mathematics frequently, and we all know from experience that low degree polynomials are easier to deal with than high degree ones.…

alg-geom · Mathematics 2008-02-03 János Kollár

Free fall in a uniform gravitational field is revisited in the case of quantum states with and without classical analogue. The interplay between kinematics and dynamics in the evolution of a falling quantum test particle is discussed…

Quantum Physics · Physics 2009-12-30 Lorenza Viola , Roberto Onofrio

We introduce a hierarchy of conditions necessarily satisfied by any distribution P(ab) representing the probabilities for two separate observers to obtain outcomes a and b when making local measurements on a shared quantum state. Each…

Quantum Physics · Physics 2008-03-30 Miguel Navascues , Stefano Pironio , Antonio Acin

Parallel texts (bitexts) have properties that distinguish them from other kinds of parallel data. First, most words translate to only one other word. Second, bitext correspondence is noisy. This article presents methods for biasing…

cmp-lg · Computer Science 2007-05-23 I. Dan Melamed

We study the effect of query order on computational power, and show that $\pjk$-the languages computable via a polynomial-time machine given one query to the jth level of the boolean hierarchy followed by one query to the kth level of the…

Computational Complexity · Computer Science 2007-05-23 Lane A. Hemaspaandra , Harald Hempel , Gerd Wechsung

The term translationese has been used to describe the presence of unusual features of translated text. In this paper, we provide a detailed analysis of the adverse effects of translationese on machine translation evaluation results. Our…

Computation and Language · Computer Science 2019-06-25 Yvette Graham , Barry Haddow , Philipp Koehn

We present a translation of Urysohn's description of normal spaces (as those where disjoint closed subsets are separated by a continuous function) into the language of lifting properties in $\mathbf{Top}$, correcting a frequently-cited…

General Topology · Mathematics 2026-02-13 Robert Maxton

In this article, a new construction of derived equivalences is given. It relates different endomorphism rings and more generally cohomological endomorphism rings - including higher extensions - of objects in triangulated categories. These…

Representation Theory · Mathematics 2011-02-15 Wei Hu , Steffen Koenig , Changchang Xi

In various analytical contexts, it is proved that a weak Sobolev inequality implies a doubling property for the underlying measure.

Analysis of PDEs · Mathematics 2014-06-10 Lyudmila Korobenko , Diego Maldonado , Cristian Rios

Asymmetric combination of logics is a formal process that develops the characteristic features of a specific logic on top of another one. Typical examples include the development of temporal, hybrid, and probabilistic dimensions over a…

Logic · Mathematics 2017-05-10 Renato Neves , Alexandre Madeira , Luis S. Barbosa , Manuel A. Martins

The polynomial and the adversary methods are the two main tools for proving lower bounds on query complexity of quantum algorithms. Both methods have found a large number of applications, some problems more suitable for one method, some for…

Quantum Physics · Physics 2023-01-26 Aleksandrs Belovs
‹ Prev 1 3 4 5 6 7 10 Next ›