Related papers: Unique Normal Forms in Infinitary Weakly Orthogona…
Rewriting techniques based on reduction orderings generate "just enough" consequences to retain first-order completeness. This is ideal for superposition-based first-order theorem proving, but for at least one approach to inductive…
We propose a new weak convergence theorem for martingales, under gentler conditions than the usual convergence in probability of the sequence of associated quadratic variations. Its proof requires the combined use of Skorohod's…
We consider extensions of the language of Peano arithmetic by transfinitely iterated truth definitions satisfying uniform Tarskian biconditionals. Without further axioms, such theories are known to be conservative extensions of the original…
We present a coinductive framework for defining infinitary analogues of equational reasoning and rewriting in a uniform way. We define the relation =^infty, notion of infinitary equational reasoning, and ->^infty, the standard notion of…
One way of studying a relational structure is to investigate functions which are related to that structure and which leave certain aspects of the structure invariant. Examples are the automorphism group, the self-embedding monoid, the…
We study strictly positive logics in the language $\mathscr{L}^+$, which constructs formulas from $\top$, propositional variables, conjunction, and diamond modalities. We begin with the base system $\bf K^+$, the strictly positive fragment…
We focus on the persistence principle over weak interpretability logic. Our object of study is the logic obtained by adding the persistence principle to weak interpretability logic from several perspectives. Firstly, we prove that this…
Singular or weak solutions of the incompressible Euler equations have been hypothesized to account for anomalous dissipation at very high Reynolds numbers and, in particular, to explain the d'Alembert paradox of non-vanishing drag. A…
A conformal restriction system is a commutative, associative, unital algebra equipped with a representation of the groupoid of univalent conformal maps on connected open sets of the Riemann sphere, and a family of linear functionals on…
An interesting observation is that most pairs of weakly homogeneous mappings have no strongly monotonic property, which is one of the key conditions to ensure the unique solvability of the generalized variational inequality. This paper…
Let $E$ be a Banach space such that $E'$ has the Radon-Nikod\'ym property. The aim of this work is to connect relative weak compactness in the $E$-valued martingale Hardy space $H^{1}(\mu,E)$ to a convex compactness criterion in a weaker…
In this paper, we prove the local converse theorem for split even special orthogonal groups over a non-Archimedean local field of characteristic zero. This is the only case left on local converse theorems of split classical groups and the…
We show that there exists an uniformly recurrent infinite word whose set of factors is closed under reversal and which has only finitely many palindromic factors.
Every absolutely summing linear operator is weakly compact. However, for strongly summing multilinear operators and polynomials - one of the most natural extensions of the linear case to the non linear framework - weak compactness does not…
Z. Zhou et al. proved that in a Teichm\"uller equivalence class, there exists an extremal quasiconformal mapping with a weakly non-decreasable dilatation. In this paper, we prove that in an infinitesimal equivalence class, there exists a…
We study the problem of fitting ontologies and constraints to positive and negative examples that take the form of a finite relational structure. As ontology and constraint languages, we consider the description logics $\mathcal{E\mkern-2mu…
Linear rules have played an increasing role in structural proof theory in recent years. It has been observed that the set of all sound linear inference rules in Boolean logic is already coNP-complete, i.e. that every Boolean tautology can…
We study infinite ternary words that contain few distinct palindromes. In particular, we classify such words according to their critical exponent.
We define term rewriting systems on the vertices and faces of nestohedra, and show that the former are confluent and terminating. While the associated posets on vertices generalize Barnard--McConville's flip order for graph-associahedra,…
Simple methods permit to generalize the concepts of iteration and of recursive processes. We shall see briefly on several examples what these methods generate. In additive sequences, we shall encounter not only the golden or the silver…