相关论文: Complete Reducibility of t-Motives

This paper has been withdrawn by the author due to an error in the proof of Theorem 6.

This paper has been withdrawn due to a critical error discovered in Theorem 4.21. Anyone with a historical or pragamatic interest in prior "negative results", however - e.g., failed proof attempts relating to the (in)consistency of ZF or…

This paper consists of three interconnected parts. Parts I,III study the relationship between the cohomology of a reductive group and that of a Levi subgroup. For example, we provide a necessary condition, arising from Kazhdan-Lusztig…

(Maher 2012) introduced an approach for relative expressiveness of defeasible logics, and two notions of relative expressiveness were investigated. Using the first of these definitions of relative expressiveness, we show that all the…

Compared with only pursuing recommendation accuracy, the explainability of a recommendation model has drawn more attention in recent years. Many graph-based recommendations resort to informative paths with the attention mechanism for the…

The use of exponentials in linear logic greatly enhances its expressive power. In this paper we focus on nonassociative noncommutative multiplicative linear logic, and systematically explore modal axioms K, T, and 4 as well as the…

The aim of this note is to show that many papers on various kinds of filters (and related concepts) in (subreducts of) residuated structures are in fact easy consequences of more general results that have been known for a long time.

Arveson's extension theorem guarantees that every completely positive map defined on an operator system can be extended to a completely positive map defined on the whole C*-algebra containing it. An analogous statement where complete…

It has been argued that reduction procedures are closely connected to the question about identity of proofs and that accepting certain reductions would lead to a trivialization of identity of proofs in the sense that every derivation of the…

In this paper we prove that a pure, regular, totally odd, polarizable weakly compatible system of $l$-adic representations is potentially automorphic. The innovation is that we make no irreducibility assumption, but we make a purity…

An argument is given to associate integrable nonintegrable transition of discrete maps with the transition of Lawvere's fixed point theorem to its own contrapositive. We show that the classical description of nonlinear maps is neither…

We show that finite Milnor-Witt correspondences satisfy a cancellation theorem with respect to the pointed multiplicative group scheme. This has several notable applications in the theory of Milnor-Witt motives and Milnor-Witt motivic…

The cut-elimination procedure for the provability logic is known to be problematic: a L\"ob-like rule keeps cut-formulae intact on reduction, even in the principal case, thereby complicating the proof of termination. In this paper, we…

This paper deals with the problem of finding the preferred extensions of an argumentation framework by means of a bijection with the naive sets of another framework. First, we consider the case where an argumentation framework is…

We show that the module of rational points on an abelian t-module E is canonically isomorphic with the module Ext^1(M_E, K[t]) of extensions of the trivial t-motif K[t] by the t-motif M_E associated with E. This generalizes prior results of…

We describe a natural generalization of irreducibility in order lattices with arbitrary metrics. We analyse the special cases of valuation metrics and more general metrics for lattices. This article is mainly based on a part of the author's…

In this paper natural necessary and sufficient conditions for quantifier elimination of matrix rings $M_n(K)$ in the language of rings expanded by two unary functions, naming the trace and transposition, are identified. This is used…

This paper has been withdrawn by the author. The statement of the Main Theorem but is wrong in general, there have been provided counterexamples. The main theorem only holds conditionally, under the finiteness statement of theorem 2.8.

In the realm of light logics deriving from linear logic, a number of variants of exponential rules have been investigated. The profusion of such proof systems induces the need for cut-elimination theorems for each logic, the proof of which…

By Solovay's celebrated completeness result on formal provability we know that the provability logic $\mathrm GL$ describes exactly all provable structural properties for any sound and strong enough arithmetical theory with a decidable…