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

Using arbitrary symplectic structures and parametrization invariant actions, we develop a formalism, based on Dirac's quantization procedure, that allows us to consider theories with both space-space as well as space-time noncommutativity.…

This thesis develops a framework for formalizing reasoning about specifications of systems written in LF. This formalization centers around the development of a reasoning logic that can express the sorts of properties which arise in…

This paper presents a new type analysis for logic programs. The analysis is performed with a priori type definitions; and type expressions are formed from a fixed alphabet of type constructors. Non-discriminative union is used to join type…

Predicate-argument structure analysis is a central component in meaning representations of text. The fact that some arguments are not explicitly mentioned in a sentence gives rise to ambiguity in language understanding, and renders it…

Let ${\mathbf U}_q^-$ be the negative half of a quantum group of finite type. We construct the canonical basis of ${\mathbf U}_q^-$ by applying the folding theory of quantum groups, and piecewise linear parametrization of canonical basis.…

This work begins the process of using the decomposition of the diagonal as a tool for studying the rationality of invariant fields of finite groups $G$. Our ground field must be characteristic 0 because of the use we make of Bertini…

The class of Unambiguous Star-Free Regular Languages (UL) was defined by Schutzenberger as the class of languages defined by Unambiguous Polynomials. UL has been variously characterized (over finite words) by logics such as TL[X_a,Y_a],…

Advances in logic programming and increasing industrial uptake of Datalog-inspired approaches demonstrate the emerging need to express powerful code analyses more easily. Declarative program analysis frameworks (e.g., using logic…

We develop the theory of n-stacks (or more generally Segal n-stacks which are $\infty$-stacks such that the morphisms are invertible above degree n). This is done by systematically using the theory of closed model categories (cmc). Our main…

We study multivariate entire functions and polynomials with non-negative coefficients. A class of {\bf Strongly Log-Concave} entire functions, generalizing {\it Minkowski} volume polynomials, is introduced: an entire function $f$ in $m$…

Non-commutative Euclidean scalar field theory is shown to have an eigenvalue sector which is dominated by a well-defined eigenvalue density, and can be described by a matrix model. This is established using regularizations of R^{2n}_\theta…

We study the Jacobian conjecture for Keller maps $f:X_0:=\mathbf{A}^n\rightarrow Y_0:=\mathbf{A}^n$ in characteristic $0$ and attempt to prove it. We are quite aware of the fact that many people have tried to prove the Jacobian conjecture…

A system of linear dependent types for the lambda calculus with full higher-order recursion, called dlPCF, is introduced and proved sound and relatively complete. Completeness holds in a strong sense: dlPCF is not only able to precisely…

Open-closed Deligne--Mumford field theories are chain-level field theories based on moduli spaces of stable curves with boundary. We associate to a relatively spin embedded Lagrangian $L \subset (X,\omega)$ such an open-closed DMFT. It…

We investigate the local topological structure of non-metrizable topological groups through the lens of Tukey order and cofinal types. Motivated by recent advances in topological groups admitting an $\omega^\omega$-base, we introduce the…

We develop the Scott model of the programming language PCF in univalent type theory. Moreover, we work constructively and predicatively. To account for the non-termination in PCF, we use the lifting monad (also known as the partial map…

Category theory can be used to state formulas in First-Order Logic without using set membership. Several notable results in logic such as proof of the continuum hypothesis can be elegantly rewritten in category theory. We propose in this…

The work presents the brief exposition of the proof (in ZF) of inaccessible cardinals nonexistence. To this end in view there is used the apparatus of subinaccessible cardinals and its basic tools -- reduced formula spectra and matrices and…

A subset of a model of ${\sf PA}$ is called neutral if it does not change the $\mathrm{dcl}$ relation. A model with undefinable neutral classes is called neutrally expandable. We study the existence and non-existence of neutral sets in…

We give a full description of the structure under inclusion of all finite level Borel classes of functions, and provide an elementary proof of the well-known fact that not every Borel function can be written as a countable union of…