English
Related papers

Related papers: Multidimensional tilings and MSO logic

200 papers

We consider two-variable first-order logic FO2 over infinite words. Restricting the number of nested negations defines an infinite hierarchy; its levels are often called the half-levels of the FO2 quantifier alternation hierarchy. For every…

Formal Languages and Automata Theory · Computer Science 2020-12-03 Viktor Henriksson , Manfred Kufleitner

In the framework of computable queries in Database Theory, there are many examples of queries to (properties of) relational database instances that can be expressed by simple and elegant third order logic ($\mathrm{TO}$) formulae. In many…

Logic in Computer Science · Computer Science 2016-12-12 Flavio Ferrarotti , Loredana Tec , José María Turull-Torres

We present constructions of countable two-dimensional subshifts of finite type (SFTs) with interesting properties. Our main focus is on properties of the topological derivatives and subpattern posets of these objects. We present a countable…

Dynamical Systems · Mathematics 2013-10-03 Ville Salo , Ilkka Törmä

An important result in tilting theory states that a class of modules over a ring is a tilting class if and only if it is the Ext-orthogonal class to a set of compact modules of bounded projective dimension. Moreover, cotilting classes are…

Representation Theory · Mathematics 2017-04-24 Frederik Marks , Jorge Vitória

Discrete optimisation problems arise in many different areas and are studied under many different names. In many such problems the quantity to be optimised can be expressed as a sum of functions of a restricted form. Here we present a…

Computational Complexity · Computer Science 2015-03-20 David A. Cohen , Martin C. Cooper , Paidi Creed , Peter G. Jeavons , Stanislav Zivny

We present the stellar resolution, a "flexible" tile system based on Robinson's first-order resolution. After establishing formal definitions and basic properties of the stellar resolution, we show its Turing-completeness and to illustrate…

Logic in Computer Science · Computer Science 2022-07-19 Boris Eng , Thomas Seiller

We classify the simple infinite dimensional integrable modules with finite dimensional weight spaces over the quantized enveloping algebra of an untwisted affine algebra. We prove that these are either highest (lowest) weight integrable…

Quantum Algebra · Mathematics 2007-05-23 Vyjayanthi Chari , Jacob Greenstein

We construct and classify, in the case of two complex dimensions, the possible tangent cones at points of limit spaces of non-collapsed sequences of K\"ahler-Einstein metrics with cone singularities.

Differential Geometry · Mathematics 2021-10-26 Martin de Borbon

We introduce a finite-dimensional algebra that controls the possible boundary conditions of a conformal field theory. For theories that are obtained by modding out a Z_2 symmetry (corresponding to a so-called D_odd-type, or half-integer…

High Energy Physics - Theory · Physics 2009-10-30 J. Fuchs , C. Schweigert

Lie symmetries of systems of second-order linear ordinary differential equations with constant coefficients are exhaustively described over both the complex and real fields. The exact lower and upper bounds for the dimensions of the maximal…

Classical Analysis and ODEs · Mathematics 2014-03-25 Vyacheslav M. Boyko , Roman O. Popovych , Nataliya M. Shapoval

In this paper we study finite higher-dimensional automata (HDAs) from the logical point of view. Languages of HDAs are sets of finite bounded-width interval pomsets with interfaces (iiPoms<=k) closed under order extension. We prove that…

Formal Languages and Automata Theory · Computer Science 2024-03-29 Amazigh Amrane , Hugo Bazille , Uli Fahrenberg , Marie Fortin

The convenient setting for smooth mappings, holomorphic mappings, and real analytic mappings in infinite dimension is sketched. Infinite dimensional manifolds are discussed with special emphasis on smooth partitions of unity and tangent…

Differential Geometry · Mathematics 2016-09-06 Andreas Kriegl , Peter W. Michor

We consider the problem of deciding the satisfiability of quantifier-free formulas in the theory of finite sets with cardinality constraints. Sets are a common high-level data structure used in programming; thus, such a theory is useful for…

Logic in Computer Science · Computer Science 2023-06-22 Kshitij Bansal , Clark Barrett , Andrew Reynolds , Cesare Tinelli

We present a simple way of separating the overlap between the soft and collinear factorization formulae of QCD squared matrix elements. We check its validity explicitly for single and double unresolved emissions of tree-level processes. The…

High Energy Physics - Phenomenology · Physics 2007-05-23 Zoltan Nagy , Gabor Somogyi , Zoltan Trocsanyi

We describe the layer of quantifier alternation depth at most one of the quantifier completion of a Boolean doctrine over a small category. This amounts to a doctrinal version of Herbrand's theorem for formulas with quantifier alternation…

Logic · Mathematics 2025-10-31 Marco Abbadini , Francesca Guffanti

Weighted monadic second-order logic is a weighted extension of monadic second-order logic that captures exactly the behaviour of weighted automata. Its semantics is parameterized with respect to a semiring on which the values that weighted…

Logic in Computer Science · Computer Science 2021-04-30 Antonis Achilleos , Mathias Ruggaard Pedersen

A previous article was devoted to an analysis of the symmetry properties of a class of first-order delay ordinary differential systems (DODSs). Here we concentrate on linear DODSs. They have infinite-dimensional Lie point symmetry groups…

Mathematical Physics · Physics 2018-05-09 Vladimir A. Dorodnitsyn , Roman Kozlov , Sergey V. Meleshko , Pavel Winternitz

Self-similar binary one-dimensional (1D) quasilattices (QLs) are classified into mutual local-derivability (MLD) classes. It is shown that the MLD classification is closely related to the number-theoretical classification of parameters…

Condensed Matter · Physics 2009-11-07 Masashi Torikai , Komajiro Niizeki , Takashi Odagaki

In continuous logic, there are plenty of examples of interesting stable metric structures. However, on the other side of the SOP line, there are only a few metric structures where order is relevant, and orders often appear in different…

Logic · Mathematics 2025-10-15 Aaron Anderson , Diego Bejarano

This paper classifies the complexity of various teaching models by their position in the arithmetical hierarchy. In particular, we determine the arithmetical complexity of the index sets of the following classes: (1) the class of uniformly…

Logic · Mathematics 2016-10-28 Achilles A. Beros , Ziyuan Gao , Sandra Zilles