Related papers: Constructing Types in Differentially Closed Fields…

Formal Concept Analysis has proven to be an effective method of restructuring complete lattices and various algebraic domains. In this paper, the notions of attribute continuous formal context and continuous formal concept are introduced by…

There are two approaches to time series approximate factor models: the static factor model, where the factors are loaded contemporaneously by the common component, and the Generalised Dynamic Factor Model, where the factors are loaded with…

Categorical data are common in educational and social science research; however, methods for its analysis are generally not covered in introductory statistics courses. This chapter overviews fundamental concepts and methods in categorical…

Let $\mathbb{F}_{q}$ be a finite field of cardinality $q$, $R=\mathbb{F}_{q}[u]/\langle u^4\rangle=\mathbb{F}_{q}+u\mathbb{F}_{q}+u^2\mathbb{F}_{q}+u^3\mathbb{F}_{q}$ $(u^4=0)$ which is a finite chain ring, and $n$ be a positive integer…

We introduce a class of theories called metastable, including the theory of algebraically closed valued fields (ACVF) as a motivating example. The key local notion is that of definable types dominated by their stable part. A theory is…

We present a set-theoretic, proof-irrelevant model for Calculus of Constructions (CC) with predicative induction and judgmental equality in Zermelo-Fraenkel set theory with an axiom for countably many inaccessible cardinals. We use Aczel's…

We prove that for every indecomposable ordinal there exists a (transfinitely valued) Euclidean domain whose minimal Euclidean norm is of that order type. Conversely, any such norm must have indecomposable type, and so we completely…

There is a universal constant $0<r_0<1$ with the following property. Suppose that $f$ is an analytic function on the unit disk $\D$, and suppose that there exists a constant $M>0$ so that the Euclidean area, counting multiplicity, of the…

This paper investigates the effective categoricity of ultrahomogeneous structures. It is shown that any computable ultrahomogeneous structure is $\Delta^0_2$ categorical. A structure A is said to be weakly ultrahomogeneous if there is a…

A modification of the symmetry approach for the classification of integrable differential-difference equations of the form $$ u_{n,t} = f_n(u_{n-1}, u_n, u_{n+1}), $$ where $n$ is a discrete integer variable, is presented (the well-known…

New Foundations ($\mathrm{NF}$) is a set theory obtained from naive set theory by putting a stratification constraint on the comprehension schema; for example, it proves that there is a universal set $V$. $\mathrm{NFU}$ ($\mathrm{NF}$ with…

Let $\Omega$ denote the class of functions $f$ analytic in the open unit disc $\Delta$, normalized by the condition $f(0)=f'(0)-1=0$ and satisfying the inequality \begin{equation*} \left|zf'(z)-f(z)\right|<\frac{1}{2}\quad(z\in\Delta).…

We construct a diffeomorphism invariant (Colombeau-type) differential algebra canonically containing the space of distributions in the sense of L. Schwartz. Employing differential calculus in infinite dimensional (convenient) vector spaces,…

The class of uniformly computable real functions with respect to a small subrecursive class of operators computes the elementary functions of calculus, restricted to compact subsets of their domains. The class of conditionally computable…

Static analysis tools typically address the problem of excessive false positives by requiring programmers to explicitly annotate their code. However, when faced with incomplete annotations, many analysis tools are either too conservative,…

We investigate the possibility of a semantic account of the execution time (i.e. the number of \beta_v-steps leading to the normal form, if any) for the shuffling calculus, an extension of Plotkin's call-by-value {\lambda}-calculus. For…

We study a $\mathcal PT$-symmetric scalar Euclidean field theory with a complex action, using both theoretical analysis and lattice simulations. This model has a rich phase structure that exhibits pattern formation in the critical region.…

The decidability of the reachability problem for finitary PCF has been used as a theoretical basis for fully automated verification tools for functional programs. The reachability problem, however, often becomes undecidable for a slight…

We revisit Kolchin's results on definability of differential Galois groups of strongly normal extensions, in the case where the field of constants is not necessarily algebraically closed. In certain classes of differential topological…

Canonical correlation analysis (CCA) is a classic statistical method for discovering latent co-variation that underpins two or more observed random vectors. Several extensions and variations of CCA have been proposed that have strengthened…