中文
相关论文

相关论文: Axiomatizations of Presburger Arithmetic With Pred…

200 篇论文

We introduce a recursive theory that completely axiomatizes the structure $\langle \mathbb{Z},<, +,f,0\rangle$ where $f$ is the function that maps each $x$ to the integer part of $\varphi x $, with $\varphi$ the golden ratio. We prove that…

逻辑 · 数学 2025-09-18 Mohsen Khani , Ali N. Valizadeh , Afshin Zarei

We prove that the hierarchy of higher antibrackets (aka higher Koszul brackets, aka Koszul braces) of a linear operator $\Delta$ on a commutative superalgebra can be defined by some universal formulas involving iterated Nijenhuis-Richardson…

量子代数 · 数学 2016-06-07 Marco Manetti , Giulia Ricciardi

We provide a characterization of those relation algebras which are isomorphic to the algebras of compatible relations of some $\Z_2$-set. We further prove that this class is finitely axiomatizable in first-order logic in the language of…

逻辑 · 数学 2025-04-01 Jeremy F. Alm , John W. Snow

For a finite set $A\subset \mathbb{R}$ and real $\lambda$, let $A+\lambda A:=\{a+\lambda b :\, a,b\in A\}$. Combining a structural theorem of Freiman on sets with small doubling constants together with a discrete analogue of…

组合数学 · 数学 2023-06-07 Dmitry Krachun , Fedor Petrov

We consider the fragment F of first order arithmetic in which quantification is restricted to ''for all but finitely many.'' We show that the integers form an F-elementary substructure of the real numbers. Consequently, the F-theory of…

逻辑 · 数学 2007-05-23 David Marker , Theodore A. Slaman

We discuss the theory of Lie algebras in Lean's Mathlib library. Using nilpotency as the theme, we outline a computer formalisation of Engel's theorem and an application to root space theory. We emphasise that all arguments work with…

计算机科学中的逻辑 · 计算机科学 2023-04-21 Oliver Nash

We study the properties of the constructible universe, L, over intuitionistic theories. We give an extended set of fundamental operations which is sufficient to generate the universe over Intuitionistic Kripke-Platek set theory without…

逻辑 · 数学 2023-09-27 Richard Matthews , Michael Rathjen

We introduce two-sorted theories in the style of [CN10] for the complexity classes \oplusL and DET, whose complete problems include determinants over Z2 and Z, respectively. We then describe interpretations of Soltys' linear algebra theory…

计算机科学中的逻辑 · 计算机科学 2015-07-01 Stephen A Cook , Lila A Fontes

Let $S=\langle d_1,\dots,d_m\rangle$ be a numerical semigroup and $k[S]$ its semigroup ring. The Hilbert numerator of $k[S]$ determines normalized alternating syzygy power sums $K_p(S)$ encoding alternating power sums of syzygy degrees. Fel…

The construction of a generic representation of $g\ell(n+1)$ or of the trigonomentric deformation of its enveloping algebra known as algebraic induction is conveniently formulated in term of Lax matrices. The Lax matrix of the constructed…

高能物理 - 理论 · 物理学 2008-11-26 S. Derkachov , D. Karakhanyan , R. Kirschner , P. Valinevich

We study ideal lattices constructed from totally definite quaternion algebras over totally real number fields, and generalize the definition of Arakelov-modular lattices over number fields. In particular, we prove for the case where the…

环与代数 · 数学 2017-03-06 Xiaolu Hou

We construct a realizability model of linear dependent type theory from a linear combinatory algebra. Our model motivates a number of additions to the type theory. In particular, we add a universe with two decoding operations: one takes…

计算机科学中的逻辑 · 计算机科学 2026-02-10 Sam Speight , Niels van der Weide

For a numerical semigroup $S := \langle n_1, \dots, n_k \rangle$ with minimal generators $n_1 < \cdots < n_k$, Barron, O'Neill, and Pelayo showed that $L(s+n_1) = L(s) + 1$ and $\ell(s+n_k) = \ell(s) + 1$ for all sufficiently large $s \in…

交换代数 · 数学 2023-08-23 Baian Liu

Let $H$ be a multiplicatively written monoid. Given $k\in{\bf N}^+$, we denote by $\mathscr U_k$ the set of all $\ell\in{\bf N}^+$ such that $a_1\cdots a_k=b_1\cdots b_\ell$ for some atoms $a_1,\ldots,a_k,b_1,\ldots,b_\ell\in H$. The sets…

数论 · 数学 2019-12-13 Salvatore Tringali

Suppose $N$ is elementarily equivalent to an archimedean ordered abelian group $(G,+,<)$ with small quotients (for all $1 \leq n < \omega$, $[G: nG]$ is finite). Then every stable reduct of $N$ which expands $(G,+)$ (equivalently every…

逻辑 · 数学 2025-04-22 Eran Alouf , Antongiulio Fornasiero , Itay Kaplan

We show pro-definability of spaces of definable types in various classical complete first order theories, including complete o-minimal theories, Presburger arithmetic, $p$-adically closed fields, real closed and algebraically closed valued…

逻辑 · 数学 2022-08-09 Pablo Cubides Kovacsics , Jinhe Ye

Most non-classical logics are subclassical, that is, every inference/theorem they validate is also valid classically. A notable exception is the three-valued propositional Logic of Ordinary Discourse (OL) proposed and extensively motivated…

逻辑 · 数学 2024-05-07 Vitor Greati , Sérgio Marcelino , Umberto Rivieccio

We develop a structure theory for transposed Poisson algebras over fields of characteristic different from two. In particular, we prove that every finite-dimensional transposed Poisson algebra over an algebraically closed field decomposes…

环与代数 · 数学 2026-04-30 Amir Fernández Ouaridi

In the present paper, we consider Presburger arithmetic PrA and the theory of real closed fields RCF. Due to quantifier elimination in these theories, there are two kinds of natural ways to axiomatize them. Namely, on one hand, PrA can be…

逻辑 · 数学 2026-03-03 Fedor Pakhomov , Julien Daoud

In this paper, we study arithmetic properties satisfied by the $k$-tuple $\ell$-regular partitions. A $k$-tuple of partitions $(\xi_1, \xi_2, \ldots, \xi_k)$ is said to be $\ell$-regular if all the $\xi_i$'s are $\ell$-regular. We study the…

数论 · 数学 2025-05-13 Hemjyoti Nath , Manjil P. Saikia , Abhishek Sarma