Related papers: Minimal lambda-theories by ultraproducts

We introduce and study minimal (with respect to inclusion) solutions of systems of tropical linear differential equations. We describe the set of all minimal solutions for a single equation. It is shown that any tropical linear differential…

Let $\Lambda$ be a finite dimensional algebra over an algebraically closed field. Criteria are given which characterize existence of a fine or coarse moduli space classifying, up to isomorphism, the representations of $\Lambda$ with fixed…

Are all subcategories of locally finitely presentable categories that are closed under limits and $\lambda$-filtered colimits also locally presentable? For full subcategories the answer is affirmative. Makkai and Pitts proved that in the…

We consider the problem of covering $\mathbb{Z}^2$ with a finite number of sublattices of finite index, satisfying a simple minimality or non-degeneracy condition. We show how this problem may be viewed as a projective (or homogeneous)…

The Massively Parallel Computation (MPC) model serves as a common abstraction of many modern large-scale data processing frameworks, and has been receiving increasingly more attention over the past few years, especially in the context of…

Algebraic lambda-calculi have been studied in various ways, but their semantics remain mostly untouched. In this paper we propose a semantic analysis of a general simply-typed lambda-calculus endowed with a structure of vector space. We…

We show, by explicit computation, that bare lattice perturbation theory in the two-dimensional O(n) nonlinear $\sigma$ models with superinstanton boundary conditions is divergent in the limit of an infinite number of points $|\Lambda|$.…

The infinitary lambda calculi pioneered by Kennaway et al. extend the basic lambda calculus by metric completion to infinite terms and reductions. Depending on the chosen metric, the resulting infinitary calculi exhibit different notions of…

This paper studies models in which hypothesis tests have trivial power, that is, power smaller than size. This testing impossibility, or impossibility type A, arises when any alternative is not distinguishable from the null. We also study…

We investigate the relationship between finite terms in {\lambda}-letrec, the {\lambda}-calculus with letrec, and the infinite {\lambda}-terms they express. We say that a lambda-letrec term expresses a lambda-term if the latter can be…

It is well known that ordered exponential fields with a compatible non-trivial valuation cannot be spherically complete, but there are some that are ``complete enough''. This paper gives analogues of Kaplansky's theorem on maximally valued…

We study a class of mean curvature equations $-\mathcal Mu=H+\lambda u^p$ where $\mathcal M$ denotes the mean curvature operator and for $p\geq 1$. We show that there exists an extremal parameter $\lambda^*$ such that this equation admits a…

Here we show that, given a finite homological system $({\cal P},\leq,\{\Delta_u\}_{u\in {\cal P}})$ for a finite-dimensional algebra $\Lambda$ over an algebraically closed field, the category ${\cal F}(\Delta)$ of $\Delta$-filtered modules…

Consider a nonlinear regression model : y_{i}=g(x_{i},{\theta})+e_{i}, i=1,...,n, where the x_{i} are random predictors x_{i} and {\theta} is the unknown parameter vector ranging in a set {\Theta}\subsetR^{p}. All known results on the…

We to a large extent sort out when does a (first order complete theory) T have a superlimit model in a cardinal lambda . Also we deal with relation notions of being limit.

The problem of completing a large low rank matrix using a subset of revealed entries has received much attention in the last ten years. The main result of this paper gives a necessary and sufficient condition, stated in the language of…

We provide here the first steps toward Classification Theory of Abstract Elementary Classes with no maximal models, plus some mild set theoretical assumptions, when the class is categorical in some lambda greater than its Lowenheim-Skolem…

This talk gives an overview, aimed at non-experts, of the recent progress on the studies of technicolor models on the lattice. Phenomenologically successful technicolor models require walking coupling; thus, an emphasis is put on the…

Consider a stationary discrete random process with alphabet size d, which is assumed to be the output process of an unknown stationary Hidden Markov Model (HMM). Given the joint probabilities of finite length strings of the process, we are…

In this paper, we define a realizability semantics for the simply typed $\lambda\mu$-calculus. We show that if a term is typable, then it inhabits the interpretation of its type. This result serves to give characterizations of the…