Related papers: Affine logic with the integration operator

Lindstr\"om's Theorem characterizes first order logic as the maximal logic satisfying the Compactness Theorem and the Downward L\"owenheim-Skolem Theorem. If we do not assume that logics are closed under negation, there is an obvious…

A compactness theorem is proved for a family of K\"{a}hler surfaces with constant scalar curvature and volume bounded from below, diameter bounded from above, Ricci curvature bounded and the signature bounded from below. Furthermore, a…

We study a global theory of affine maximal surfaces with singularities, which are called affine maximal maps and defined by Aledo--Mart\' inez--Mil\' an. In this paper, we define a special subclass of such surfaces other than improper…

This article presents simple and easy proofs of the Implicit Function Theorem and the Inverse Function Theorem, in this order, both of them on a finite-dimensional Euclidean space, that employ only the Intermediate Value Theorem and the…

We define a higher level version of the affine Hecke algebra and prove that, after completion, this algebra is isomorphic to a completion of Webster's tensor product algebra of type A. We then introduce a higher level version of the affine…

The idea of generating integrals analogous to generating functions is first introduced in this paper. A new proof of the well-known Finite Harmonic Series Theorem in Analysis and Analytical Number Theory is then obtained by the method of…

Let $\mathfrak g$ be an affine Lie algebra with index set $I = \{0, 1, 2, \cdots , n\}$ and ${\mathfrak g}^L$ be its Langlands dual. It is conjectured by Kashiwara et al.([16]) that for each $k \in I \setminus \{0\}$ the affine Lie algebra…

A functor of sets $\mathbb X$ over the category of $K$-commutative algebras is said to be an affine functor if its functor of functions, $\mathbb A_{\mathbb X}$, is reflexive and $\mathbb X=\Spec \mathbb A_{\mathbb X}$. We prove that affine…

For substructural logics with contraction or weakening admitting cut-free sequent calculi, proof search was analyzed using well-quasi-orders on $\mathbb{N}^d$ (Dickson's lemma), yielding Ackermannian upper bounds via controlled bad-sequence…

An introduction is given to the logic of sheaves of structures and to set theoretic forcing constructions based on this logic. Using these tools, it is presented an alternative proof of the independence of the Continuum Hypothesis; which…

In previous work "Betweenness algebras" we introduced and examined the class of betweenness algebras. In the current paper we study a larger class of algebras with binary operators of possibility and sufficiency, the weak mixed algebras.…

Based on the work of Shelah, Kellner, and T\u{a}nasie (Fund. Math., 166(1-2):109-136, 2000 and Comment. Math. Univ. Carolin., 60(1):61-95, 2019), and the recent developments in the third author's master's thesis, we develop a general theory…

We develop a family of simple rank one theories built over quite arbitrary sequences of finite hypergraphs. (This extends an idea from the recent proof that Keisler's order has continuum many classes, however, the construction does not…

This article deals with the lower compactness property of a sequence of integrands and the use of this key notion in various domains: convergence theory, optimal control, non-smooth analysis. First about the interchange of the weak…

We continue the investigation started in [Sh:1215] about the relation between the Keilser-Shelah isomorphism theorem and the continuum hypothesis. In particular, we show it is consistent that the continuum hypothesis fails and for any given…

We present a systematic study of join-extensions and join-completions of ordered algebras, which naturally leads to a refined and simplified treatment of fundamental results and constructions in the theory of ordered structures ranging from…

Well-founded fixed points have been used in several areas of knowledge representation and reasoning and to give semantics to logic programs involving negation. They are an important ingredient of approximation fixed point theory. We study…

We classify affine varieties with an action of a connected, reductive algebraic group such that the group is isomorphic to an open orbit in the variety. This is accomplished by associating a set of one-parameter subgroups of the group to…

We define and study logics in the framework of probabilistic team semantics and over metafinite structures. Our work is paralleled by the recent development of novel axiomatizable and tractable logics in team semantics that are closed under…

It is known that the Frank-Wolfe (FW) algorithm, which is affine-covariant, enjoys accelerated convergence rates when the constraint set is strongly convex. However, these results rely on norm-dependent assumptions, usually incurring…