English
Related papers

Related papers: Subshifts as Models for MSO Logic

200 papers

Fiore and Hur recently introduced a conservative extension of universal algebra and equational logic from first to second order. Second-order universal algebra and second-order equational logic respectively provide a model theory and a…

Logic in Computer Science · Computer Science 2013-08-27 Marcelo Fiore , Ola Mahmoud

The classifying topos of a geometric theory is a topos such that geometric morphisms into it correspond to models of that theory. We study classifying toposes for different infinitary logics: first-order, sub-first-order (i.e. geometric…

Category Theory · Mathematics 2023-12-20 Mark Kamsma

Large language models (LLMs) have shown an impressive ability to perform tasks believed to require thought processes. When the model does not document an explicit thought process, it becomes difficult to understand the processes occurring…

Computation and Language · Computer Science 2024-06-21 Yuval Shalev , Amir Feder , Ariel Goldstein

We suggest an ordering for the predicates in continuous logic so that the semantics of continuous logic can be formulated as a hyperdoctrine. We show that this hyperdoctrine can be embedded into the hyperdoctrine of subobjects of a suitable…

Logic · Mathematics 2021-07-23 Daniel Figueroa , Benno van den Berg

We present a new method, the Subdivision Construction, for proving the finite model property (the fmp) for broad classes of modal logics and modal rule systems. The construction builds on the framework of stable canonical rules, and…

Logic · Mathematics 2026-05-13 Tenyo Takahashi

The classical Domino problem asks whether there exists a tiling in which none of the forbidden patterns given as input appear. In this paper, we consider the aperiodic version of the Domino problem: given as input a family of forbidden…

Discrete Mathematics · Computer Science 2022-02-16 Antonin Callard , Benjamin Hellouin de Menibus

Weighted automata are non-deterministic automata where the transitions are equipped with weights. They can model quantitative aspects of systems like costs or energy consumption. The value of a run can be computed, for example, as the…

Logic in Computer Science · Computer Science 2015-06-22 Manfred Droste , Vitaly Perevoshchikov

In this work we provide algorithmic solutions to five fundamental problems concerning the verification, synthesis and correction of concurrent systems that can be modeled by bounded p/t-nets. We express concurrency via partial orders and…

Logic in Computer Science · Computer Science 2014-02-14 Mateus de Oliveira Oliveira

We compute the rational homology of the moduli stack $\mathcal{M}$ of objects in the derived category of certain smooth complex projective varieties $X$ including toric varieties, flag varieties, curves, surfaces, and some 3- and 4-folds.…

Algebraic Geometry · Mathematics 2020-08-17 Jacob Gross

This expository paper explores the interaction of group ordering with topological questions, especially in dimensions 2 and 3. Among the topics considered are surfaces, braid groups, 3-manifolds and their structures such as foliations and…

Algebraic Topology · Mathematics 2014-03-20 Dale Rolfsen

We explore the possibilities for elementary embeddings $j : M \to N$, where $M$ and $N$ are models of ZFC with the same ordinals, $M \subseteq N$, and $N$ has access to large pieces of $j$. We construct commuting systems of such maps…

Logic · Mathematics 2023-03-27 Monroe Eskew , Sy-David Friedman

In this paper we study the directions of periodicity of three-dimensional subshifts of finite type (SFTs) and in particular their slopes. A configuration of a subshift has a slope of periodicity if it is periodic in exactly one direction,…

Discrete Mathematics · Computer Science 2018-06-20 Etienne Moutot , Pascal Vanier

Sub-sub-intuitionistic logic is obtained from intuitionistic logic by weakening the implication and removing distributivity. It can alternatively be viewed as conditional weak positive logic. We provide semantics for sub-sub-intuitionistic…

Logic · Mathematics 2024-08-23 Jonte Deakin , Jim de Groot

Human perception of the empirical world involves recognizing the diverse appearances, or 'modalities', of underlying objects. Despite the longstanding consideration of this perspective in philosophy and cognitive science, the study of…

Machine Learning · Computer Science 2023-12-19 Zhou Lu

We establish a formal connection between algorithmic correspondence theory and certain dual characterization results for finite lattices, similar to Nation's characterization of a hierarchy of pseudovarieties of finite lattices,…

Logic · Mathematics 2014-08-11 Sabine Frittella , Alessandra Palmigiano , Luigi Santocanale

Research on information extraction from Web pages (wrapping) has seen much activity recently (particularly systems implementations), but little work has been done on formally studying the expressiveness of the formalisms proposed or on the…

Databases · Computer Science 2007-05-23 Georg Gottlob , Christoph Koch

Motivic characteristic classes of possibly singular algebraic varieties are homology class versions of motivic characteristics, not classes in the so-called motivic (co)homology. This paper is a survey on them with more emphasis on…

Algebraic Geometry · Mathematics 2011-10-06 Shoji Yokura

The polylogarithmic time hierarchy structures sub-linear time complexity. In recent work it was shown that all classes $\tilde{\Sigma}_{m}^{\mathit{plog}}$ or $\tilde{\Pi}_{m}^{\mathit{plog}}$ ($m \in \mathbb{N}$) in this hierarchy can be…

Computational Complexity · Computer Science 2019-12-02 Flavio Ferrarotti , Senén González , Klaus-Dieter Schewe , José María Turull-Torres

The paper concerns the second-order generalized differentiation theory of variational analysis and new applications of this theory to some problems of constrained optimization in finitedimensional spaces. The main attention is paid to the…

Optimization and Control · Mathematics 2011-10-21 B. S. Mordukhovich , R. T. Rockafellar

In this paper we are interested in computability aspects of subshifts and in particular Turing degrees of 2-dimensional SFTs (i.e. tilings). To be more precise, we prove that given any \pizu subset $P$ of $\{0,1\}^\NN$ there is a SFT $X$…

Computational Complexity · Computer Science 2012-06-04 Emmanuel Jeandel , Pascal Vanier
‹ Prev 1 8 9 10 Next ›