Related papers: Ordered Models of the Lambda Calculus
Given partitions $\alpha$, $\beta$, $\gamma$, the short exact sequences $0\to N_\alpha \to N_\beta \to N_\gamma \to 0$ of nilpotent linear operators of Jordan types $\alpha$, $\beta$, $\gamma$, respectively, define a constructible subset…
The higher order matching problem is the problem of determining whether a term is an instance of another in the simply typed $\lambda$-calculus, i.e. to solve the equation a = b where a and b are simply typed $\lambda$-terms and b is…
Based on the needs of convergence proofs of preconditioned proximal point methods, we introduce notions of partial strong submonotonicity and partial (metric) subregularity of set-valued maps. We study relationships between these two…
In this paper we give alternate proofs of some well-known matrix inequalities. In particular, we show that under certain conditions the inequality holds \begin{align}\sum \limits_{\lambda_i\in \mathrm{Spec}(ab^{T})}\mathrm{min}\{\log…
The notion of lambda-symmetries, originally introduced by C. Muriel and J.L. Romero, is extended to the case of systems of first-order ODE's (and of dynamical systems in particular). It is shown that the existence of a symmetry of this type…
We study the complexity of deciding the equality of infinite objects specified by systems of equations, and of infinite objects specified by lambda-terms. For equational specifications there are several natural notions of equality: equality…
We show that a linearly ordered topological space is initially \lambda-compact if and only if it is \lambda-bounded, that is, every set of cardinality $\leq \lambda$ has compact closure. As a consequence, every product of initially…
We apply the notion of a full convex subcategory to a wide range of algebras including tilted, quasi-tilted, shod, weakly shod, left and right glued, laura, simply connected, strongly simply connected, left supported, and cluster-tilted. In…
We suggest an approach for description of integrable cases of the Abel equations. It is based on increasing of the order of equations up to the second one and using equivalence transformations for the corresponding second-order ordinary…
The subsumption problem with respect to terminologies in the description logic ALC is EXPTIME-complete. We investigate the computational complexity of fragments of this problem by means of allowed Boolean operators. Hereto we make use of…
In the work, the property of the second-order subdifferential is studied and second-order optimality conditions are obtained for the minimization problem. We also obtained necessary and sufficient conditions for an extremum for the extremal…
A non-deterministic call-by-need lambda-calculus \calc with case, constructors, letrec and a (non-deterministic) erratic choice, based on rewriting rules is investigated. A standard reduction is defined as a variant of left-most outermost…
Given an algebra $\mathbf{A}$, and terms $s(x_{1},x_{2},\dots x_{k})$ and $t(x_{1},x_{2},\dots x_{k})$ of the language of ${\mathbf A}$, we say that $s$ and $t$ are {\em separated} in ${\mathbf A}$ iff for all $a_{1},a_{2}\dots a_{k}\in A$,…
We study atom canonicity for several varieties of cylindric like algebras that contain properly the variety of representable algebras. The algebras in such varieties have relativized representations, and we thereby obtain many omitting…
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 formulate a well-posedness and approximation theory for a class of generalised saddle point problems. In this way we develop an approach to a class of fourth order elliptic partial differential equations using the idea of splitting into…
Our paper "Solving Third Order Linear Difference Equations in Terms of Second Order Equations" gave two algorithms for solving difference equations in terms of lower order equations: an algorithm for absolute factorization, and an algorithm…
We describe a type system for the linear-algebraic $\lambda$-calculus. The type system accounts for the linear-algebraic aspects of this extension of $\lambda$-calculus: it is able to statically describe the linear combinations of terms…
In this paper, a new calculus on sequences is defined. Also, the $\lambda$-derivative and the $\lambda$-integration are investigated. The fundamental theorem of $\lambda$-calculus is included. A suitable function basis for the…
For any truncated path algebra $\Lambda$ of a quiver, we classify, by way of representation-theoretic invariants, the irreducible components of the parametrizing varieties $\mathbf{Rep}_{\mathbf{d}}(\Lambda)$ of the $\Lambda$-modules with…