English
Related papers

Related papers: An isomorphism theorem for models of Weak K\"onig'…

200 papers

We introduce ordinal collapsing principles that are inspired by proof theory but have a set theoretic flavor. These principles are shown to be equivalent to iterated $\Pi^1_1$-comprehension and the existence of admissible sets, over weak…

Logic · Mathematics 2021-12-16 Anton Freund , Michael Rathjen

After a summary on module algebra actions of C^*-weak Hopf algebras we outline the proof of a reconstruction theorem stating that every finite index depth 2 inclusion N < M of unital C^*-algebras with finite dimensional centers is…

Quantum Algebra · Mathematics 2007-05-23 K. Szlachanyi

Previous work of the author [39] showed that the Homomorphism Preservation Theorem of classical model theory remains valid when its statement is restricted to finite structures. In this paper, we give a new proof of this result via a…

Computational Complexity · Computer Science 2016-12-28 Benjamin Rossman

We establish spherical variants of the Gleason-Kahane-Zelazko and Kowalski-S{\l}odkowski theorems, and we apply them to prove that every weak-2-local isometry between two uniform algebras is a linear map. Among the consequences, we solve a…

Functional Analysis · Mathematics 2017-05-11 Lei Li , Antonio M. Peralta , Liguang Wang , Ya-Shu Wang

We present and analyze a natural hierarchy of weak theories, develop analysis in them, and show that they are interpretable in bounded quantifier arithmetic $\text{I}\Delta_0$ (and hence in Robinson arithmetic Q). The strongest theories…

Logic · Mathematics 2016-12-20 Dmytro Taranovsky

We show that the axioms of Weak Kleene Algebra (WKA) are sound and complete for the theory of regular expressions modulo simulation equivalence, assuming their completeness for monodic trees (as conjectured by Takai and Furusawa).

Logic in Computer Science · Computer Science 2009-10-07 Ernie Cohen

Simpson and the second author asked whether there exists a characterization of the natural numbers by a second-order sentence which is provably categorical in the theory RCA$^*_0$. We answer in the negative, showing that for any…

Logic · Mathematics 2014-10-17 Leszek Aleksander Kołodziejczyk , Keita Yokoyama

For a locally compact Abelian group $G$ and a continuous weight function $\omega$ on $G$ we show that the Beurling algebra $L^1(G, \omega)$ is weakly amenable if and only if there is no nontrivial continuous group homomorphism $\phi$: $G\to…

Functional Analysis · Mathematics 2012-07-23 Yong Zhang

We prove preservation theorems for $\mathcal{L}_{\omega_1, G}$, the countable fragment of Vaught's closed game logic. These are direct generalizations of the theorems of \L{}o\'s-Tarski (resp. Lyndon) on sentences of $\mathcal{L}_{\omega_1,…

Logic · Mathematics 2019-12-30 Christian Espíndola

We show that on any smooth compact connected manifold of dimension $m\geq 2$ admitting a smooth non-trivial circle action $\mathcal{S} = \left\{S_t\right\}_{t \in \mathbb{R}}$, $S_{t+1}=S_t$, the set of weakly mixing…

Dynamical Systems · Mathematics 2015-12-02 Roland Gunesch , Philipp Kunde

This paper continues the investigation begun in arXiv:1906.05602 of extending the T1 theorem of David and Journ\'e, and optimal cancellation conditions, to more general weight pairs. The main additional tool developed here is a two weight…

Classical Analysis and ODEs · Mathematics 2019-10-24 Eric T. Sawyer

Canonical relativized cylindric set algebras are used to sharpen the relative representation theorem for weakly associative relation algebras, that every complete atomic weakly associative relation algebra is isomorphic with the…

Logic · Mathematics 2021-06-30 Roger D. Maddux

Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…

Logic · Mathematics 2007-05-23 Wesley Calvert

We construct a `weak' version EM^w(K) of Lack & Street's 2-category of monads in a 2-category K, by replacing their compatibility constraint of 1-cells with the units of monads by an additional condition on the 2-cells. A relation between…

Category Theory · Mathematics 2012-01-27 Gabriella Böhm

K\"onig's lemma is a fundamental result about trees with countless applications in mathematics and computer science. In contrapositive form, it states that if a tree is finitely branching and well-founded (i.e. has no infinite paths), then…

Logic in Computer Science · Computer Science 2026-02-20 Henning Urbat , Thorsten Wißmann

Let $\mathfrak M=(M,\mathcal X)$ be a model of $\mathsf{RCA}_0+\text{$\Sigma^0_2$-bounding}$ in which $\Sigma^0_2(A)$-induction fails for some $A\in\mathcal X$. We show that (i) if $\mathfrak M$ is a model of the combinatorial principle…

Logic · Mathematics 2025-10-22 Chi Tat Chong , Tin Lok Wong

In this paper, we show that $\mathrm{RT}^{2}+\mathsf{WKL}_0$ is a $\Pi^{1}_{1}$-conservative extension of $\mathrm{B}\Sigma^0_3$.

Logic · Mathematics 2018-07-06 Theodore A. Slaman , Keita Yokoyama

This paper investigates the logical strength of completeness theorems for modal propositional logic within second-order arithmetic. We demonstrate that the weak completeness theorem for modal propositional logic is provable in…

Logic · Mathematics 2025-03-04 Sho Shimomichi , Yuto Takeda , Keita Yokoyama

We prove that any proof of a $\forall \Sigma^0_2$ sentence in the theory $\mathrm{WKL}_0 + \mathrm{RT}^2_2$ can be translated into a proof in $\mathrm{RCA}_0$ at the cost of a polynomial increase in size. In fact, the proof in…

Logic · Mathematics 2021-01-19 Leszek Aleksander Kołodziejczyk , Tin Lok Wong , Keita Yokoyama

For a cardinal kappa and a model M of cardinality kappa let No(M) denote the number of non-isomorphic models of cardinality kappa which are L_{infty,kappa}--equivalent to M. In [Sh:133] Shelah established that when kappa is a weakly compact…

Logic · Mathematics 2007-05-23 Saharon Shelah , Pauli Väisänen