相关论文: On Braid Words and Irreflexivity
Beklemishev introduced an ordinal notation system for the Feferman-Sch\"utte ordinal $\Gamma_0$ based on the autonomous expansion of provability algebras. In this paper we present the logic $\textbf{BC}$ (for Bracket Calculus). The language…
Order-invariant formulas access an ordering on a structure's universe, but the model relation is independent of the used ordering. Order invariance is frequently used for logic-based approaches in computer science. Order-invariant formulas…
Linearizability is a commonly accepted notion of correctness for libraries of concurrent algorithms, and recent years have seen a number of proposals of program logics for proving it. Although these logics differ in technical details, they…
Dividing asks about inconsistency along indiscernible sequences. In order to study the finer structure of simple theories without much dividing, the authors recently introduced shearing, which essentially asks about inconsistency along…
First-order temporal logics are notorious for their bad computational behaviour. It is known that even the two-variable monadic fragment is highly undecidable over various linear timelines, and over branching time even one-variable…
We study an order relation on the fibers of a continuous map and its application to the study of the structure of compact spaces of uncountable weight.
For each integer $n\ge 1$, after fixing a proper complexity function on the braid group $\B_{2n}$, we use the Dehornoy order to define a strict total order on the set \[ \mathcal P_{2n}=H_{2n}\backslash \B_{2n}/H_{2n} \] of $2n$--plat…
This note presents an interesting counterexample to a basic covering problem.
The main results of the paper points out the connection between the weak ordered relations and factor lattices defined by tolerances. It is proved that for any tolerance $T$ of a lattice $L$ the Dedekind-Mac Neille completion of $L/T$ is…
We define a new topological invariant of line arrangements in the complex projective plane. This invariant is a root of unity defined under some combinatorial restrictions for arrangements endowed with some special torsion character on the…
We provide a new representation-independent formulation of Occam's razor theorem, based on Kolmogorov complexity. This new formulation allows us to: (i) Obtain better sample complexity than both length-based and VC-based versions of Occam's…
In this paper, we extend the notion of Lyndon word to transfinite words. We prove two main results. We first show that, given a transfinite word, there exists a unique factorization in Lyndon words that are densely non-increasing, a…
This paper presents a framework based on matrices of monoids for the study of coupled cell networks. We formally prove within the proposed framework, that the set of results about invariant synchrony patterns for unweighted networks also…
A finitely generated module over the ring L=Z[t, t^{-1}] of integer Laurent polynomials that has no Z-torsion is determined by a pair of sub-lattices of L^d. Their indices are the absolute values of the leading and trailing coefficients of…
This paper presents a reduced-order model for the Reynolds equation for deformable structure and large displacements. It is based on the model established in [11] which is piece-wise linearized using two different methods. The advantages…
Braid combing is a procedure defined by Emil Artin to solve the word problem in braid groups for the first time. It is well-known to have exponential complexity. In this paper, we use the theory of straight line programs to give a…
Deciding the positivity of a sequence defined by a linear recurrence with polynomial coefficients and initial condition is difficult in general. Even in the case of recurrences with constant coefficients, it is known to be decidable only…
Sufficient and necessary conditions are established for controllability of affine control systems where the control is constrained to a set whose convex hull contains the origin but is not necessarily, in contrast with previously known…
The relationships between braid ordering and the geometry of its closure is studied. We prove that if an essential closed surface $F$ in the complements of closed braid has relatively small genus with respect to the Dehornoy floor of the…
We study the correspondence between Bayesian Networks and graphical representation of proofs in linear logic. The goal of this paper is threefold: to develop a proof-theoretical account of Bayesian inference (in the spirit of the…