相关论文: Constructing Types in Differentially Closed Fields…

The article deals with the class ${\mathcal F}_{\alpha }$ consisting of non-vanishing functions $f$ that are analytic and univalent in $\ID$ such that the complement $\IC\backslash f(\ID) $ is a convex set, $f(1)=\infty ,$ $f(0)=1$ and the…

The Dependent Object Types (DOT) calculus formalizes key features of Scala. The D$_{<: }$ calculus is the core of DOT. To date, presentations of D$_{<: }$ have used declarative typing and subtyping rules, as opposed to algorithmic.…

Dependent Object Types (DOT) is a calculus with path dependent types, intersection types, and object self-references, which serves as the core calculus of Scala 3. Although the calculus has been proven sound, it remains open whether type…

In \cite{Craig}, we introduced a syntactically defined and highly general class of calculi known as \emph{semi-analytic}. We then demonstrated that any sufficiently strong (modal) substructural logic with a semi-analytic calculus must…

We consider nonnegative solutions to $-\Delta u=f(u)$ in unbounded euclidean domains, where $f$ is merely locally Lipschitz continuous and satisfies $f(0)<0$. In the half-plane, and without any other assumption on $u$, we prove that $u$ is…

We prove that the (elementary) class of differential-difference fields in characteristic $p>0$ admits a model-companion. In the terminology of Chatzidakis-Pillay, this says that the class of differentially closed fields of characteristic…

Designing a static analysis is generally a substantial undertaking, requiring significant expertise in both program analysis and the domain of the program analysis, and significant development resources. As a result, most program analyses…

We prove that the theory of differentially closed fields of characteristic zero in $m\geq 1$ commuting derivations DCF$_{0,m}$ satisfies the expected form of the dichotomy. Namely, any minimal type is either locally modular or nonorthogonal…

We consider the untyped lambda calculus with constructors and recursively defined constants. We construct a domain-theoretic model such that any term not denoting bottom is strongly normalising provided all its `stratified approximations'…

Classification and invariants, with respect to basis changes, of finite dimensional algebras are considered. An invariant open, dense (in the Zariscki topology) subset of the space of structural constants is defined. The algebras with…

Functional ANOVA offers a principled framework for interpretability by decomposing a model's prediction into main effects and higher-order interactions. For independent features, this decomposition is well-defined, strongly linked with SHAP…

Let $N$ be a positive integer. We say a non-constant rational function $U(x)\in{\mathbb C}(x)$ is $N$-\emph{unital} if all the zeros and poles of both $U(x)$ and $1-U(x)$ are either 0 or $N$-th roots of unity. These functions are called…

Let $X(\RR)$ be a geometrically connected variety defined over $\RR$ and such that the set of all its (also complex) points $X(\CC)$ is non-degenerate. We introduce the notion of \emph{admissible rank} of a point $P$ with respect to $X$ to…

This note tries to show that a re-examination of a first course in analysis, using the more sophisticated tools and approaches obtained in later stages, can be a real fun for experts, advanced students, etc. We start by going to the…

The property of countable metacompactness of a topological space gets its importance from Dowker's 1951 theorem that the product of a normal space X with the unit interval is again normal iff X is countably metacompact. In a recent paper,…

It is known that first-order logic with some counting extensions can be efficiently evaluated on graph classes with bounded expansion, where depth-$r$ minors have constant density. More precisely, the formulas are $\exists x_1 ... x_k \#y…

We extend the constructive dependent type theory of the Logical Framework $\mathsf{LF}$ with monadic, dependent type constructors indexed with predicates over judgements, called Locks. These monads capture various possible proof attitudes…

Motivated by applications in declarative data analysis, we study $\mathit{Datalog}_{\mathbb{Z}}$---an extension of positive Datalog with arithmetic functions over integers. This language is known to be undecidable, so we propose two…

The univalence axiom expresses the principle of extensionality for dependent type theory. However, if we simply add the univalence axiom to type theory, then we lose the property of canonicity - that every closed term computes to a…

On one hand, termination analysis of logic programs is now a fairly established research topic within the logic programming community. On the other hand, non-termination analysis seems to remain a much less attractive subject. If we divide…