Related papers: Remarks On $\aleph_0$-Injectivity

We present a proof system that extends action logic by omega iteration, which is viewed as infinitary multiplicative conjunction. We prove cut admissibility and establish complexity bounds for the provability predicate.

Let A be an affine algebra over the field of real numbers of dimension d. Let f \in A be an element not belonging to any real maximal ideal of A. Let P be a projective A-module of rank \geq d-1. Let (a,p) \in A_f \oplus P_f be a unimodular…

We introduce a new application for inductive logic programming: learning the semantics of programming languages from example evaluations. In this short paper, we explored a simplified task in this domain using the Metagol meta-interpretive…

This article gives both an overview and supplements the articles [AF08] and [AF09] on the critical level category O over an affine Kac-Moody algebra. In particular, we study the restricted projective objects and review the restricted…

In this work we study how to extend a partial action of a Hopf Algebra $A$ on an algebra $R$ to a partial action of a Hopf-Ore extension of $A$ on $R$. As consequence, we characterize all partial actions of rank one Hopf algebras (in…

The paper adresses the problem of reasoning with ambiguities. Semantic representations are presented that leave scope relations between quantifiers and/or other operators unspecified. Truth conditions are provided for these representations…

The paper presents a counterexample to the Hodge conjecture.

We study, in an abstract axiomatic setting, the notion of sectional category of a morphism. From this, we unify and generalize known results about this invariant in different settings as well as we deduce new applications.

Morphological inflection is a popular task in sub-word NLP with both practical and cognitive applications. For years now, state-of-the-art systems have reported high, but also highly variable, performance across data sets and languages. We…

We begin the study of character sheaves on a not necessarily connected reductive group, extending the known theory for connected groups.

We study algorithmic randomness notions via effective versions of almost-everywhere theorems from analysis and ergodic theory. The effectivization is in terms of objects described by a computably enumerable set, such as lower semicomputable…

We give some results on a priori estimates and on estimates of type sup+inf and sup*inf.

We consider various counting questions for irreducible binomials over finite fields. We use various results from analytic number theory to investigate these questions.

Let $H$ be a weak Hopf algebra that is a finitely generated module over its affine center. We show that $H$ has finite self-injective dimension and so the Brown--Goodearl Conjecture holds in this special weak Hopf setting.

There are versions of "calculus" in many settings, with various mixtures of algebra and analysis. In these informal notes we consider a few examples that suggest a lot of interesting questions.

Expanding upon recent work, a new class of $A$-functions is introduced that can be viewed as an appropriate generalization of the class of regular $A$-functions, the class of structured $A$-functions, and the class of perfect $A$-functions.…

This article first provides an algorithm W based type inference algorithm for an affine type system. Then the article further assumes the language equipped with the above type system uses lazy evaluation, and explores the possibility of…

In this article, the theory of sheaves is studied from a categorical point of view. This perspective vastly generalizes the usual theory of sheaves of sets to a more abstract setting which allows us to investigate the theory of sheaves with…

We propose a unified approach to addition of resistors and capacitors such that the formulae are always simply additive. This approach has the advantage of being consistent with the intuition of the students. To demonstrate our point of…

We focus on the persistence principle over weak interpretability logic. Our object of study is the logic obtained by adding the persistence principle to weak interpretability logic from several perspectives. Firstly, we prove that this…