Related papers: Untranscendable order types

We observe that the notions of a topological space being extremally disconnected, and of a continuous map of compact Hausdorff spaces being proper, and being surjective proper, can each be defined in terms of the Quillen lifting property…

In this paper we have found a necessary and sufficient condition for equivalence of two norms on a linear space using the theory of exponential vector space. Exponential vector space is an ordered algebraic structure which can be considered…

It is well-known that every transitive linear order is exponentiable. However, is the converse true? This question was posed in Chapter 8 of the textbook titled "Linear Orderings" by Rosenstein. We define the class CTLO of cyclically…

We call an order type inscribable if it is realized by a point configuration where the extreme points are all on a circle. In this paper, we investigate inscribability of order types. We first show that every simple order type with at most…

One may formulate the dependent product types of Martin-L\"of type theory either in terms of abstraction and application operators like those for the lambda-calculus; or in terms of introduction and elimination rules like those for the…

We study L\"owenheim-Skolem and Omitting Types theorems in Transition Algebra, a logical system obtained by enhancing many sorted first-order logic with features from dynamic logic. The sentences we consider include compositions, unions,…

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…

We give an upper bound for the norm of the determinant of additively indecomposable, totally positive definite quadratic forms defined over the ring of integers of totally real number fields. We apply these results to find lower and upper…

We prove that the property of a free group endomorphism being irreducible is a group invariant of the ascending HNN extension it defines. This answers a question posed by Dowdall-Kapovich-Leininger. We further prove that being irreducible…

In this paper we provide proofs of two new theorems that provide a broad class of partition inequalities and that illustrate a na\"ive version of Andrews' anti-telescoping technique quite well. These new theorems also put to rest any notion…

We study the degree of irreducible morphisms in any Auslander-Reiten component of a finite dimensional algebra over an algebraically closed field. We give a characterization for an irreducible morphism to have finite left (or right) degree.…

Consider a linear ordering equipped with a finite sequence of monadic predicates. If the ordering contains an interval of order type \omega or -\omega, and the monadic second-order theory of the combined structure is decidable, there exists…

We show that Morley's theorem on the number of countable models of a countable first-order theory becomes an undecidable statement when extended to second-order logic. More generally, we calculate the number of equivalence classes of…

Subexponential logic is a variant of linear logic with a family of exponential connectives--called subexponentials--that are indexed and arranged in a pre-order. Each subexponential has or lacks associated structural properties of weakening…

Building on coprincipal mesoprimary decomposition [Kahle and Miller, 2014], we combinatorially construct an irreducible decomposition of any given binomial ideal. In a parallel manner, for congruences in commutative monoids we construct…

We construct a canonical irreducible representation for the orthofermion algebra of arbitrary order, and show that every representation decomposes into irreducible representations that are isomorphic to either the canonical representation…

Szpilrajn's Lemma entails that each partial order extends to a linear order. Dushnik and Miller use Szpilrajn's Lemma to show that each partial order has a relizer. Since then, many authors utilize Szpilrajn's Theorem and the Well-ordering…

We construct a realizability model of linear dependent type theory from a linear combinatory algebra. Our model motivates a number of additions to the type theory. In particular, we add a universe with two decoding operations: one takes…

The Univalence Principle is the statement that equivalent mathematical structures are indistinguishable. We prove a general version of this principle that applies to all set-based, categorical, and higher-categorical structures defined in a…

We prove the following theorem: For a partially ordered set Q such that every countable subset has a strict upper bound, there is a forcing notion satisfying ccc such that, in the forcing model, there is a basis of the null ideal of the…