English
Related papers

Related papers: Some properties of B\"uchi Arithmetics

200 papers

The univalence axiom expresses the principle of extensionality for dependent type theory. However, if we simply add the univalence axiom to type theory, then we lose the property of canonicity - that every closed term computes to a…

Logic in Computer Science · Computer Science 2017-03-14 Robin Adams , Marc Bezem , Thierry Coquand

Let $d \ge 2, h \ge 1$ be integers. Using a fragmentation technique, we characterise $(h+1)$-tuples $(R_1, \dots, R_h, R)$ of non-empty families of partitions of $\{1, \dots, d\}$ such that it suffices for an order-$d$ tensor to have…

Combinatorics · Mathematics 2023-10-18 Thomas Karam

An important consequence of the Hahn-Banach Theorem says that on any locally convex Hausdorff topological space $X$, there are sufficiently many continuous linear functionals to separate points of $X$. In the paper, we establish a `local'…

Functional Analysis · Mathematics 2018-09-07 Niushan Gao , Denny H. Leung , Foivos Xanthos

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…

Logic · Mathematics 2026-03-03 Fedor Pakhomov , Julien Daoud

We continue the investigation of Boolean-like algebras of dimension n (nBA) having n constants e1,...,en, and an (n+1)-ary operation q (a "generalised if-then-else") that induces a decomposition of the algebra into n factors through the…

Logic in Computer Science · Computer Science 2022-10-26 Antonio Bucciarelli , Antonio Ledda , Francesco Paoli , Antonino Salibra

The 2-adic valuation of an integer n which is the exponent of the highest power of 2 that divides n. In this paper, we give representations of certain restricted partition functions in terms of 2-adic valuation.

Number Theory · Mathematics 2024-10-29 Sabi Biswas , Nipen Saikia

A topological space $X$ is called resolvable if it contains a dense subset with dense complement. Using only basic principles, we show that whenever the space $X$ has a resolving subset that can be written as an at most countably infinite…

Functional Analysis · Mathematics 2022-08-24 Marcel de Jeu , Jan Harm van der Walt

We examine the noncommutative minimal model program for orders on arithmetic surfaces, or equivalently, arithmetic surfaces enriched by a Brauer class $\beta$. When $\beta$ has prime index $p>5$, we show the classical theory extends with…

Algebraic Geometry · Mathematics 2021-08-09 Daniel Chan , Colin Ingalls

For any real division algebra A of finite dimension greater than one, the signs of the determinants of left multiplication and right multiplication by a non-zero element are shown to form an invariant of A, called its double sign. The…

Rings and Algebras · Mathematics 2011-10-13 Erik Darpö , Ernst Dieterich

The symbolic representation of a number should be considered as a data structure, and the choice of data structure depends on the arithmetic operations that are to be performed. Numbers are almost universally represented using position…

Computational Complexity · Computer Science 2011-04-18 Ross D. King

Bar Codes are combinatorial objects encoding many properties of monomial ideals. In this paper we employ these objects to study Janet-like divisions. Given a finite set of terms U, from its Bar Code we can compute the Janet-like…

Combinatorics · Mathematics 2019-10-09 Michela Ceria

For a fixed integer base $b\geq2$, we consider the number of compositions of $1$ into a given number of powers of $b$ and, related, the maximum number of representations a positive integer can have as an ordered sum of powers of $b$. We…

Number Theory · Mathematics 2015-11-10 Daniel Krenn , Stephan Wagner

The Feferman-Vaught theorem provides a way of evaluating a first order sentence $\varphi$ on a disjoint union of structures by producing a decomposition of $\varphi$ into sentences which can be evaluated on the individual structures and the…

Logic in Computer Science · Computer Science 2022-01-03 Abhisekh Sankaran

We prove that linear extensions of the Bruhat order of a matroid are shelling orders and that the barycentric subdivision of a matroid is a Coxeter matroid, viewing barycentric subdivisions as subsets of a parabolic quotient of a symmetric…

Combinatorics · Mathematics 2023-06-13 Davide Bolognini , Paolo Sentinelli

We present a labelled sequent calculus for Boolean BI, a classical variant of O'Hearn and Pym's logic of Bunched Implication. The calculus is simple, sound, complete, and enjoys cut-elimination. We show that all the structural rules in our…

Logic in Computer Science · Computer Science 2015-05-05 Zhe Hou , Alwen Tiu , Rajeev Gore

We study algebraic algorithms for expressing the number of non-negative integer solutions to a unimodular system of linear equations as a function of the right hand side. Our methods include Todd classes of toric varieties via Gr\"obner…

Combinatorics · Mathematics 2007-05-23 Jesus A. De Loera , Bernd Sturmfels

B\"uchi's theorem states that $\omega$-regular languages are characterized as languages of the form $\bigcup_i U_i V_i^\omega$, where $U_i$ and $V_i$ are regular languages. Parikh automata are automata on finite words whose transitions are…

Formal Languages and Automata Theory · Computer Science 2023-02-09 Mario Grobler , Sebastian Siebertz

A net $(x_\alpha)$ in a vector lattice $X$ is said to be {unbounded order convergent} (or uo-convergent, for short) to $x\in X$ if the net $(\abs{x_\alpha-x}\wedge y)$ converges to 0 in order for all $y\in X_+$. In this paper, we study…

Functional Analysis · Mathematics 2017-04-24 Niushan Gao

Given a suitably nested family $Z = \langle Z(m,k,\gamma) \rangle_{m,k \in \mathbb N, \gamma >0}$ of Borel subsets of matrices, and associated Borel measures and rate function, $\mu$, an entropy, $\chi^{\mu}(Z)$, is introduced which…

Operator Algebras · Mathematics 2016-09-20 Kenley Jung

We show that the decidability of the first-order theory of the language that combines Boolean algebras of sets of uninterpreted elements with Presburger arithmetic operations. We thereby disprove a recent conjecture that this theory is…

Logic in Computer Science · Computer Science 2007-05-23 Viktor Kuncak , Martin Rinard
‹ Prev 1 8 9 10 Next ›