English
Related papers

Related papers: Bimodal logics with a `weakly connected' component…

200 papers

In this paper we study the strict refinement property for connected partial ordersalso known as Hashimoto's Theorem. This property implies that any isomorphismbetween products of irreducible structures is determined is uniquely determinedas…

Category Theory · Mathematics 2024-06-04 Aly-Bora Ulusoy , Emmanuel Haucourt

We analyze model-theoretic connected components in extensions of a given group by abelian groups which are defined by means of 2-cocycles with finite image. We characterize, in terms of these 2-cocycles, when the smallest type-definable…

Logic · Mathematics 2013-12-16 Jakub Gismatullin , Krzysztof Krupinski

Let $L= -\Delta+ V$ be a Schr\"odinger operator on $\mathbb R^d$, $d\geq 3$, where $V$ is a nonnegative potential, $V\ne 0$, and belongs to the reverse H\"older class $RH_{d/2}$. In this paper, we study the commutators $[b,T]$ for $T$ in a…

Classical Analysis and ODEs · Mathematics 2015-04-10 Luong Dang Ky

We prove a subconvexity bound in the conductor aspect for $L(s,f,\chi)$ where $f$ is a half integer weight modular form. This $L$-function has analytic continuation and functional equation, but no Euler product. Due to the lack of an Euler…

Number Theory · Mathematics 2015-12-22 Eren Mehmet Kiral

By slightly adapting two equivalent semantics of noncontingency operator, we obtain two variants, $\boxdot$ and $\boxplus$, with non-equivalent semantics. We show that on the class of models satisfying any of five basic properties (i.e.…

Logic · Mathematics 2019-06-10 Jie Fan

Assume $G$ is a solvable group whose elementary abelian sections are all finite. Suppose, further, that $p$ is a prime such that $G$ fails to contain any subgroups isomorphic to $C_{p^\infty}$. We show that if $G$ is nilpotent, then the…

Group Theory · Mathematics 2013-03-21 Karl Lorensen

The satisfiability problem for First-order Modal Logic (\FOML) is undecidable even for simple fragments like having only unary predicates, two variables etc. Recently a new way to identify decidable fragments of \FOML has been introduced…

Logic in Computer Science · Computer Science 2025-06-03 Varad Joshi , Anantha Padmanabha

Let $G$ be a finite group and $k$ a field of characteristic $p$. We conjecture that if $M$ is a $kG$-module with $H^*(G,M)$ finitely generated as a module over $H^*(G,k)$ then as an element of the stable module category…

Representation Theory · Mathematics 2023-05-16 David J. Benson , John Greenlees

Fractional supersymmetric quantum mechanics of order $\lambda$ is realized in terms of the generators of a generalized deformed oscillator algebra and a Z$_{\lambda}$-grading structure is imposed on the Fock space of the latter. This…

Mathematical Physics · Physics 2008-11-26 C. Quesne

The paper is devoted to modal properties of the ternary strict betweenness relation as used in the development of various systems of geometry. We show that such a relation is non-definable in a basic similarity type with a binary operator…

Logic · Mathematics 2024-10-29 Rafał Gruszczyński , Zhiguang Zhao

This paper presents a study of the finite axiomatizability of transitive logics of finite depth and finite weak width. We prove the finite axiomatizability of each transitive logic of finite depth and of weak width $1$ that is characterized…

Logic · Mathematics 2023-04-20 Yan Zhang

We consider the G\"odel bi-modal logic determined by fuzzy Kripke models where both the propositions and the accessibility relation are infinitely valued over the standard G\"odel algebra [0,1] and prove strong completeness of Fischer Servi…

Logic · Mathematics 2011-10-12 Xavier Caicedo , Ricardo Oscar Rodriguez

In this paper we consider the notion of commutation for a pair of continuous and convex Hamiltonians, given in terms of commutation of their Lax- Oleinik semigroups. This is equivalent to the solvability of an associated multi- time…

Analysis of PDEs · Mathematics 2016-02-10 Andrea Davini , Maxime Zavidovique

We prove a classification result for a large class of noncommutative Bernoulli crossed products $(P,\phi)^\Lambda \rtimes \Lambda$ without almost periodic states. Our results improve the classification results from [1], where only Bernoulli…

Operator Algebras · Mathematics 2015-09-01 Peter Verraedt

Let G be a finite group scheme over an algebraically closed field of positive characteristic. Assume further that the connected component of G is unipotent. It is shown that the projectivity of a rational G-module can be detected on a…

Representation Theory · Mathematics 2019-09-25 Christopher P. Bendel

For functors $L:\A\to \B$ and $R:\B\to \A$ between any categories $\A$ and $\B$, a {\em pairing} is defined by maps, natural in $A\in \A$ and $B\in \B$, $$\xymatrix{\Mor_\B (L(A),B) \ar@<0.5ex>[r]^{\alpha} & \Mor_\A…

Category Theory · Mathematics 2012-05-30 Robert Wisbauer

A function on a discrete group is weakly combable if its discrete derivative with respect to a combing can be calculated by a finite state automaton. A weakly combable function is bicombable if it is Lipschitz in both the left and right…

Group Theory · Mathematics 2010-09-14 Danny Calegari , Koji Fujiwara

If X is a full, finitely generated, projective module over a non-commutative torus, the Yang-Mills functional attains its minimum exactly on the flat connections on X. We classify the flat connections on modules admitting integrable…

Operator Algebras · Mathematics 2007-12-11 Ryszard Nest , Rolf Dyre Svegstrup

We prove that many of the results of the LMMP hold for $3$-folds over fields of characteristic $p>5$ which are not necessarily perfect. In particular, the existence of flips, the cone theorem, the contraction theorem for birational extremal…

Algebraic Geometry · Mathematics 2022-08-22 Omprokash Das , Joe Waldron

Once one has enriched LFG's formal machinery with the linear logic mechanisms needed for semantic interpretation as proposed by Dalrymple et. al., it is natural to ask whether these make any existing components of LFG redundant. As…

cmp-lg · Computer Science 2007-05-23 Mark Johnson