English
Related papers

Related papers: A duality theoretic view on limits of finite struc…

200 papers

We show that descriptive complexity's result extends in High Order Logic to capture the expressivity of Turing Machine which have a finite number of alternation and whose time or space is bounded by a finite tower of exponential. Hence we…

Logic in Computer Science · Computer Science 2014-07-16 Arthur Milchior

Categorical Universal Logic is a theory of monad-relativised hyperdoctrines (or fibred universal algebras), which in particular encompasses categorical forms of both first-order and higher-order quantum logics as well as classical,…

Quantum Physics · Physics 2014-12-31 Yoshihiro Maruyama

We consider a new kind of interpretation over relational structures: finite sets interpretations. Those interpretations are defined by weak monadic second-order (WMSO) formulas with free set variables. They transform a given structure into…

Logic in Computer Science · Computer Science 2017-01-11 Thomas Colcombet , Christof Löding

Canonical duality-triality is a breakthrough methodological theory, which can be used not only for modeling complex systems within a unified framework, but also for solving a wide class of challenging problems from real-world applications.…

Mathematical Physics · Physics 2014-11-27 David Y Gao , Ning Ruan , Vittorio Latorre

Homomorphism duality pairs play crucial role in the theory of relational structures and in the Constraint Satisfaction Problem. The case where both classes are finite is fully characterized. The case when both side are infinite seems to be…

Combinatorics · Mathematics 2015-06-04 Péter L. Erdős , Dömötör Pálvölgyi , Claude Tardif , Gábor Tardos

The partition functions of refined topological strings(A-models) are computed, which give rise to the circle-compactified five-dimensional supersymmetric linear quiver gauge theories in generic (not necessarily self-dual) Omega backgrounds.…

High Energy Physics - Theory · Physics 2012-11-30 Kei Ito

Algorithmic meta-theorems state that problems definable in a fixed logic can be solved efficiently on structures with certain properties. An example is Courcelle's Theorem, which states that all problems expressible in monadic second-order…

Logic in Computer Science · Computer Science 2025-01-09 Max Bannach , Markus Hecher

The complex organization of syntax in hierarchical structures is one of the core design features of human language. Duality of patterning refers for instance to the organization of the meaningful elements in a language at two distinct…

Physics and Society · Physics 2016-02-12 Vittorio Loreto , Pietro Gravino , Vito D. P. Servedio , Francesca Tria

We survey the use of continued fraction expansions in the algebraical and topological study of complex analytic singularities. We also prove new results, firstly concerning a geometric duality with respect to a lattice between plane…

Geometric Topology · Mathematics 2009-09-15 Patrick Popescu-Pampu

The web of dual gauge theories engineered from a class of toric Calabi-Yau threefolds is explored. In previous work, we have argued for a triality structure by compiling evidence for the fact that every such manifold $X_{N,M}$ (for given…

High Energy Physics - Theory · Physics 2018-12-05 Brice Bastian , Stefan Hohenegger , Amer Iqbal , Soo-Jong Rey

The dual of a map is a fundamental construction on combinatorial maps, but many other combinatorial objects also possess their notion of duality. For instance, the Tamari lattice is isomorphic to its order dual, which induces an involution…

Combinatorics · Mathematics 2017-11-16 Wenjie Fang

Structures based on polarities have been used to provide relational semantics for propositional logics that are modelled algebraically by non-distributive lattices with additional operators. This article develops a first order notion of…

Logic · Mathematics 2023-11-08 Robert Goldblatt

Ramsey theory looks for regularities in large objects. Model theory studies algebraic structures as models of theories. The structural Ramsey theory combines these two fields and is concerned with Ramsey-type questions about certain…

Combinatorics · Mathematics 2018-05-22 Matěj Konečný

We provide decidability and undecidability results on the model-checking problem for infinite tree structures. These tree structures are built from sequences of elements of infinite relational structures. More precisely, we deal with the…

Logic in Computer Science · Computer Science 2011-11-15 Alex Spelten , Wolfgang Thomas , Sarah Winter

We introduce a notion of the space of types in positive model theory based on Stone duality for distributive lattices. We show that this space closely mirrors the Stone space of types in the full first-order model theory with negation…

Logic · Mathematics 2019-06-12 Levon Haykazyan

Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we know: Any property of finite structures, which is expressible by…

Databases · Computer Science 2008-09-19 Georg Gottlob , Reinhard Pichler , Fang Wei

We identify and highlight certain landmark results in Samson Abramsky's work which we believe are fundamental to current developments and future trends. In particular, we focus on the use of (i) topological duality methods to solve problems…

Logic in Computer Science · Computer Science 2020-07-31 Mai Gehrke , Tomas Jakl , Luca Reggio

Following the RG flow of an N=1 quiver gauge theory and applying Seiberg duality whenever necessary defines a duality cascade, that in simple cases has been understood holographically. It has been argued that in certain cases, the dualities…

High Energy Physics - Theory · Physics 2009-11-10 Amihay Hanany , Johannes Walcher

Stone-type dualities provide a powerful mathematical framework for studying properties of logical systems. They have recently been fruitfully explored in understanding minimisation of various types of automata. In Bezhanishvili et al.…

Formal Languages and Automata Theory · Computer Science 2020-05-26 Nick Bezhanishvili , Marcello Bonsangue , Helle Hvid Hansen , Dexter Kozen , Clemens Kupke , Prakash Panangaden , Alexandra Silva

The choice of an isomorphism, a duality, between a finite abelian group $A$ and its character group allows one to define dual codes of additive codes over $A$. Properties of dualities and dual codes are studied, continuing work of Delsarte…

Information Theory · Computer Science 2026-01-07 Jay A. Wood
‹ Prev 1 3 4 5 6 7 10 Next ›