相关论文: On Various Negative Translations

In this paper we show that, in the definition of Alexandrov spaces with lower or upper curvature bound, the original conditions can be replaced with much weaker ones. For the purpose, we introduce `imaginary' comparison angles (and…

In analogy of classical Kolmogorov complexity we develop a theory of the algorithmic information in bits contained in any one of continuously many pure quantum states: quantum Kolmogorov complexity. Classical Kolmogorov complexity coincides…

Monads can be interpreted as encoding formal expressions, or formal operations in the sense of universal algebra. We give a construction which formalizes the idea of "evaluating an expression partially": for example, "2+3" can be obtained…

The study of cosmological correlators, and more generally Feynman integrals, is greatly aided by considering them as solutions to differential equations. Often, such systems of differential equations are reducible, which, broadly speaking,…

Non-wellfounded proof theory results from allowing proofs of infinite height in proof theory. To guarantee that there is no vicious infinite reasoning, it is usual to add a constraint to the possible infinite paths appearing in a proof.…

Given standard angular momentum and boost matrices, the commutation rules for vector and momentum matrices are solved. The resulting matrix components are displayed as detailed functions of spin with factors such as the square root of…

Randomness extraction is the process of constructing a source of randomness of high quality from one or several sources of randomness of lower quality. The problem can be modeled using probability distributions and min-entropy to measure…

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…

Unexpectedness is a central concept in Simplicity Theory, a theory of cognition relating various inferential processes to the computation of Kolmogorov complexities, rather than probabilities. Its predictive power has been confirmed by…

We present constructive versions of Krull's dimension theory for commutative rings and distributive lattices. The foundations of these constructive versions are due to Joyal, Espan\~ol and the authors. We show that this gives a constructive…

In this paper, we present a propositional logic (called mixed logic) containing disjoint copies of minimal, intuitionistic and classical logics. We prove a completeness theorem for this logic with respect to a Kripke semantics. We establish…

We study tree kinds of quantum fidelity. Usual Uhlmann's fidelity, minus of f-divergence when $f(x)=-\sqrt{x}$, and the one introduced by the author via reverse test. All of them are quantum extensions of classical fidelity, where the first…

The (prefix-free) Kolmogorov complexity of a finite binary string is the length of the shortest description of the string. This gives rise to some `standard' lowness notions for reals: A is K-trivial if its initial segments have the lowest…

Let $\Lambda$ be a radical square zero Nakayama algebra with $n$ simple modules and let $\Gamma$ be the Auslander algebra of $\Lambda$. Then every indecomposable direct summand of a tilting $\Gamma$-module is either simple or projective.…

Many combinatorial proofs rely on induction. When these proofs are formulated in traditional language, they can be bulky and unmanageable. Coalgebras provide a language which can reduce reduce many inductive proofs in graded poset theory to…

In Aristotelian logic, categorical propositions are divided in Universal Affirmative, Universal Negative, Particular Affirmative and Particular Negative. Possible relations between two of the mentioned type of propositions are encoded in…

We compute projective dimension of translated simple modules in the regular block of the BGG category $\mathcal{O}$ in terms of Kazhdan-Lusztig combinatorics. This allows us to determine which projectives can appear at the last step of a…

A class of models is presented, in the form of continuation monads polymorphic for first-order individuals, that is sound and complete for minimal intuitionistic predicate logic. The proofs of soundness and completeness are constructive and…

Neural metrics for machine translation evaluation, such as COMET, exhibit significant improvements in their correlation with human judgments, as compared to traditional metrics based on lexical overlap, such as BLEU. Yet, neural metrics…

This article presents a geometric approach to some similarity problems involving metric arguments in the non-positively curved space of positive invertible operators of an operator algebra and the canonical isometric action by invertible…