相关论文: A Direct Proof of Schwichtenberg's Bar Recursion C…

Given a DG-category A we introduce the bar category of modules Modbar(A). It is a DG-enhancement of the derived category D(A) of A which is isomorphic to the category of DG A-modules with A-infinity morphisms between them. However, it is…

We study the (H\"older-)continuous behavior of the spectra belonging to a family of linear bounded operators $(A_t)_{t\in T}$ indexed by a topological space $T$. For the cases of self-adjoint, unitary and normal operators, a…

\input amssym.def \input amssym.tex Let $G$ be a connected algebraic reductive group over an algebraic closure of a prime field ${\Bbb F}_p$, defined over ${\Bbb F}_q$ thanks to a Frobenius $F$. Let $\ell$ be a prime different from $p$. Let…

Structured reversible flowchart languages is a class of imperative reversible programming languages allowing for a simple diagrammatic representation of control flow built from a limited set of control flow structures. This class includes…

In Theorem 3.1 of [12], we proved a rigidity result for self-shrinkers under the integral condition on the norm of the second fundamental form. In this paper, we relax the such bound to any finite constant (see Theorem 4.4 for details).

For any (possibly singular) hyperelliptic curve, we give the definition of a hyperelliptic refined spectral curve and the hyperelliptic refined topological recursion, generalising the formulation for a special class of genus-zero curves by…

We classify thick tensor ideals of finite objects in the category of rational torus-equivariant spectra, showing that they are completely determined by geometric isotropy. This is essentially equivalent to showing that the Balmer spectrum…

This paper provides a general account of the notion of recursive program schemes, studying both uninterpreted and interpreted solutions. It can be regarded as the category-theoretic version of the classical area of algebraic semantics. The…

We study versions of the tree pigeonhole principle, $\mathsf{TT}^1$, in the context of Weihrauch-style computable analysis. The principle has previously been the subject of extensive research in reverse mathematics. Two outstanding…

A bound for Betti numbers of sets definable in o-minimal structures is presented. An axiomatic complexity measure is defined, allowing various concrete complexity measures for definable functions to be covered. This includes common concrete…

Shapiro's notations for natural numbers, and the associated desideratum of acceptability - the property of a notation that all recursive functions are computable in it - is well-known in philosophy of computing. Computable structure theory,…

We develop a sharp boundary trace theory in arbitrary bounded Lipschitz domains which, in contrast to classical results, allows "forbidden" endpoints and permits the consideration of functions exhibiting very limited regularity. This is…

Let $E \subset \C$ be a Borel set with finite length, that is, $0<\mathcal{H}^1 (E)<\infty$. By a theorem of David and L\'eger, the $L^2 (\mathcal{H}^1 \lfloor E)$-boundedness of the singular integral associated to the Cauchy kernel (or…

In this work we generalize primitive recursion in order to construct a hierarchy of terminating total recursive operators which we refer to as {\em leveled primitive recursion of order $i$}($\mathbf{PR}_{i}$). Primitive recursion is…

We present the design, implementation, and foundation of a verifier for higher-order functional programs with generics and recursive data types. Our system supports proving safety and termination using preconditions, postconditions and…

We present a new type system with support for proofs of programs in a call-by-value language with control operators. The proof mechanism relies on observational equivalence of (untyped) programs. It appears in two type constructors, which…

We establish sharp stability results for of non--selfadjoint the ascent and descent spectra under strong resolvent convergence (SRS), a natural framework for finite element approximations of non-selfadjoint and singularly perturbed…

In this paper the reversibility of executable Interval Temporal Logic (ITL) specifications is investigated. ITL allows for the reasoning about systems in terms of behaviours which are represented as non-empty sequences of states. It allows…

Terminal coalgebras for a functor serve as semantic domains for state-based systems of various types. For example, behaviors of CCS processes, streams, infinite trees, formal languages and non-well-founded sets form terminal coalgebras. We…

Let $\mathcal{F}=(F;+,\cdot,0,1,D)$ be a differentially closed field. We consider the question of definability of the derivation $D$ in reducts of $\mathcal{F}$ of the form $\mathcal{F}_{R}=(F;+,\cdot,0,1,P)_{P \in R}$ where $R$ is a…