Related papers: On Non-Standard Models of B\"uchi Arithmetics

Let $B_n$ be the Euclidean unit ball in ${\mathbb R}^n$ given by the inequality $\|x\|\leq 1$, $\|x\|:=\left(\sum\limits_{i=1}^n x_i^2\right)^{\frac{1}{2}}$. By $C(B_n)$ we mean the space of continuous functions $f:B_n\to{\mathbb R}$ with…

An expression is any mathematical formula that contains certain formal variables and operations to be executed in a specified order. In computer science, it is usually convenient to represent each expression in the form of an expression…

Tennenbaum's theorem states that the only countable model of Peano arithmetic (PA) with computable arithmetical operations is the standard model of natural numbers. In this paper, we use constructive type theory as a framework to revisit,…

In 1960s, Dana Scott gave a recursion theoretic characterization of standard systems of countable non-standard models of arithmetic, i.e., collections of sets of standard natural numbers coded in non-standard models. Later, Knight and Nadel…

Let $\mathcal{A}$ and $\mathcal{U}$ be Banach algebras and $\theta$ be a nonzero character on $\mathcal{A}$. Then the \textit{Lau product Banach algebra} $\mathcal{A}\times_{\theta}\mathcal{U}$ associated with the Banach algebras…

Let $n$ be a positive integer. An $n$-cycle of linear mappings is an $n$-tuple $(u_1,\dots,u_n)$ of linear maps $u_1 \in \mathrm{Hom}(U_1,U_2),u_2 \in \mathrm{Hom}(U_2,U_3),\dots,u_n \in \mathrm{Hom}(U_n,U_1)$, where $U_1,\dots,U_n$ are…

We study the arithmetic circuit complexity of some well-known family of polynomials through the lens of parameterized complexity. Our main focus is on the construction of explicit algebraic branching programs (ABP) for determinant and…

Determinization of B\"uchi automata is a long-known difficult problem and after the seminal result of Safra, who developed the first asymptotically optimal construction from B\"uchi into Rabin automata, much work went into improving,…

Inspired by Andrews' and Bachraoui's work on partitions with repeated smallest part, we extend the concept to overpartitions. We study overpartitions with the restriction that the smallest non-overlined part appears exactly $k$ times and…

We propose a new construction of Banach-Lie groups and algebras relying on nonstandard analysis. A major standard application is the Local Theorem which to certain extent reduces the problem of associating a Lie group to a given banach-Lie…

We propose and evaluate antichain algorithms to solve the universality and language inclusion problems for nondeterministic Buechi automata, and the emptiness problem for alternating Buechi automata. To obtain those algorithms, we establish…

We continue the research of an extension $\widetilde{\mid}$ of the divisibility relation to the Stone-\v Cech compactification $\beta N$. First we prove that ultrafilters we call prime actually possess the algebraic property of primality.…

Building on the work of Avraham, Rubin, and Shelah, we aim to build a variant of the Fra\"iss\'e theory for uncountable models built from finite submodels. With this aim, we generalize the notion of an increasing set of reals to other…

In this paper, we extend the classical arithmetic defined over the set of natural numbers N, to the set of all finite directed connected multigraphs having a pair of distinct distinguished vertices. Specifically, we introduce a model F on…

We introduce the operators "modified limit" and "accumulation" on a Banach space, and we use this to define what we mean by being internally computable over the space. We prove that any externally computable function from a computable…

We demonstrate how one can construct renormalizable perturbative expansion in formally nonrenormalizable higher dimensional scalar theories. It is based on 1/N-expansion and results in a logarithmically divergent perturbation theory in…

We prove that if a set $B$ in a Banach space $X$ can be written as an increasing, countable union $B=\cup_n B_n$ of sets $B_n$ such that no $B_n$ is uniform boundedness deciding, then also $B$ is not uniform boundedness deciding. From this…

In graph theory, the Szemer\'edi regularity lemma gives a decomposition of the indicator function for any graph $G$ into a structured component, a uniform part, and a small error. This result, in conjunction with a counting lemma that…

Kleene's computability theory based on his S1-S9 computation schemes constitutes a model for computing with objects of any finite type and extends Turing's `machine model' which formalises computing with real numbers. A fundamental…

We study a family of functions defined in a very simple way as sums of powers of binary Hermitian forms with coefficients in the ring of integers of an Euclidean imaginary quadratic field $K$ with discriminant $d_K$. Using these functions…