English
Related papers

Related papers: Untranscendable order types

200 papers

A theorem of alternatives provides a reduction of validity in a substructural logic to validity in its multiplicative fragment. Notable examples include a theorem of Arnon Avron that reduces the validity of a disjunction of multiplicative…

Logic · Mathematics 2020-02-27 Almudena Colacito , Nikolaos Galatos , George Metcalfe

We prove a conjecture about the constructibility of coinductive types - in the principled form of indexed M-types - in Homotopy Type Theory. The conjecture says that in the presence of inductive types, coinductive types are derivable.…

Logic in Computer Science · Computer Science 2019-07-16 Benedikt Ahrens , Paolo Capriotti , Régis Spadotti

The aim of this article is to study (additively) indecomposable algebraic integers $\mathcal O_K$ of biquadratic number fields $K$ and universal totally positive quadratic forms with coefficients in $\mathcal O_K$. There are given…

Number Theory · Mathematics 2018-02-23 Martin Čech , Dominik Lachman , Josef Svoboda , Magdaléna Tinková , Kristýna Zemková

A theory of matchings for finite subsets of an abelian group, introduced in connection with a conjecture of Wakeford on canonical forms for homogeneous polynomials, has since been extended to the setting of field extensions and to that of…

Combinatorics · Mathematics 2026-02-03 Mohsen Aliabadi , Jozsef Losonczy

We deal with the monadic (second-order) theory of order. We prove all known results in a unified way, show a general way of reduction, prove more results and show the limitation on extending them. We prove (CH) that the monadic theory of…

Logic · Mathematics 2023-05-02 Saharon Shelah

Generalised indiscernibles highlight a strong link between model theory and structural Ramsey theory. In this paper, we use generalised indiscernibles as tools to prove results in both these areas. More precisely, we first show that a…

Logic · Mathematics 2024-08-13 Nadav Meir , Aris Papadopoulos , Pierre Touchard

Various theorems for the preservation of set-theoretic axioms under forcing are proved, regarding both forcing axioms and axioms true in the Levy-Collapse. These show in particular that certain applications of forcing axioms require to add…

Logic · Mathematics 2007-05-23 Bernhard Koenig

Alon's combinatorial Nullstellensatz, and in particular the resulting nonvanishing criterion is one of the most powerful algebraic tools in combinatorics, with many important applications. In this paper we extend the nonvanishing theorem in…

Combinatorics · Mathematics 2011-08-16 Géza Kós , Tamás Mészáros , Lajos Rónyai

Let $\mathcal{R}$ be an expansion of the ordered real additive group. When $\mathcal{R}$ is o-minimal, it is known that either $\mathcal{R}$ defines an ordered field isomorphic to $(\mathbb{R},<,+,\cdot)$ on some open subinterval…

Logic · Mathematics 2021-03-09 Philipp Hieronymi , Erik Walsberg

A typoid is a type equipped with an equivalence relation, such that the terms of equivalence between the terms of the type satisfy certain conditions, with respect to a given equivalence relation between them, that generalise the properties…

Category Theory · Mathematics 2022-05-16 Iosif Petrakis

We introduce the notion of non commutative truncated polynomial extension of an algebra A. We study two families of these extensions. For the first one we obtain a complete classification and for the second one, which we call upper…

Rings and Algebras · Mathematics 2011-11-28 Jorge A. Guccione , Juan J. Guccione , Christian Valqui

Zeckendorf's Theorem states that any positive integer can be written uniquely as a sum of non-adjacent Fibonacci numbers. We consider higher-dimensional lattice analogues, where a legal decomposition of a number $n$ is a collection of…

Number Theory · Mathematics 2018-09-18 Eric Chen , Robin Chen , Lucy Guo , Cindy Jiang , Steven J. Miller , Joshua M. Siktar , Peter Yu

This paper presents a type theory in which it is possible to directly manipulate $n$-dimensional cubes (points, lines, squares, cubes, etc.) based on an interpretation of dependent type theory in a cubical set model. This enables new ways…

Logic in Computer Science · Computer Science 2016-11-14 Cyril Cohen , Thierry Coquand , Simon Huber , Anders Mörtberg

We study the structure of the codifferent and of additively indecomposable integers in families of totally real cubic fields. We prove that for cubic orders in these fields, the minimal trace of indecomposable integers multiplied by totally…

Number Theory · Mathematics 2022-12-16 Magdaléna Tinková

Let $U$ be a unipotent group which is graded in the sense that it has an extension $H$ by the multiplicative group of the complex numbers such that all the weights of the adjoint action on the Lie algebra of $U$ are strictly positive. We…

Algebraic Geometry · Mathematics 2015-11-24 Gergely Bérczi , Frances Kirwan

We recall a characterization of hereditary indecomposability originally obtained by Krasinkiewicz and Minc, and show how it may be used to give unified constructions of various hereditarily indecomposable continua. In particular we answer a…

General Topology · Mathematics 2007-05-23 Klaas Pieter Hart , Jan van Mill , Roman Pol

We call a metric space $s$-negligible iff its $s$-dimensional Hausdorff measure vanishes. We show that every countably $m$-rectifiable subset of $\mathbb{R}^{2n}$ can be displaced from every $(2n-m)$-negligible subset by a Hamiltonian…

Symplectic Geometry · Mathematics 2024-09-09 Yann Guggisberg , Fabian Ziltener

Let $\Lambda$ be a $\mathbb{Z}$-graded artin algebra. Two classical results of Gordon and Green state that if $\Lambda$ has only finitely many indecomposable gradable modules, up to isomorphism, then $\Lambda$ has finite representation…

Representation Theory · Mathematics 2018-08-07 Alex Dugas

We describe indecomposable objects in Deligne's category $\underline{\operatorname{Re}}\!\operatorname{p}(O_\delta)$ and explain how to decompose their tensor products. We then classify thick ideals in…

Representation Theory · Mathematics 2016-11-14 Jonathan Comes , Thorsten Heidersdorf

Forcing axioms are generalizations of Baire category principles that allow one to intersect more dense open sets and to do so in a wider variety of circumstances. In this paper we introduce two new forcing axioms related to posets which…

Logic · Mathematics 2025-02-05 Thomas Gilton
‹ Prev 1 4 5 6 7 8 10 Next ›