相关论文: On Braid Words and Irreflexivity

Chain conditions are one of the major tools used in the theory of forcing. We say that a partial order has the countable chain condition if every antichain (in the sense of forcing) is countable. Without the axiom of choice antichains tend…

The main purpose of this paper is to formulate new conditions for smooth linearization of nonautonomous systems with discrete and continuous time. Our results assume that the linear part admits a nonuniform polynomial dichotomy and that the…

Comparability graphs are the undirected graphs whose edges can be directed so that the resulting directed graph is transitive. They are related to posets and have applications in scheduling theory. This paper considers the problem of…

The classical continuum models used for the woven fabrics do not fully describe the whole set of phenomena that occur during the testing of those materials. This incompleteness is partially due to the absence of energy terms related to some…

We uncover a close relationship between combinatorial and syntactic proofs for first-order logic (without equality). Whereas syntactic proofs are formalized in a deductive proof system based on inference rules, a combinatorial proof is a…

A cyclic proof system is a proof system whose proof figure is a tree with cycles. The cut-elimination in a proof system is fundamental. It is conjectured that the cut-elimination in the cyclic proof system for first-order logic with…

An efficient entailment proof system is essential to compositional verification using separation logic. Unfortunately, existing decision procedures are either inexpressive or inefficient. For example, Smallfoot is an efficient procedure but…

The idea of the work is to find an invariant way to pass from deformation theory to cohomology, which does not use any explicit cocycles. The appropriate cohomology theory is based on considering sheaves on a certain site. An advantage of…

Given a nonempty set $\mathcal{L}$ of linear orders, we say that the linear order $L$ is $\mathcal{L}$-convex embeddable into the linear order $L'$ if it is possible to partition $L$ into convex sets indexed by some element of $\mathcal{L}$…

This set of notes re-proves known results on weighted automata (over a field, also known as multiplicity automata). The text offers a unified view on theorems and proofs that have appeared in the literature over decades and were written in…

The discriminantal arrangement is the space of configurations of $n$ hyperplanes in generic position in a $k$ dimensional space (see \cite{MS}). Differently from the case $k=1$ in which it corresponds to the well known braid arrangement,…

A generate and test algorithm is described which parses a surface form into one or more lexical entries using linearly ordered phonological rules. This algorithm avoids the exponential expansion of search space which a naive parsing…

We study possible formulations of algebraic propositional proof systems operating with noncommutative formulas. We observe that a simple formulation gives rise to systems at least as strong as Frege---yielding a semantic way to define a…

Linearizability has become the key correctness criterion for concurrent data structures, ensuring that histories of the concurrent object under consideration are consistent, where consistency is judged with respect to a sequential history…

In this paper we give necessary and sufficient conditions for a knot type to admit non-loose Legendrian and transverse representatives in some overtwisted contact structure, classify all non-loose rational unknots in lens spaces, and…

A focused proof system provides a normal form to cut-free proofs that structures the application of invertible and non-invertible inference rules. The focused proof system of Andreoli for linear logic has been applied to both the proof…

The goal of this paper is to establish that it remains undecidable whether a sequent is provable in two systems in which a weakening rule for an exponential modality is completely omitted from classical propositional linear logic…

We discuss how to apply work of L. Rudolph to braid conjugacy class invariants to obtain potentially effective obstructions to a slice knot being ribbon. We then apply these ideas to a family of braid conjugacy class invariants coming from…

We revisit the abstract framework underlying the fibration method for producing rational points on the total space of fibrations over the projective line. By fine-tuning its dependence on external arithmetic conjectures, we render the…

We consider fragments of uniform reflection for formulas in the analytic hierarchy over theories of second order arithmetic. The main result is that for any second order arithmetic theory $T_0$ extending ${\sf RCA}_0$ and axiomatizable by a…