Related papers: Generalized Hex and logical characterizations of p…
We develop a topological approach to prove the generalized Lax conjecture using the fact that determinants of sufficiently big symmetric linear pencils are able to express the rigidly convex sets of RZ polynomials of any degree $d$.…
We extend the notion of localic completion of generalised metric spaces by Steven Vickers to the setting of generalised uniform spaces. A generalised uniform space (gus) is a set X equipped with a family of generalised metrics on X, where a…
This paper investigates how global decision problems over arithmetically represented domains acquire reflective structure through class-quantification. Arithmetization forces diagonal fixed points whose verification requires reflection…
We develop a framework that systematically casts the solvability and uniqueness conditions of linearized geometric boundary-value problems into cohomological terms. The theory is designed to be applicable without assumptions on the…
We consider the standard quantum logic ${\mathcal L}(H)$ associated to a complex Hilbert space $H$, i.e. the lattice of closed subspaces of $H$ together with the orthogonal complementation. The orthogonality and compatibility relations are…
This paper addresses some fundamental issues in nonconvex analysis. By using pure complementary energy principle proposed by the author, a class of fully nonlinear partial diforerential equations in nonlinear elasticity is able to converted…
We propose a fragment of many-sorted second order logic called EQSMT and show that checking satisfiability of sentences in this fragment is decidable. EQSMT formulae have an $\exists^*\forall^*$ quantifier prefix (over variables, functions…
If X is the complement of a hypersurface in P^n, then Kohno showed that the nilpotent completion of the fundamental group is isomorphic to the nilpotent completion of the holonomy Lie algebra of X. When X is the complement of a hyperplane…
A generalisation of Scott's information systems \cite{sco82} is presented that captures exactly all L-domains. The global consistency predicate in Scott's definition is relativised in such a way that there is a consistency predicate for…
Gleason's theorem [A. Gleason, J. Math. Mech., \textbf{6}, 885 (1957)] is an important result in the foundations of quantum mechanics, where it justifies the Born rule as a mathematical consequence of the quantum formalism. Formally, it…
We consider elliptic problems with nonclassical boundary conditions that contain additional unknown functions on the border of the domain of the elliptic equation and also contain boundary operators of higher orders with respect to the…
Argumentation frameworks ($AF$s) have been extensively developed, but existing higher-order bipolar $AF$s suffer from critical limitations: attackers and supporters are restricted to arguments, multi-valued and fuzzy semantics lack unified…
A generalized notion of higher order nonclassicality (in terms of higher order moments) is introduced. Under this generalized framework of higher order nonclassicality, conditions of higher order squeezing and higher order subpoissonian…
In a class of inner product H\"ormander spaces, we investigate a general elliptic problem for which the maximum of orders of boundary conditions is grater than or equal to the order of elliptic equation. The order of regularity for these…
Efficient algorithms for many problems in optimization and computational algebra often arise from casting them as systems of polynomial equations. Blum, Shub, and Smale formalized this as Hilbert's Nullstellensatz Problem $HN_R$: given…
We show that for any $i > 0$, it is decidable, given a regular language, whether it is expressible in the $\Sigma_i[<]$ fragment of first-order logic FO[<]. This settles a question open since 1971. Our main technical result relies on the…
We study extensions of expressive decidable fragments of first-order logic with circumscription, in particular the two-variable fragment FO$^2$, its extension C$^2$ with counting quantifiers, and the guarded fragment GF. We prove that if…
We study the fluted fragment of first-order logic which is often viewed as a multi-variable non-guarded extension to various systems of description logics lacking role-inverses. In this paper we show that satisfiable fluted sentences (even…
Higher-order unification has been shown to be undecidable. Miller discovered the pattern fragment and subsequently showed that higher-order pattern unification is decidable and has most general unifiers. We extend the algorithm to…
An arrangement of hyperplanes is a finite collection of hyperplanes in a real Euclidean space. To such a collection one associates the characteristic polynomial that encodes the combinatorics of intersections of the hyperplanes. Finding the…