English
Related papers

Related papers: Preservation under Substructures modulo Bounded Co…

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

This paper investigates the interplay between properties of a topological space $X$, in particular of its natural order, and properties of the lax comma category $\mathsf{Top} \Downarrow X$, where $\mathsf{Top}$ denotes the category of…

Category Theory · Mathematics 2025-12-09 Maria Manuel Clementino , Dirk Hofmann , Rui Prezado

We consider extensions of the language of Peano arithmetic by transfinitely iterated truth definitions satisfying uniform Tarskian biconditionals. Without further axioms, such theories are known to be conservative extensions of the original…

Logic · Mathematics 2019-10-31 Lev D. Beklemishev , Fedor N. Pakhomov

We study possibilities of preservations for properties, their links and related connections between semantic and syntactic ones, both in general and as characterizations for subalgebras, congruence relations, Henkin construction,…

Logic · Mathematics 2025-09-29 Temurboy E. Rajabov , Sergey V. Sudoplatov

We give a self-contained proof of the preservation theorem for proper countable support iterations known as "tools-preservation," "Case A" or "first preservation theorem" in the literature. We do not assume that the forcings add reals.

Logic · Mathematics 2015-09-07 Martin Goldstern , Jakob Kellner

From the work of Bauer and Lesnick, it is known that there is no functor from the category of pointwise finite-dimensional persistence modules to the category of barcodes and overlap matchings. In this work, we introduce sub-barcodes and…

Computational Geometry · Computer Science 2025-04-15 Oliver A. Chubet , Kirk P. Gardner , Donald R. Sheehy

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…

Logic in Computer Science · Computer Science 2017-03-08 Lidia Tendera

We consider the minimization property of a Gagliardo-Slobodeckij seminorm which can be seen as the fractional counterpart of the classical problem of functions of least gradient and which is related to the minimization of the nonlocal…

Analysis of PDEs · Mathematics 2024-07-30 Claudia Bucur , Serena Dipierro , Luca Lombardini , Enrico Valdinoci

L-modules are a combinatorial analogue of constructible sheaves on the reductive Borel-Serre compactification of a locally symmetric space. We define the micro-support of an L-module; it is a set of irreducible modules for the Levi…

Representation Theory · Mathematics 2007-05-23 Leslie Saper

This paper introduces an abstract notion of fragments of monadic second-order logic. This concept is based on purely syntactic closure properties. We show that over finite words, every logical fragment defines a lattice of languages with…

Formal Languages and Automata Theory · Computer Science 2015-03-20 Manfred Kufleitner , Alexander Lauser

We propose the notions of uniform local weak o-minimality and $*$-local weak o-minimality. Local monotonicity theorems hold in definably complete locally o-minimal structures and uniformly locally o-minimal structures of the second kind. In…

Logic · Mathematics 2024-05-13 Masato Fujita

Let ${\cal E}$ be a Dirichlet form on $L_2(X)$ and $\Omega$ an open subset of $X$. Then one can define Dirichlet forms ${\cal E}_D$, or ${\cal E}_N$, corresponding to ${\cal E}$ but with Dirichlet, or Neumann, boundary conditions imposed on…

Analysis of PDEs · Mathematics 2009-04-01 A. F. M. ter Elst , Derek W. Robinson

We prove that if a separable II$_1$ factor $M$ is existentially closed, then every $M$-bimodule is weakly contained in the trivial $M$-bimodule, $\text{L}^2(M)$, and, equivalently, every normal completely positive map on $M$ is a pointwise…

Operator Algebras · Mathematics 2023-08-25 Adrian Ioana , Hui Tan

We ask, when is a property of a model a logical property? According to the so-called Tarski-Sher criterion this is the case when the property is preserved by isomorphisms. We relate this to model-theoretic characteristics of abstract logics…

Logic · Mathematics 2021-07-13 Juliette Kennedy , Jouko Väänänen

We define the spaces of Schwartz functions, tempered functions and tempered distributions on manifolds definable in polynomially bounded o-minimal structures. We show that all the classical properties that these spaces have in the Nash…

Representation Theory · Mathematics 2020-03-12 Ary Shaviv

We present the classical theory of preservation of $\sqsubset$-unbounded families in generic extensions by ccc posets, where $\sqsubset$ is a definable relation of certain type on spaces of real numbers, typically associated with some…

Logic · Mathematics 2015-01-16 Diego Alejandro Mejía

We state and prove a stratification result that allows us to classify the tensor ideal localizing subcategories for the stable module category $\text{Stab}(\mathcal{C}_{(\mathfrak{g}, \mathfrak{g}_{\bar 0})})$ of Lie superalgbera…

Representation Theory · Mathematics 2025-03-19 Matthew H. Hamil

We first show that the projection image of a discrete definable set is again discrete for an arbitrary definably complete locally o-minimal structure. This fact together with the results in a previous paper implies tame dimension theory and…

Logic · Mathematics 2022-10-07 Masato Fujita , Tomohiro Kawakami , Wataru Komine

We study a new extension of the weak MSO logic, talking about boundedness. Instead of a previously considered quantifier U, expressing the fact that there exist arbitrarily large finite sets satisfying a given property, we consider a…

Logic in Computer Science · Computer Science 2023-11-29 Anita Badyl , Paweł Parys

I prove preservation theorems for countable support iteration of proper forcing concerning certain classes of capacities and submeasures. New examples of forcing notions and connections with measure theory are included.

Logic · Mathematics 2007-05-23 Jindrich Zapletal
‹ Prev 1 3 4 5 6 7 10 Next ›