Related papers: Model-completeness for a dense linear order in wea…
This paper provides some evidence for conjectural relations between extensions of (right) weak order on Coxeter groups, closure operators on root systems, and Bruhat order. The conjecture focused upon here refines an earlier question as to…
This paper continues the author's previous study \cite{Kura20}, showing that several weak principles inspired by non-normal modal logic suffice to derive various refined forms of the second incompleteness theorem. Among the main results of…
Defining P* to be the complete lattice of upsets (ordered by reverse inclusion) of a poset P we give necessary and sufficient conditions on a subset S of P* for P to admit a meet-completion e from P to Q where e preserves the infimum of an…
A convergence theorem for martingales with c\`adl\`ag trajectories (right continuous with left limits everywhere) is obtained in the sense of the weak dual topology on Hilbert space, under conditions that are much weaker than those required…
We give a new proof of a version of Klein's theorem on the existence of absolutely continuous spectrum for the Anderson model on the Bethe Lattice at weak disorder.
We give a signed generalization of Laurent's theorem that characterizes feasible positive semidefinite matrix completion problems in terms of metric polytopes. Based on this result, we give a characterization of the maximum rank completions…
Model checking properties are often described by means of finite automata. Any particular such automaton divides the set of infinite trees into finitely many classes, according to which state has an infinite run. Building the full type…
In this paper we present sufficient conditions for the existence of heteroclinic or homoclinic solutions for second order coupled systems of differential equations on the real line. We point out that it is required only conditions on the…
A conjecture in algorithmic model theory predicts that the model-checking problem for first-order logic is fixed-parameter tractable on a hereditary graph class if and only if the class is monadically dependent. Originating in model theory,…
In conic linear programming -- in contrast to linear programming -- the Lagrange dual is not an exact dual: it may not attain its optimal value, or there may be a positive duality gap. The corresponding Farkas' lemma is also not exact (it…
We characterize well-founded algebraic lattices by means of forbidden subsemilattices of the join-semilattice made of their compact elements. More specifically, we show that an algebraic lattice $L$ is well-founded if and only if $K(L)$,…
The Lebesgue property (order-continuity) of a monotone convex function on a solid vector space of measurable functions is characterized in terms of (1) the weak inf-compactness of the conjugate function on the order-continuous dual space,…
The main result of the paper is on the continuity of weak solutions of infinitely degenerate quasilinear second order equations. Namely, we show that every weak solution to a certain class of degenerate quasilinear equations is continuous.…
The weakly relational domain of Octagons offers a decent compromise between precision and efficiency for numerical properties. Here, we are concerned with the construction of non-numerical relational domains. We provide a general…
We study various formulations of the completeness of first-order logic phrased in constructive type theory and mechanised in the Coq proof assistant. Specifically, we examine the completeness of variants of classical and intuitionistic…
We consider the termination/non-termination property of a class of loops. Such loops are commonly used abstractions of real program pieces. Second-order logic is a convenient language to express non-termination. Of course, such property is…
This paper provides a full characterization for when the expansion of a complete o-minimal theory by a unary predicate that picks out a divisible dense and codense subgroup has a model companion. This result is motivated by criteria and…
We continue developing the theory around the twin-width of totally ordered binary structures, initiated in the previous paper of the series. We first introduce the notion of parity and linear minors of a matrix, which consists of…
We show that the solid hull of every weakly precompact set of a Banach lattice $E$ is weakly precompact if and only if every order interval in $E$ is weakly precompact, or equivalently, if and only if every disjoint weakly compact set is…
We propose a general framework to study constructions of Euclidean lattices from linear codes over finite fields. In particular, we prove general conditions for an ensemble constructed using linear codes to contain dense lattices (i.e.,…