Related papers: Model-completeness for a dense linear order in wea…
Given a lattice $\Lambda$ in a locally compact abelian group $G$ and a measurable subset $\Omega$ with finite and positive measure, then the set of characters associated to the dual lattice form a frame for $L^2(\Omega)$ if and only if the…
Recent developments of high-order CCM have been to extend existing formalism and codes to $s \ge \frac 12$ for both the ground and excited states, and independently to "generalised" expectation values for a wide range of one- and two-body…
We consider bisimulation-invariant monadic second-order logic over various classes of finite transition systems. We present several combinatorial characterisations of when the expressive power of this fragment coincides with that of the…
Over the past two decades several fragments of first-order logic have been identified and shown to have good computational and algorithmic properties, to a great extent as a result of appropriately describing the image of the standard…
The primary purpose of this article is to show that a certain natural set of axioms yields a completeness result for continuous first-order logic. In particular, we show that in continuous first-order logic a set of formulae is (completely)…
Definitions of dense linear orders (with/without endpoints), separable linear orders, complete linear orders, the countable chain condition for linear orders, a Suslin line/Suslin tree and Suslin's problem Statement and proof of Cantor's…
In this paper we describe an approach to constraint-based syntactic theories in terms of finite tree automata. The solutions to constraints expressed in weak monadic second order (MSO) logic are represented by tree automata recognizing the…
Building on ideas of Gurevich and Shelah for the G\"odel Class, we present a new probabilistic proof of the finite model property for the Guarded Fragment of First-Order Logic. Our proof is conceptually simple and yields the optimal…
We show that, for an arrangement of subspaces in a complex vector space with geometric intersection lattice, the complement of the arrangement is formal. We prove that the Morgan rational model for such an arrangement complement is formal…
We study the two-dimensional Wess-Zumino model with extended N=2 supersymmetry on the lattice. The lattice prescription we choose has the merit of preserving {\it exactly} a single supersymmetric invariance at finite lattice spacing $a$.…
This thesis deals with the specification and construction of syntax and operational semantics of a programming language. We work with a general notion of signature for specifying objects of a given category as initial objects in a suitable…
We show how to construct lattice sigma models in one, two and four dimensions which exhibit an exact fermionic symmetry. These models are discretized and {\it twisted} versions of conventional supersymmetric sigma models with N=2…
Given a special biserial algebra $\Lambda$ over an algebraically closed field, let $\mathrm{rad}_\Lambda$ denote the radical of its module category. The authors showed with Sinha that the stable rank of a special biserial algebra $\Lambda$,…
We classify the weak*-closed maximal left ideals of the measure algebra $M(G)$ for certain Hermitian locally compact groups $G$ in terms of the irreducible representations of $G$ and their asymptotic properties. In particular, we obtain a…
In this work we study a weak order ideal associated with the coset leaders of a non-binary linear code. This set allows the incrementally computation of the coset leaders and the definitions of the set of leader codewords. This set of…
This note points out a lemma on closures of monotonic increasing functions and shows how it is applicable to decomposition and modularity for semantics defined as the least fixedpoint of some monotonic function. In particular it applies to…
We prove decidability of the boundedness problem for monadic least fixed-point recursion based on positive monadic second-order (MSO) formulae over trees. Given an MSO-formula phi(X,x) that is positive in X, it is decidable whether the…
An alternative proof of Lie's approach for linearization of scalar second order ODEs is derived using the relationship between $\lambda$-symmetries and first integrals. This relation further leads to a new $\lambda$-symmetry linearization…
Most recent results in matrix completion assume that the matrix under consideration is low-rank or that the columns are in a union of low-rank subspaces. In real-world settings, however, the linear structure underlying these models is…
A Lattice is a partially ordered set where both least upper bound and greatest lower bound of any pair of elements are unique and exist within the set. K\"{o}tter and Kschischang proved that codes in the linear lattice can be used for error…