English
Related papers

Related papers: Definable Hamel bases and $AC_\omega(R)$

200 papers

We use a generalization of a construction by Ziegler to show that for any field $F$ and any countable collection of countable subsets $A_i \subseteq F, i \in \calI \subset \Z_{>0}$ there exist infinitely many fields $K$ of arbitrary…

Logic · Mathematics 2011-05-16 Alexandra Shlapentokh , Carlos Videla

In generic realizability for set theories, realizers treat unbounded quantifiers generically. To this form of realizability, we add another layer of extensionality by requiring that realizers ought to act extensionally on realizers, giving…

Logic · Mathematics 2020-12-22 Emanuele Frittaion , Michael Rathjen

A Hom-Lie algebra $(L, \alpha_L)$ is said to be capable if there exists a Hom-Lie algebra $(H, \alpha_H)$ such that $L \cong H/Z(H)$. We obtain a characterisation of capable Hom-Lie algebras involving its epicentre and we use this theory to…

Rings and Algebras · Mathematics 2021-04-27 José Manuel Casas , Xabier García-Martínez

An incomplete Riemann zeta function can be expressed as a lower-bounded, improper Riemann-Liouville fractional integral, which, when evaluated at $0$, is equivalent to the complete Riemann zeta function. Solutions to Landau's problem with…

Number Theory · Mathematics 2024-10-03 Sarah M. Crider , Shawn Hillstrom

Assuming the existence of a Mahlo cardinal, we construct a model in which there exists an $\omega_2$-Aronszajn tree, the $\omega_1$-approachability property fails, and every stationary subset of $\omega_2 \cap \mathrm{cof}(\omega)$…

Logic · Mathematics 2019-07-23 Thomas Gilton , John Krueger

A special final coalgebra theorem, in the style of Aczel's, is proved within standard Zermelo-Fraenkel set theory. Aczel's Anti-Foundation Axiom is replaced by a variant definition of function that admits non-well-founded constructions.…

Logic in Computer Science · Computer Science 2016-08-31 Lawrence C. Paulson

Definitions of fractional derivative of order $\alpha$ ($0 < \alpha \leq 1$) using non-singular kernels have been recently proposed. In this note we show that these definitions cannot be useful in modelling problems with a initial value…

Classical Analysis and ODEs · Mathematics 2020-01-30 Edmundo Capelas de Oliveira , Stefania Jarosz , Jayme Vaz

Let R be a commutative ring. A not necessarily commutative R-algebra A is called futile if it has only finitely many R-subalgebras. In this article we relate the notion of futility to familiar properties of rings and modules. We do this by…

Rings and Algebras · Mathematics 2015-01-13 Michiel Kosters

Chiral orbifold models are defined as gauge field theories with a finite gauge group $\Gamma$. We start with a conformal current algebra A associated with a connected compact Lie group G and a negative definite integral invariant bilinear…

High Energy Physics - Theory · Physics 2014-11-18 Victor G. Kac , Ivan T. Todorov

This paper develops an abstract framework for constructing ``seminormal forms'' for cellular algebras. That is, given a cellular R-algebra A which is equipped with a family of JM-elements we give a general technique for constructing…

Representation Theory · Mathematics 2009-03-10 Andrew Mathas , Marcos Soriano

Using $\mathbb{Z}_3$ symmetry, we present a topological condition for the existence of the $\mathbb{Z}_2$ harmonic 1-forms over Riemannian manifold. As a corollary, if $L$ is an oriented link on $S^3$ with determinant zero, then there…

Differential Geometry · Mathematics 2022-02-25 Siqi He

We show that satisfiability for CTL* with equality-, order-, and modulo-constraints over Z is decidable. Previously, decidability was only known for certain fragments of CTL*, e.g., the existential and positive fragments and EF.

Logic in Computer Science · Computer Science 2013-06-05 Claudia Carapelle , Alexander Kartzow , Markus Lohrey

Given any collection F of computable functions over the reals, we show that there exists an algorithm that, given any L_F-sentence \varphi containing only bounded quantifiers, and any positive rational number \delta, decides either "\varphi…

Logic in Computer Science · Computer Science 2012-05-01 Sicun Gao , Jeremy Avigad , Edmund Clarke

For a given $\delta$, $0<\delta<1$, a Blaschke sequence $\sigma=\{\lambda_j\}$ is constructed such that every function $f$, $f\in H^\infty$, having $\delta<\delta_f=\inf_{\lambda\in\sigma}|f(\lambda)|\le\|f\|_\infty\le1$ is invertible in…

Functional Analysis · Mathematics 2010-11-01 Nikolai Nikolski , Vasily Vasyunin

This article reviews some recent progress in our understanding of the structure of Rational Conformal Field Theories, based on ideas that originate for a large part in the work of A. Ocneanu. The consistency conditions that generalize…

High Energy Physics - Theory · Physics 2007-05-23 Valentina Petkova , Jean-Bernard Zuber

For a cardinal lambda<lambda_{omega_1} we give a ccc forcing notion P which forces that for some Borel subset B of the Cantor space (1) there a sequence (eta_alpha:alpha<lambda) of distinct elements such that |(eta_alpha+B) cap…

Logic · Mathematics 2018-06-19 Andrzej Roslanowski , Saharon Shelah

Let K be a field of characteristic 0 and A be a rigid tensor K-linear category. Let M be a finite-dimensional object of A in the sense of Kimura-O'Sullivan. We prove that the "motivic" zeta function of M with coefficients in K\_0(A) has a…

Algebraic Geometry · Mathematics 2010-09-13 Bruno Kahn

A computable structure $\mathcal{A}$ is decidable if, given a formula $\varphi(\bar{x})$ of elementary first-order logic, and a tuple $\bar{a} \in \mathcal{A}$, we have a decision procedure to decide whether $\varphi$ holds of $\bar{a}$. We…

Logic · Mathematics 2017-02-23 Matthew Harrison-Trainor

It is well known that the graph of a total $\mathbf{\Sigma}^1_n$-function is $\mathbf{\Pi}^1_n$. We prove the consistency of the dual assertion at the third projective level: there is a model of $\ZFC$ in which the graph of every total…

Logic · Mathematics 2026-05-21 Stefan Hoffelner

We show that it is equiconsistent with $\mathsf{ZF}$ that Fodor's lemma fails everywhere, and furthermore that the club filter on every regular cardinal is not even $\sigma$-complete. Moreover, these failures can be controlled in a very…

Logic · Mathematics 2018-05-15 Asaf Karagila