Related papers: Infinitary Refinement Types for Temporal Propertie…
Infinite time Turing machines extend the operation of ordinary Turing machines into transfinite ordinal time. By doing so, they provide a natural model of infinitary computability, a theoretical setting for the analysis of the power and…
Groups of finite type (also called finitely constrained groups), introduced by Grigorchuk, are known to be the closure of regular branch groups. This article explores many of their properties. Firstly, we prove that being finitely…
In this paper (second in the series) we study the properties of tree-level binary amplitudes of the infinite-component effective field theory of strong interaction obeying the requirements of quark-hadron duality and maximal analyticity. In…
We introduce the concept of topological finite-determinacy for germs of analytic functions within a fixed ideal $I$, which provides a notion of topological finite-determinacy of functions with non-isolated singularities. We prove the…
We show that any finite-entropy, countable-valued finitary factor of an i.i.d process can also be expressed as a finitary factor of a finite-valued i.i.d process whose entropy is arbitrarily close to the target process. As an application,…
We present a model-theoretic property of finite structures, that can be seen to be a finitary analogue of the well-studied downward L\"owenheim-Skolem property from classical model theory. We call this property as the…
We introduce a coinductive definition of infinitary term rewriting. The setup is surprisingly simple, and has in contrast to the usual definitions of infinitary rewriting, neither need for ordinals nor for metric convergence. While the idea…
In this paper, we study arbitrary infinite binary information systems each of which consists of an infinite set called universe and an infinite set of two-valued functions (attributes) defined on the universe. We consider the notion of a…
The set of two-body reduced states of translation invariant, infinite quantum spin chains can be approximated from inside and outside using matrix product states and marginals of finite systems, respectively. These lead to hierarchies of…
We discuss the stochastic interpretation of a control system determined by a system of differential equations on a tree. For example, such a system on a finite tree arises after replacing the coefficients of the equation on an interval with…
This paper develops a variational inference framework for control of infinite dimensional stochastic systems. We employ a measure theoretic approach which relies on the generalization of Girsanov's theorem, as well as the relation between…
We give criteria on an inverse system of finite groups that ensure the limit is just infinite or hereditarily just infinite. More significantly, these criteria are 'universal' in that all (hereditarily) just infinite profinite groups arise…
Suitable extensions of the monadic second-order theory of k successors have been proposed in the literature to capture the notion of time granularity. In this paper, we provide the monadic second-order theories of downward unbounded layered…
Since the topic emerged several years ago, work on regular model checking has mostly been devoted to the verification of state reachability and safety properties. Though it was known that linear temporal properties could also be checked…
A fertile field of research in theoretical computer science investigates the representation of general recursive functions in intensional type theories. Among the most successful approaches are: the use of wellfounded relations,…
We introduce an operational rewriting-based semantics for strictly positive nested higher-order (co)inductive types. The semantics takes into account the "limits" of infinite reduction sequences. This may be seen as a refinement and…
The aim of this paper is to show Cauchy-Kowalevski and Holmgren type theorems with infinite number of variables. We adopt von Koch and Hilbert's definition of analyticity of functions as monomial expansions. Our Cauchy-Kowalevski type…
As an alternative to the well-known methods of "chaining" and "bracketing" that have been developed in the study of random fields, a new method, which is based on a stochastic maximal inequality derived by using the Taylor expansion, is…
The goal of this paper is to provide exact and terminating algorithms for the formal analysis of deterministic continuous-time control systems with affine input and polynomial state dynamics (in short, polynomial systems). We consider the…
This paper investigates the behavior of sets and functions at infinity by introducing new concepts, namely directional normal cones at infinity for unbounded sets, along with limiting and singular subdifferentials at infinity in the…