English
Related papers

Related papers: Squares, scales and lines

200 papers

For each $\Pi^0_1$ $S\subseteq \mathbb{N}$, let the $S$-square shift be the two-dimensional subshift on the alphabet $\{0,1\}$ whose elements consist of squares of 1s of various sizes on a background of 0s, where the side length of each…

Dynamical Systems · Mathematics 2016-09-27 Linda Brown Westrick

We show that a linearly ordered topological space is initially \lambda-compact if and only if it is \lambda-bounded, that is, every set of cardinality $\leq \lambda$ has compact closure. As a consequence, every product of initially…

General Topology · Mathematics 2013-07-05 Paolo Lipparini

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

Starting from a supercompact cardinal we build a model in which $2^{\aleph_{\omega_1}}=2^{\aleph_{\omega_1+1}}=\aleph_{\omega_1+3}$ but there is a jointly universal family of size $\aleph_{\omega_1+2}$ of graphs on $\aleph_{\omega_1+1}$.…

Logic · Mathematics 2016-05-03 Jacob Davis

NF set theory using intuitionistic logic is called iNF. We develop the theories of finite sets and their power sets and mappings, finite cardinals and their ordering, cardinal exponentiation, addition, and multiplication. We follow Rosser…

Logic · Mathematics 2025-10-31 Michael Beeson

We introduce the calculus of neo-Peircean relations, a string diagrammatic extension of the calculus of binary relations that has the same expressivity as first order logic and comes with a complete axiomatisation. The axioms are obtained…

Logic in Computer Science · Computer Science 2024-01-17 Filippo Bonchi , Alessandro Di Giorgio , Nathan Haydon , Pawel Sobocinski

In this paper, we consider certain cardinals in ZF (set theory without AC, the Axiom of Choice). In ZFC (set theory with AC), given any cardinals C and D, either C <= D or D <= C. However, in ZF this is no longer so. For a given infinite…

Logic · Mathematics 2016-09-06 Lorenz Halbeisen , Saharon Shelah

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

We describe a framework for proving consistency results about singular cardinals of arbitrary cofinality and their successors. This framework allows the construction of models in which the Singular Cardinals Hypothesis fails at a singular…

It is consistent that there is a partial order (P,<) of size aleph_1 such that every monotone (unary) function from P to P is first order definable in (P,<). The partial order is constructed in an extension obtained by finite support…

Logic · Mathematics 2016-09-07 Martin Goldstern , Saharon Shelah

We give a new method to construct isolated left orderings of groups whose positive cones are finitely generated. Our construction uses an amalgamated free product of two groups having an isolated ordering. We construct a lot of new examples…

Group Theory · Mathematics 2013-02-21 Tetsuya Ito

We show that the decidability of the first-order theory of the language that combines Boolean algebras of sets of uninterpreted elements with Presburger arithmetic operations. We thereby disprove a recent conjecture that this theory is…

Logic in Computer Science · Computer Science 2007-05-23 Viktor Kuncak , Martin Rinard

In this article, we give a polynomial algorithm to decide whether a given permutation $\sigma$ is sortable with two stacks in series. This is indeed a longstanding open problem which was first introduced by Knuth. He introduced the stack…

Combinatorics · Mathematics 2013-04-11 Adeline Pierrot , Dominique Rossin

We prove that for every Aronzsajn line A and every Countryman line C, there is a proper forcing extension in which A contains an isomorphic copy of either C or its converse C*. As a corollary, we obtain answers to several related questions…

Logic · Mathematics 2025-10-23 John Krueger , Justin Tatch Moore

We introduce orderings between total functions f,g: N -> N which refine the pointwise "up to a constant" ordering <=cte and also insure that f(x) is often much less thang(x). With such orderings, we prove a strong hierarchy theorem for…

Logic · Mathematics 2008-01-07 Marie Ferbus-Zanda , Serge Grigorieff

We provide proofs for the fact that certain orders have no descending chains and no antichains.

Logic · Mathematics 2023-06-01 Erhard Aichinger , Florian Aichinger

The following paper is inspired by Efimov's problem - an undecided problem of whether there exists an infinite compact topological space that does not contain neither non-trivial convergent sequences nor a copy of $\beta\omega$. After…

General Topology · Mathematics 2021-07-13 Dawid Migacz

It is shown that the toric ideal of the centrally symmetric configuration of the order polytope of a finite partially ordered set possesses a squarefree quadratic initial ideal. It then follows that the convex polytope arising from the…

Commutative Algebra · Mathematics 2016-01-08 Takayuki Hibi , Kazunori Matsuda , Hidefumi Ohsugi , Kazuki Shibata

We define toric partial orders, corresponding to regions of graphic toric hyperplane arrangements, just as ordinary partial orders correspond to regions of graphic hyperplane arrangements. Combinatorially, toric posets correspond to finite…

Combinatorics · Mathematics 2012-11-20 Mike Develin , Matthew Macauley , Victor Reiner

In this paper, we prove a crucial theorem called Mirroring Theorem which affirms that given a collection of samples with enough information in it such that it can be classified into classes and subclasses then (i) There exists a mapping…

Machine Learning · Computer Science 2009-11-03 Dasika Ratna Deepthi , K. Eswaran
‹ Prev 1 4 5 6 7 8 10 Next ›