English
Related papers

Related papers: Ordinal analysis of partial combinatory algebras

200 papers

Umbral calculus can be viewed as an abstract theory of the Heisenberg commutation relation $[\hat P,\hat M]=1$. In ordinary quantum mechanics $\hat P$ is the derivative and $\hat M$ the coordinate operator. Here we shall realize $\hat P$ as…

Mathematical Physics · Physics 2009-11-13 G. Dattoli , D. Levi , P. Winternitz

Using the theory of noncommutative symmetric functions, we introduce the higher order peak algebras, a sequence of graded Hopf algebras which contain the descent algebra and the usual peak algebra as initial cases (N = 1 and N = 2). We…

Combinatorics · Mathematics 2013-02-12 Daniel Krob , Jean-Yves Thibon

We define a new class of infinitary logics $\mathscr L^1_{\kappa,\alpha}$ generalizing Shelah's logic $\mathbb L^1_\kappa$ defined in \cite{MR2869022}. If $\kappa=\beth_\kappa$ and $\alpha <\kappa$ is infinite then our logic coincides with…

Logic · Mathematics 2024-02-22 Jouko Vaananen , Boban Velickovic

In this paper, we provide tight lower bounds for the oracle complexity of minimizing high-order H\"older smooth and uniformly convex functions. Specifically, for a function whose $p^{th}$-order derivatives are H\"older continuous with…

Optimization and Control · Mathematics 2025-06-10 Cedar Site Bai , Brian Bullins

Building on previous work of [BPS] we investigate $\sigma$-closed partial orders of size continuum. We provide both an internal and external characterization of such partial orders by showing that (1) every $\sigma$-closed partial order of…

Logic · Mathematics 2013-03-05 Bohuslav Balcar , Michal Doucha , Michael Hrušák

The class of all $\ast$-continuous Kleene algebras, whose description includes an infinitary condition on the iteration operator, plays an important role in computer science. The complexity of reasoning in such algebras - ranging from the…

Logic · Mathematics 2025-02-18 Stepan L. Kuznetsov , Tikhon Pshenitsyn , Stanislav O. Speranski

Let $T$ be a (first order complete) dependent theory, ${\mathfrak{C}}$ a $\bar\kappa$-saturated model of $T$ and $G$ a definable subgroup which is abelian. Among subgroups of bounded index which are the union of $<\bar\kappa$ type definable…

Logic · Mathematics 2021-09-15 Saharon Shelah

We study versions of Kleene algebra with dynamic tests, that is, extensions of Kleene algebra with domain and antidomain operators. We show that Kleene algebras with tests and Propositional dynamic logic correspond to special cases of the…

Logic in Computer Science · Computer Science 2023-11-14 Igor Sedlár

We give topological and algebraic characterizations as well as language theoretic descriptions of the following subclasses of first-order logic FO[<] for omega-languages: Sigma_2, FO^2, the intersection of FO^2 and Sigma_2, and Delta_2 (and…

Formal Languages and Automata Theory · Computer Science 2009-10-02 Volker Diekert , Manfred Kufleitner

In general terms, we establish algebraic relations that numbers must satisfy in order for their images to match after one or several transformations. Some groups associated with these relationships are identified, such as the Klein group.…

Number Theory · Mathematics 2021-11-02 Fernando Nuez

We study problems related to indecomposability of modules over certain local finite dimensional trivial extension algebras. We do this by purely combinatorial methods. We introduce the concepts of graph of cyclic modules, of combinatorial…

Rings and Algebras · Mathematics 2019-10-31 Juan Orendain

We define multichordal CLE$_\kappa$ for $\kappa \in (4,8)$ as the conditional law of the remainder of a partially explored CLE$_\kappa$. The strands of a multichordal CLE$_\kappa$ have a random link pattern, and their law conditionally on…

Probability · Mathematics 2025-07-22 Valeria Ambrosio , Jason Miller , Yizheng Yuan

We give a proof of I. G. Rosenberg's characterization of maximal clones. The theorem lists six types of relations on a finite set such that a clone over this set is maximal if and only if it contains just the functions preserving one of the…

Logic · Mathematics 2007-05-23 Michael Pinsker

We show relative to strong hypotheses that patterns of compact cardinals in the universe, where a compact cardinal is one which is either strongly compact or supercompact, can be virtually arbitrary. Specifically, we prove if V is a model…

Logic · Mathematics 2007-05-23 Arthur W. Apter

We investigate the cyclic proof theory of extensions of Peano Arithmetic by (finitely iterated) inductive definitions. Such theories are essential to proof theoretic analyses of certain `impredicative' theories; moreover, our cyclic systems…

Logic · Mathematics 2023-06-16 Anupam Das , Lukas Melgaard

Let $F_{\omega_1}$ be the countable admissible ordinal equivalence relation defined on ${}^\omega 2$ by $x \ F_{\omega_1} \ y$ if and only if $\omega_1^x = \omega_1^y$. It will be shown that $F_{\omega_1}$ is classifiable by countable…

Logic · Mathematics 2016-02-01 William Chan

Conformal Galilei Algebras labeled by $d,\ell$ (where $d$ is the number of space dimensions and $\ell$ denotes a spin-${\ell}$ representation w.r.t. the $\mathfrak{sl}(2)$ subalgebra) admit two types of central extensions, the ordinary one…

Mathematical Physics · Physics 2016-07-19 N. Aizawa , Z. Kuznetsova , F. Toppan

A subset of a model of ${\sf PA}$ is called neutral if it does not change the $\mathrm{dcl}$ relation. A model with undefinable neutral classes is called neutrally expandable. We study the existence and non-existence of neutral sets in…

Logic · Mathematics 2021-06-07 Athar Abdul-Quader , Roman Kossak

We provide a first-order homogenization result for quadratic functionals. In particular, we identify the scaling of the energy and the explicit form of the limiting functional in terms of the first-order correctors. The main novelty of the…

Analysis of PDEs · Mathematics 2026-02-04 Riccardo Cristoferi , Lorenza D'Elia

Given a partially ordered set $P$ there exists the most general Boolean algebra $F(P)$ which contains $P$ as a generating set, called the {\it free Boolean algebra} over $P$. We study free Boolean algebras over posets of the form $P=P_0\cup…

General Topology · Mathematics 2012-10-23 Robert Bonnet , Latifa Faouzi , Wiesław Kubiś
‹ Prev 1 8 9 10 Next ›