English
Related papers

Related papers: A first-order completeness result about characteri…

200 papers

The aim of this work is to determine the quasi-filiform Lie algebras that are completable. We further prove that for any positive integer $m$ there exists a complete Lie algebra, the second cohomology group of which has dimension greater or…

Rings and Algebras · Mathematics 2009-01-20 L. Garcia-Vergnolle

In this article, we investigate the arithmetical hierarchy from the perspective of realizability theory. An experimental observation in classical computability theory is that the notion of degrees of unsolvability for natural arithmetical…

Logic · Mathematics 2024-10-22 Takayuki Kihara

The paper investigates behavioural equivalence between programs in a call-by-value functional language extended with a signature of (algebraic) effect-triggering operations. Two programs are considered as being behaviourally equivalent if…

Logic in Computer Science · Computer Science 2019-10-28 Alex Simpson , Niels Voorneveld

The paper is devoted to the so-called complete Leibniz algebras. It is known that a Lie algebra with a complete ideal is split. We will prove that this result is valid for Leibniz algebras whose complete ideal is a solvable algebra such…

Rings and Algebras · Mathematics 2022-04-01 K. K. Abdurasulov , Z. Kh. Shermatova

We study a well-known technique of using absoluteness for giving choice-free proofs to some statements which are known to be provable with the axiom of choice. The idea is to reduce the problem to an inner model where the axiom of choice…

Logic · Mathematics 2014-02-20 Asaf Karagila

Based on an analysis of the inference rules used, we provide a characterization of the situations in which classical provability entails intuitionistic provability. We then examine the relationship of these derivability notions to uniform…

Logic in Computer Science · Computer Science 2016-08-31 Gopalan Nadathur

This work deals with the definability problem by quantifier-free first-order formulas over a finite algebraic structure. We show the problem to be coNP-complete and present two decision algorithms based on a semantical characterization of…

Logic in Computer Science · Computer Science 2023-03-31 Miguel Campercholi , Mauricio Tellechea , Pablo Ventura

Provability logics are modal or polymodal systems designed for modeling the behavior of G\"odel's provability predicate in arithmetical theories and its natural extensions. If \Lambda is any ordinal, the G\"odel-L\"ob calculus GLP(\Lambda)…

Logic · Mathematics 2013-07-05 David Fernández-Duque

Draisma recently proved that polynomial representations of $\mathbf{GL}_{\infty}$ are topologically noetherian. We generalize this result to algebraic representations of infinite rank classical groups.

Commutative Algebra · Mathematics 2017-08-23 Rob H. Eggermont , Andrew Snowden

In this article, we show that the algebraic degree in semidefinite programming can be expressed in terms of the coefficient of a certain monomial in a doubly symmetric polynomial. This characterization of the algebraic degree allows us to…

Algebraic Geometry · Mathematics 2023-09-04 Dang Tuan Hiep , Nguyen Thi Ngoc Giao , Nguyen Thi Mai Van

We prove that every clone of operations on a finite set A, if it contains a Malcev operation, is finitely related -- i.e., identical with the clone of all operations respecting R for some finitary relation R over A. It follows that for a…

Rings and Algebras · Mathematics 2011-05-31 Erhard Aichinger , Peter Mayr , Ralph McKenzie

How many endomorphisms does a Boolean algebra have? Can we find Boolean algebras with as few endomorphisms as possible? Of course from any ultrafilter of the Boolean algebra we can define an endomorphism, and we can combine finitely many…

Logic · Mathematics 2011-05-20 Saharon Shelah

We classify, up to isomorphism and up to equivalence, division gradings (by abelian groups) on finite-dimensional simple real algebras. Gradings on finite-dimensional simple algebras are determined by division gradings, so our results give…

Rings and Algebras · Mathematics 2015-12-23 Adrián Rodrigo-Escudero

The complete integrability of a class of dynamical systems with the potential v(q)=q^{-2}+c q^2 is proved.

Mathematical Physics · Physics 2007-05-23 A. M. Perelomov

Given a complete atomic Boolean algebra, we show there is a commutative BCK-algebra whose ideal lattice is that Boolean algebra. This result is shown to exist within a larger framework involving BCK-algebras of functions, whose ideals and…

Rings and Algebras · Mathematics 2024-07-03 C. Matthew Evans

This paper explores epistemic realizability, a form of realizability in which the property that a piece of data constitutes evidence for a logical proposition is semi-decidable. In this framework, each proposition A is assigned a verifier}…

Logic in Computer Science · Computer Science 2026-05-18 Pablo Barenbaum

We give two characterizations of tracially nuclear C*-algebras. The first is that the finite summand of the second dual is hyperfinite. The second is in terms of a variant of the weak* uniqueness property. The necessary condition holds for…

Operator Algebras · Mathematics 2018-10-15 Don Hadwin , Weihua Li , Wenjing Liu , Junhao Shen

A Boolean algebra carries a strictly positive exhaustive submeasure if and only if it has a sequential topology that is uniformly Frechet.

Logic · Mathematics 2017-05-03 Thomas Jech

We give a canonical construction of a balanced big Cohen-Macaulay algebra for a domain of finite type over $\mathbb C$ by taking ultraproducts of absolute integral closures in positive characteristic. This yields a new tight closure…

Commutative Algebra · Mathematics 2007-05-23 Hans Schoutens

In this note, we will prove that a finite dimensional Lie algebra $L$ of characteristic zero, admitting an abelian algebra of derivations $D\leq Der(L)$ with the property $$ L^n\subseteq \sum_{d\in D}d(L) $$ for some $n\geq 1$, is…

Representation Theory · Mathematics 2010-11-09 Mohammad Shahryari