Related papers: Hyperarithmetical Complexity of Infinitary Action …
We motivate and study an infinite sequence of binary operations on the ordinal numbers, extending the standard arithmetic on the ordinals to higher degrees of iteration. Connections to the hyperoperations on the natural numbers are…
Information security properties of reactive systems like non-interference often require relating different executions of the system to each other and following them simultaneously. Such hyperproperties can also be useful in other contexts,…
We introduce the class of tree constraint automata with data values in Z (equipped with the less than relation and equality predicates to constants) and we show that the nonemptiness problem is ExpTime-complete. Using an automata-based…
Within the framework of computable infinitary continuous logic, we develop a system of hyperarithmetic numerals. These numerals are infinitary sentences in a metric language $L$ that have the same truth value in every interpretation of $L$.…
We define a new strict and computable hierarchy for the family of automaton semigroups, which reflects the various asymptotic behaviors of the state-activity growth. This hierarchy extends that given by Sidki for automaton groups, and also…
We studied the hyperlogic HyperQPTL, which combines the concepts of trace relations and $\omega$-regularity. We showed that HyperQPTL is very expressive, it can express properties like promptness, bounded waiting for a grant, epistemic…
We introduce ocLTL, the case of LTL+P modulo {\omega}-categorical theories. We reduce its realizability and synthesis problems into the corresponding problems in propositional LTL+P. The core of the reduction replaces each data subformula…
This paper presents a cut-elimination proof for the logic $LG^\omega$, which is an extension of a proof system for encoding generic judgments, the logic $\FOLDNb$ of Miller and Tiu, with an induction principle. The logic $LG^\omega$, just…
We establish a one-to-one correspondence between rational multiplicative group actions on an algebraic variety $X$ and derivations $\partial\colon K_X\to K_X$ of the field of fractions $K_X$ of $X$ satisfying that there exists a generating…
We consider the satisfiability problem for the two-variable fragment of first-order logic over finite unranked trees. We work with signatures consisting of some unary predicates and the binary navigational predicates child, right sibling,…
Fekete's lemma is a well known result from combinatorial mathematics that shows the existence of a limit value related to super- and subadditive sequences of real numbers. In this paper, we analyze Fekete's lemma in view of the arithmetical…
We propose a new family of multilevel methods for unconstrained minimization. The resulting strategies are multilevel extensions of high-order optimization methods based on q-order Taylor models (with q >= 1) that have been recently…
It is a celebrated result of McKinsey and Tarski [28] that S4 is the logic of the closure algebra X+ over any dense-in-itself separable metrizable space. In particular, S4 is the logic of the closure algebra over the reals R, the rationals…
A construction of prismatic Hardy space infinite elements to discretize wave equations on unbounded domains $\Omega$ in $H^1_{loc}(\Omega)$, $H_{loc}(curl;\Omega)$ and $H_{loc}(div;\Omega)$ is presented. As our motivation is to solve…
We consider several old problems involving the number of prime divisors function $\omega(n)$, as well as the related functions $\Omega(n)$ and $\tau(n)$. Firstly, we show that there are infinitely many positive integers $n$ such that…
We obtain a sequence of solutions converging to zero for the Kirchhoff equation $$-\left( 1+\int_{\Omega}\left\vert \nabla u\right\vert^2\right) \Delta u+V(x)u=f(u)\text{,\qquad}u\in H_{0}^{1}(\Omega)$$ via truncating technique and a…
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…
In this paper we find all solvable subgroups of Diff^omega(S^1) and classify their actions. We also investigate the C^r local rigidity of actions of the solvable Baumslag-Solitar groups on the circle. The investigation leads to two novel…
Complementation of finite automata on infinite words is not only a fundamental problem in automata theory, but also serves as a cornerstone for solving numerous decision problems in mathematical logic, model-checking, program analysis and…
In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…