相关论文: Constant-Depth Frege Systems with Counting Axioms …

A new computational method that uses polynomial equations and dynamical systems to evaluate logical propositions is introduced and applied to Goedel's incompleteness theorems. The truth value of a logical formula subject to a set of axioms…

We show that each direct summand of the associated graded module of the test module filtration $\tau(M, f^\lambda)_{\lambda \geq 0}$ admits a natural Cartier structure. If $\lambda$ is an $F$-jumping number, then this Cartier structure is…

Consider the following decision problem: for a given monotone Boolean function $f$ decide, whether $f$ is read-once. For this problem, it is essential how the input function $f$ is represented. Our contribution consists of the following two…

Using the functional interpretation from proof theory, we analyze nonconstructive proofs of several central theorems about polynomial and differential polynomial rings. We extract effective bounds, some of which are new to the literature,…

We display an application of the notions of kernelization and data reduction from parameterized complexity to proof complexity: Specifically, we show that the existence of data reduction rules for a parameterized problem having (a). a…

This paper describes a formalization of discrete real closed fields in the Coq proof assistant. This abstract structure captures for instance the theory of real algebraic numbers, a decidable subset of real numbers with good algorithmic…

This paper derives the extended Kalman filter (EKF) for continuous-time systems on matrix Lie groups observed through discrete-time measurements. By modeling the system noise on the Lie algebra and adopting a Stratonovich interpretation for…

We provide $\mathbb{N}$-filtrations on the negative part $U_q(\mathfrak{n}^-)$ of the quantum group associated to a finite-dimensional simple Lie algebra $\mathfrak{g}$, such that the associated graded algebra is a skew-polynomial algebra…

It is well known that for every $f\in C^m$ there exists a polynomial $p_n$ such that $p^{(k)}_n\rightarrow f^{(k)}$, $k=0,\ldots,m$. Here we prove such a result for fractional (non-integer) derivatives. Moreover, a numerical method is…

We show that arithmetical transfinite recursion is equivalent to a suitable formalization of the following: For every ordinal $\alpha$ there exists an ordinal $\beta$ such that $1+\beta\cdot(\beta+\alpha)$ (ordinal arithmetic) admits an…

We incorporate strong negation in the theory of computable functionals TCF, a common extension of Plotkin's PCF and G\"{o}del's system $\mathbf{T}$, by defining simultaneously strong negation $A^{\mathbf{N}}$ of a formula $A$ and strong…

The main goal of this paper is to prove the following: for a triangulated category $ \underline{C}$ and $E\subset \operatorname{Obj} \underline{C}$ there exists a cohomological functor $F$ (with values in some abelian category) such that…

Recently dilogarithm identities have made their appearance in the physics literature. These identities seem to allow to calculate structure constants like, in particular, the effective central charge of certain conformal field theories from…

In these notes we discuss the procedure how to calculate nullvectors in general indecomposable representations which are encountered in logarithmic conformal field theories. In particular, we do not make use of any of the restrictions which…

Computational tools in numerical algebraic geometry can be used to numerically approximate solutions to a system of polynomial equations. If the system is well-constrained (i.e., square), Newton's method is locally quadratically convergent…

We prove new upper bounds for the degrees in Hilbert's Nullstellensatz and for the Noether exponent of polynomial ideals in terms of the monomial structure of the polynomials involved. Our bounds improve the previously known bounds in the…

In this expository paper, we present simple proofs of the Classical, Real, Projective and Combinatorial Nullstellens\"atze. Several applications are also presented such as a classical theorem of Stickelberger for solutions of polynomial…

We introduce a new division formula on projective space which provides explicit solutions to various polynomial division problems with sharp degree estimates. We consider simple examples as the classical Macaulay theorem as well as a quite…

Ladders of field polynomial differential forms obeying systems of descent equations and corresponding to observables and anomalies of gauge theories are renormalized. They obey renormalized descent equations. Moreover they are shown to have…

A solution for Smale's 17th problem, for the case of systems with bounded degree was recently given. This solution, an algorithm computing approximate zeros of complex polynomial systems in average polynomial time, assumed infinite…