English
Related papers

Related papers: Constructibility real degrees in the side-by-side …

200 papers

We give a characterization of the strong degrees of categoricity of computable structures greater or equal to $\mathbf 0''$. They are precisely the \emph{treeable} degrees -- the least degrees of paths through computable trees -- that…

Logic · Mathematics 2023-05-12 Barbara F. Csima , Dino Rossegger

The present thesis studies structural properties of non-crossing partitions associated to finite Coxeter groups from both algebraic and geometric perspectives. On the one hand, non-crossing partitions are lattices, and on the other hand, we…

Combinatorics · Mathematics 2019-03-18 Julia Heller

We continue the development of the theory of construction schemes over $\omega_1$ as introduced by the third author by studying their relation with forcing axioms. Formally, we introduce the cardinals $\mathfrak{m}^n_{\mathcal{F}}$ and use…

Logic · Mathematics 2025-09-03 Jorge Antonio Cruz Chapital , Osvaldo Guzman , Stevo Todorcevic

The inverse problem of designing component interactions to target emergent structure is fundamental to numerous applications in biotechnology, materials science, and statistical physics. Equally important is the inverse problem of designing…

Computational Physics · Physics 2020-11-20 Carl P. Goodrich , Ella M. King , Samuel S. Schoenholz , Ekin D. Cubuk , Michael Brenner

This dissertation is a contribution to the project of second-order set theory, which has seen a revival in recent years. The approach is to understand second-order set theory by studying the structure of models of second-order set theories.…

Logic · Mathematics 2018-04-26 Kameryn J Williams

Following the types-as-sets paradigm, we present a mechanized embedding of dependent function types with a hierarchy of universes into schematic first-order logic with equality, with axiom schemas of Tarski-Grothendieck set theory. We carry…

Logic in Computer Science · Computer Science 2026-03-16 Yunsong Yang , Simon Guilloud , Viktor Kunčak

We study the problem of checking whether an existential sentence (that is, a first-order sentence in prefix form built using existential quantifiers and all Boolean connectives) is true in a finite partially ordered set (in short, a poset).…

Logic in Computer Science · Computer Science 2014-05-13 Simone Bova , Robert Ganian , Stefan Szeider

In this paper, we revisit the problem of classifying real algebraic and semialgebraic sets by their topological types, focusing on establishing the effectiveness of bounds rather than deriving new quantitative estimates. Building on Hardt's…

Algebraic Geometry · Mathematics 2024-12-24 Kartoue Mady Demdah , Ibrahim Nonkane

We construct a metrizable semitopological semilattice $X$ whose partial order $P=\{(x,y)\in X\times X:xy=x\}$ is a non-closed dense subset of $X\times X$. As a by-product we find necessary and sufficient conditions for the existence of a…

General Topology · Mathematics 2021-11-01 Taras Banakh , Serhii Bardyla , Alex Ravsky

We consider the direct product of two symplectomorphisms, one of which exhibits a basic set and the other one a non-degenerate elliptic equilibrium. Under a domination condition we show that a broad class of real-analytic deformations of…

Dynamical Systems · Mathematics 2026-05-18 Jaime Paradela

In this paper, we are interested in solvable complete Lie algebras, over the field $\K=\R$ or $\mathbb{C}$, which admit a symplectic structure. Specifically, important classes are studied, and a description of complete Lie Algebra with the…

Differential Geometry · Mathematics 2024-07-01 M. Benyoussef , M. W. Mansouri , SM. Sbai

We present sufficient conditions for exact controllability of a semilinear infinite dimensional dynamical system. The system mild solution is formed by a noncompact semigroup and a nonlinear disturbance that does not need to be Lipschitz…

Functional Analysis · Mathematics 2018-04-02 Radoslaw Zawiski

We study combinatorial configurations with the associated point and line graphs being strongly regular. Examples not belonging to known classes such as partial geometries and their generalizations or elliptic semiplanes are constructed.…

Combinatorics · Mathematics 2025-09-30 Marién Abreu , Martin Funk , Vedran Krčadinac , Domenico Labbate

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ä

A lifting of a semilattice S is an algebra A such that the semilattice of compact (=finitely generated) congruences of A is isomorphic to S. The aim of this work is to give a categorical theory of partial algebras endowed with a partial…

Category Theory · Mathematics 2010-12-10 Pierre Gillibert

We confirm the quasi-projective case of Saito's conjecture, namely that the cohomological characteristic classes defined by Abbes and Saito can be computed in terms of the characteristic cycles. We construct a cohomological characteristic…

Algebraic Geometry · Mathematics 2025-02-18 Enlin Yang , Yigeng Zhao

This paper develops a theory of colimit sketches "with constructions" in higher category theory, formalising the input to the ubiquitous procedure of adjoining specified "constructible" colimits to a category such that specified "relation"…

Category Theory · Mathematics 2021-11-25 Andrew W. Macpherson

For which (first-order complete, usually countable) $T$ do there exist non-isomorphic models of $T$ which become isomorphic after forcing with a forcing notion $\mathbb{P}$? Necessarily, $\mathbb{P}$ is non-trivial; i.e.~it adds some new…

Logic · Mathematics 2025-07-03 Saharon Shelah

By operations on models we show how to relate completeness with respect to permissive-nominal models to completeness with respect to nominal models with finite support. Models with finite support are a special case of permissive-nominal…

Logic in Computer Science · Computer Science 2013-05-28 Murdoch J. Gabbay

Let $G$ be a non-compact semisimple Lie group with finite centre and finitely many components. We show that any finitely generated group $\Gamma$ which is quasi-isometric to an irreducible lattice in $G$ has the $R_\infty$-property, namely,…

Group Theory · Mathematics 2018-01-09 T. Mubeena , P. Sankaran