English
Related papers

Related papers: Ordinal Compactness

200 papers

We show how to use topological ideas, such as compactness, to establish orderability properties of infinite groups. A new application is to provide a left-ordering for the group of PL homeomorphisms of a connected surface with boundary…

Group Theory · Mathematics 2014-03-20 Dale Rolfsen

In this paper we are going to discuss compactness in Lorentz sequence spaces. Firstly, it will be shown how to define such a space, check whether a sequence belongs to it and calculate its norm. Equipped with this knowledge, we will proceed…

Functional Analysis · Mathematics 2024-06-17 Paweł Sawicki

In this paper, we present a constructive generalization of metric and uniform spaces by introducing a new class of spaces, called cover spaces. These spaces form a topological concrete category with a full reflective subcategory of complete…

General Topology · Mathematics 2024-12-31 Valery Isaev

We define a natural compactification of an arrangement complement in a ball quotient. We show that when this complement has a moduli space interpretation, then this compactification is often one that appears naturally by means of geometric…

Algebraic Geometry · Mathematics 2007-05-23 Eduard Looijenga

The purpose of this paper is to provide tools for analyzing the compactness of sequences in Sobolev spaces, in particular if the sequence gets mapped onto a compact set by some nonlinear operator. Here, our focus lies on a very general…

Analysis of PDEs · Mathematics 2007-11-07 Stefan Krömer , Markus Lilli

We study the influence of the existence of large cardinals on the existence of wellorderings of power sets of infinite cardinals $\kappa$ with the property that the collection of all initial segments of the wellordering is definable by a…

Logic · Mathematics 2017-04-04 Philipp Lücke , Philipp Schlicht

We will give an overview of four families of cardinal characteristics defined on subspaces $\prod_{\alpha\in\kappa}b(\alpha)$ of the generalised Baire space ${}^\kappa\kappa$, where $\kappa$ is strongly inaccessible and…

Logic · Mathematics 2025-03-17 Tristan van der Vlugt

Caucal hierarchy is a well-known class of graphs with decidable monadic theories. It were proved by L. Braud and A. Carayol that well-orderings in the hierarchy are the well-orderings with order types less than $\varepsilon_0$. Naturally,…

Logic · Mathematics 2015-12-17 Fedor Pakhomov

The paper introduces the notion of the size of countable sets that preserves the Part-Whole Principle and generalizes the notion of the cardinality of finite sets. The sizes of natural numbers, integers, rational numbers, and all their…

Logic · Mathematics 2023-12-19 Kateřina Trlifajová

The simplest toroidally compactified string theories exhibit a duality between large and small radii: compactification on a circle, for example, is invariant under R goes to 1/R. Compactification on more general Lorentzian lattices (i.e.…

High Energy Physics - Theory · Physics 2010-11-01 Eva Silverstein

The concept of quantization consists in replacing commutative quantities by noncommutative ones. In mathematical language an algebra of continuous functions on a locally compact topological space is replaced with a noncommutative…

Operator Algebras · Mathematics 2018-02-13 Petr Ivankov

An archetypal problem discussed in computer science is the problem of searching for a given number in a given set of numbers. Other than sequential search, the classic solution is to sort the list of numbers and then apply binary search.…

Computational Complexity · Computer Science 2015-03-20 Philon Nguyen

We prove that any definable family of subsets of a definable infinite set $A$ in an o-minimal structure has cardinality at most $|A|$. We derive some consequences in terms of counting definable types and existence of definable topological…

Logic · Mathematics 2023-06-05 Pablo Andújar Guerrero

An abstract framework of canonical inference is used to explore how different proof orderings induce different variants of saturation and completeness. Notions like completion, paramodulation, saturation, redundancy elimination, and…

Logic in Computer Science · Computer Science 2015-02-11 Maria Paola Bonacina , Nachum Dershowitz

Based on the class of epsilon numbers, another binary relational <^1 in the ordinals is introduced. We will see that we can easily describe all the isomorphisms that are witnesses of <^1. Afterwards we will show that the isomorphisms…

Logic · Mathematics 2013-09-20 Parménides García Cornejo

If $\mathcal P$ is a family of filters over some set $I$, a topological space $X$ is \emph{sequencewise $\mathcal P$-\brfrt compact} if, for every $I$-indexed sequence of elements of $X$, there is $F \in \mathcal P$ such that the sequence…

General Topology · Mathematics 2016-08-30 Paolo Lipparini

We construct a variety of inner models exhibiting features usually obtained by forcing over universes with large cardinals. For example, if there is a supercompact cardinal, then there is an inner model with a Laver indestructible…

Logic · Mathematics 2011-11-04 Arthur Apter , Victoria Gitman , Joel David Hamkins

This is the second combinatorial proof of the compactness theorem for singular from 1977. In fact it gives a somewhat stronger theorem.

Logic · Mathematics 2019-01-29 Saharon Shelah

We continue studying the properties of $\gamma_0$-compact, $\gamma^*$-regular and $\gamma$-normal spaces defined in [5]. We also define and discuss $\gamma$-locally compact spaces.

General Topology · Mathematics 2011-04-26 Sabir Hussain , Bashir Ahmad

A new class of functions is presented. The structure of the algorithm, particularly the selection criteria (branching), is used to define the fundamental property of the new class. The most interesting property of the new functions is that…

Computational Complexity · Computer Science 2020-02-25 Rade Vuckovac