相关论文: Constructing Types in Differentially Closed Fields…
We develop an axiomatic framework for fractal analysis and fractal number theory grounded in hierarchies of definability. Central to this approach is a sequence of formal systems F_n, each corresponding to a definability level S_n contained…
Let $G$ be a finite group. Let $K/k$ be a Galois extension of number fields with Galois group isomorphic to $G$, and let $C \subseteq \mathrm{Gal}(K/k) \simeq G$ be a conjugacy invariant subset. It is well known that there exists an…
We provide a characterisation of differentially large fields in arbitrary characteristic and a single derivation in the spirit of Blum axioms for differentially closed fields. In the case of characteristic zero, we use these axioms to…
In this paper many classes of sets of matrices with entries in F (F=R, F=C, F=H) are introduced. Each class with the corresponding topology determines a real analytical, complex or symplectic manifold for F=R, F=C or F=H respectively. Any…
The study of convex functions - in particular, of their optimization (really minimization) is one of the most important fields of applied mathematics. Convexity seems to be one of those incredibly well-chosen hypotheses which is just…
We characterise the existentially closed models of the theory of exponential fields. They do not form an elementary class, but can be studied using positive logic. We find the amalgamation bases and characterise the types over them. We…
We present and analyze a natural hierarchy of weak theories, develop analysis in them, and show that they are interpretable in bounded quantifier arithmetic $\text{I}\Delta_0$ (and hence in Robinson arithmetic Q). The strongest theories…
Due to the undecidability of most type-related properties of System F like type inhabitation or type checking, restricted polymorphic systems have been widely investigated (the most well-known being ML-polymorphism). In this paper we…
Roughly speaking, functional analysis is the study of vector spaces of arbitrary dimension over the field of real or complex numbers, and the continuous linear mappings between such spaces. Naturally, the notion of continuity requires a…
Given a definable function $f: S \to \mathbb{R}$ on a definable set $S$, we study sublevel sets of the form $S^f_t \coloneqq \{x \in S: f(x) \leq t\}$ for all $t \in \mathbb{R}$. Using o-minimal structures, we prove that the Euler…
Let G be a finite group. We explore the model theoretic properties of the class of differential fields of characteristic zero in m commuting derivations equipped with a G-action by differential field automorphisms. In the language of…
Several types of dependencies have been proposed for the static analysis of existential rule ontologies, promising insights about computational properties and possible practical uses of a given set of rules, e.g., in ontology-based query…
Given a cover $\mathbb{U}$ of a family of smooth complex algebraic varieties, we associate with it a class $\mathcal{U},$ containing $\mathbb{U}$, of structures locally definable in an o-minimal expansion of the reals. We prove that the…
On the 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…
This paper outlines new paradigms for real analysis and computability theory in the recently proposed non-Aristotelian finitary logic (NAFL). Constructive real analysis in NAFL (NRA) is accomplished by a translation of diagrammatic concepts…
The categorical models of the differential lambda-calculus are additive categories because of the Leibniz rule which requires the summation of two expressions. This means that, as far as the differential lambda-calculus and differential…
A continuous complex-valued function $F$ in a domain $D\subseteq\mathbf{C}$ is Poly-analytic of order $\alpha$ if it satisfies $\partial^{\alpha}_{\overline{z}}F=0.$ One can show that $F$ has the form…
A criterion is given for a type in a finite rank stable theory to be (almost) internal to a given nonmodular minimal type. The motivation comes from results of Campana which give criteria for compact complex analytic spaces to be algebraic…
We present Decalf, a directed, effectful cost-aware logical framework for studying quantitative aspects of functional programs with effects. Like Calf, the language is based on an internal phase distinction between the behavior of a program…
"Church's thesis" ($\mathsf{CT}$) as an axiom in constructive logic states that every total function of type $\mathbb{N} \to \mathbb{N}$ is computable, i.e. definable in a model of computation. $\mathsf{CT}$ is inconsistent in both…