Related papers: A Direct Proof of the Theorem on Formal Functions

Interactive proof assistants make it possible for ordinary mathematicians to write definitions and theorems in a formal proof language, like a programming language, so that a computer can parse them and check them against the rules of a…

Based on any chiral vertex operator algebra satisfying a suitable finiteness condition, the semisimplicity of the zero-mode algebra as well as a regularity for induced modules, we construct conformal field theory over the projective line…

In this paper, we shall prove the Chung-Feller Theorem in several ways. We provide an inductive proof, bijective proof, and proofs using generating functions, and the Cycle Lemma of Dvoretzky and Motzkin.

The sequent calculus is a formalism for proving validity of statements formulated in First-Order Logic. It is routinely used in computer science modules on mathematical logic. Formal proofs in the sequent calculus are finite trees obtained…

We give necessary and sufficient conditions for a function in a naturally appearing functional space to be a fixed point of the Ruelle-Thurston operator associated to a rational function, see Lemma 2.1. The proof uses essentially a recent…

Here I prove some extension theorem for multifunctions in a space with an arbitrary uniform structure and orbital completeness. The motivation comes from a fixed point theorem due to Dhage which is proved as a special case of the theorem…

We consider smooth completion of algebraic manifolds. Having some information about its singular completions or about completions of its images we prove purity of cohohomology of the set at infinity. We deduce also some topological…

This paper explores the sheaves with the action of a lie algebra and computes their cohomology in a new category. Then in the following sections, We try to generalize a classical result in [GM, Ch. IV] about exterior algebra. We add the…

Let (A,m_A) -> (B,m_B) be a local morphism of local noetherian rings and M a finitely generated B-module. Then it follows from Tor^A_1(M,A/m_A) = 0 that M is a flat A-module. This is usually called the "local criterion of flatness". We give…

Deformation theory is treated for locally notherian formal schemes (non necessarily smooth). The cotangent complex is defined in the derived category through the homology localization functor. The basic properties and results of a…

We define an extension of predicate logic, called Binding Logic, where variables can be bound in terms and in propositions. We introduce a notion of model for this logic and prove a soundness and completeness theorem for it. This theorem is…

We prove a uniqueness theorem for a large class of functional equations in the plane, which resembles in form a classical result of Aczel. It is also shown that functional equations in this class are overdetermined in the sense of Paneah.…

In this note we give a wellfoundedness proof of a computable notation system for first-order reflection.

Model theoretic results such as Characterization and Definability give important information about different logics. It is well known that the proofs of those results for several modal logics have, somehow, the same 'taste'. A general proof…

In this work we state a Theorem on number theory and apply it to solve some ordinary and partial differential equations.

In the paper the problem of verification of functional programs (FPs) over strings is considered, where specifications of properties of FPs are defined by other FPs, and a FP S1 meets a specification defined by another FP S2 iff a…

We find the model completion of the theory modules over $A$, where $A$ is a finitely generated commutative algebra over a field $K$. This is done in a context where the field $K$ and the module are represented by sorts in the theory, so…

We improve the theorem on continuous dependence of solutions of functional differential equations (see J. Hale, Functional differential equations, theorem 5.1), using some new results on continuous convergences. Namely, we prove this…

In this paper, we present a generalized effective completeness theorem for continuous logic. The primary result is that any continuous theory is satisfied in a structure which admits a presentation of the same Turing degree. It then follows…

In this paper I present a kind of proof for classical Euclidean geometric problems which relies on both synthetic and analytic geometry. Using the elementary tools of polynomial algebra and multivariate calculus we manage to reduce the…