Interval Temporal Logic (ITL) is a formalism for reasoning about time periods. To date no one has proved completeness of a relatively simple ITL deductive system supporting infinite time and permitting infinite sequential iteration comparable to ω-regular expressions. We have developed a complete axiomatization for such a version of quantified ITL over finite domains and can show completeness b...

This work is devoted to a study and summary of different Infinite Element (IE) formulations for Helmholtz problems in arbitrary exterior domains. The theoretical setting for each of the different formulations is presented and related to the mathematical existence theory. The influences of a bilinear or a sesquilinear formulation are discussed as well as possible extensions to other elements. Th...

In this paper we first study the generalized weighted Hardy spaces $H^{p}_{L,w}(X)$ for $0 < p \le 1$ associated to nonnegative self-adjoint operators $L$ satisfying Gaussian upper bounds on space of homogeneous type $X$ in both cases finite and infinite measure. We show that defined via maximal functions atomic decompositions coincide. Then prove regularity estimates Green inhomogeneous Dirich...

Abstract This is the first in a series of articles about recovering full algebraic structure boundary conformal field theory (CFT) from scaling limit critical Ising model slit-strip geometry. Here, we introduce spaces holomorphic functions continuum domains as well corresponding discrete lattice domains. We find distinguished sets characterized by their singular behavior three infinite directio...

We systematically investigate the computational complexity of constraint satisfaction problems for constraint languages over an infinite domain. In particular, we study a generalization of the well-established notion of maximal constraint languages from finite to infinite domains. If the constraint language can be defined with an ω-categorical structure, then maximal constraint languages are in...

Constraint satisfaction problems are limited in that their domain values are treated as atomic entities, causing specifications for infinite CSPs to be solver-dependent. ObjectOriented Constraint Satisfaction Problems (OOCSPs) synthesize the object-oriented paradigm with declarative constraints to provide a rich language for describing infinite domains, independent of the solver. This paper int...

We construct solutions of the magnetohydrostatic (MHS) equations in bounded domains and on torus three spatial dimensions, as infinite time limits Voigt approximations viscous, non-resistive incompressible magnetohydrodynamics equations. The modify evolution without introducing artificial viscosity. show that obtained MHS are regular, nontrivial, not Beltrami fields.

a group g is said to be a (pf)c-group or to have polycyclic-by-finite conjugacy classes, if g/c_{g}(x^{g}) is a polycyclic-by-finite group for all xin g. this is a generalization of the familiar property of being an fc-group. de falco et al. (respectively, de giovanni and trombetti) studied groups whose proper subgroups of infinite rank have finite (respectively, polycyclic) conjugacy classes. ...

In the case of some infinite domains, it is shown that the spectrum of the elasticity theory operator is not purely continuous. This implies the existence of a new class of the so-called topographical waveguides. §

The use of infinite abstract domains with widening and narrowing for accelerating the convergence of abstract interpretations is shown to be more powerful than the Galois connection approach re­ stricted to finite lattices (or lattices satisfying the chain condition).