Related papers: On Braid Words and Irreflexivity
We show that time complexity analysis of higher-order functional programs can be effectively reduced to an arguably simpler (although computationally equivalent) verification problem, namely checking first-order inequalities for validity.…
A cyclic proof system allows us to perform inductive reasoning without explicit inductions. We propose a cyclic proof system for HFLN, which is a higher-order predicate logic with natural numbers and alternating fixed-points. Ours is the…
Dyadic regression models are commonly analyzed under the conventional dyadic dependence paradigm, in which two observations may be dependent only if the corresponding dyads share a node. This paper studies inference when this paradigm…
Defeasible logic is a rule-based nonmonotonic logic, with both strict and defeasible rules, and a priority relation on rules. We show that inference in the propositional form of the logic can be performed in linear time. This contrasts…
The purpose of this note is to give a direct and self-contained proof of the Proportionality Theorem of Brasselet-Schwartz. This theorem relates the Schwartz indices of frames obtained by radial extension on Whitney stratified analytic…
This note provides a detailed proof of the fact that a linear vector field on a vector bundle has a flow by vector bundle isomorphisms. It implies then easily the existence of global solutions to linear non-autonomous ODE's, with a standard…
Within the framework of test-experiments, an original pointing set-up based on speed-induced deflection of a light-beam and using a high-resolution opto-electronic array as a position detector, is proposed. The device would provide a new…
The purpose of this article is to give a presentation of the method of forcing aimed at someone with a minimal knowledge of set theory and logic. The emphasis will be on how the method can be used to prove theorems in ZFC.
Let ${\bf P}^n$ be the projective $n-$space over the complex numbers. In this note we show that an indecomposable rigid coherent sheaf on ${\bf P}^n$ has a trivial endomorphism algebra. This generalizes a result of Drezet for $n=2.$
The importance of transformations and normal forms in logic programming, and generally in computer science, is well documented. This paper investigates transformations and normal forms in the context of Defeasible Logic, a simple but…
The goal of this paper is twofold. In addition to the results stated in the next paragraph, we present some classical results on absoluteness relevant to functional analysis that are well known to logicians but not nearly as well advertised…
Proofs are traditionally syntactic, inductively generated objects. This paper reformulates first-order logic (predicate calculus) with proofs which are graph-theoretic rather than syntactic. It defines a combinatorial proof of a formula…
A result by Dehornoy (1992) says that every nontrivial braid admits a sigma-definite word representative, defined as a braid word in which the generator sigma_i with maximal index i appears with exponents that are all positive, or all…
This article is a survey of Ecalle's theory of flexion units. In particular, we provide complete proofs of several key assertions that were stated without proof in Ecalle's original works.
A companion paper to "On knot Floer homology in branched double covers" applied to braided branched loci. We reprove the main result of that paper concerning alternating branched loci when projected to an annulus, without using Khovanov…
The CSP dichotomy conjecture has been recently established, but a number of other dichotomy questions remain open, including the dichotomy classification of list homomorphism problems for signed graphs. Signed graphs arise naturally in many…
The analysis of the decoding failure rate of the bit-flipping algorithm has received increasing attention. For a binary linear code we consider the minimum number of rows in a parity-check matrix such that the bit-flipping algorithm is able…
We are concerned with orderable groups and particularly those with orderings invariant not only under multiplication, but also under a given automorphism or family of automorphisms. Several applications to topology are given: we prove that…
Homotopy braid group is the subject of the paper. First, linearity of homotopy braid group over the integers is proved. Then we prove that the group homotopy braid group on three strands is torsion free.
We prove, in ZFC alone, some new results on regularity and decomposability of ultrafilters. We also list some problems, and furnish applications to topological spaces and to extended logics.