English
Related papers

Related papers: Chain Logic and Shelah's Infinitary Logic

200 papers

It is a celebrated result of McKinsey and Tarski [28] that S4 is the logic of the closure algebra X+ over any dense-in-itself separable metrizable space. In particular, S4 is the logic of the closure algebra over the reals R, the rationals…

Logic · Mathematics 2013-11-12 Guram Bezhanisevili , David Gabelaia , Joel Lucero-Bryan

We show that the order dimension of the partial order of all finite subsets of $\kappa$ under set inclusion is ${\log}_{2}({\log}_{2}(\kappa))$ whenever $\kappa$ is an infinite cardinal. We also show that the order dimension of any locally…

Logic · Mathematics 2019-02-19 Kojiro Higuchi , Steffen Lempp , Diip Raghavan , Frank Stephan

A \emph{chain} in the unit $n$-cube is a set $C\subset [0,1]^n$ such that for every $\mathbf{x}=(x_1,\ldots,x_n)$ and $\mathbf{y}=(y_1,\ldots,y_n)$ in $C$ we either have $x_i\le y_i$ for all $i\in [n]$, or $x_i\ge y_i$ for all $i\in [n]$.…

Classical Analysis and ODEs · Mathematics 2019-04-23 Themis Mitsis , Christos Pelekis , Václav Vlasák

We show that generalized eventually narrow sequences on a strongly inaccessible cardinal $\kappa$ are preserved under the Cummings-Shaleh non-linear iterations of the higher Hechler forcing on $\kappa$. Moreover assuming GCH,…

Logic · Mathematics 2020-05-25 Ömer Faruk Bağ , Vera Fischer

We continue our study of Sierpinski-type colourings. In contrast to the prequel paper, we focus here on colourings for ideals stratified by their completeness degree. In particular, improving upon Ulam's theorem and its extension by Hajnal,…

Logic · Mathematics 2023-12-19 Tanmay Inamdar , Assaf Rinot

For every infinite cardinal $\kappa$ with $\kappa^+=2^\kappa$ we construct a group $G$ of cardinality $|G|=\kappa^+$ such that (i) $G$ is $36$-Shelah, which means that $A^{36}=G$ for any subset $A\subseteq G$ of cardinality $|A|=|G|$; (ii)…

Group Theory · Mathematics 2022-12-06 Taras Banakh

We show that Shelah cardinals are preserved under the canonical $GCH$ forcing notion. We also show that if $GCH$ holds and $F:REG\rightarrow CARD$ is an Easton function which satisfies some weak properties, then there exists a cofinality…

Logic · Mathematics 2016-09-28 Mohammad Golshani

We show that certain classes of modules have universal models with respect to pure embeddings. $Theorem.$ Let $R$ be a ring, $T$ a first-order theory with an infinite model extending the theory of $R$-modules and $K^T=(Mod(T), \leq_{pp})$…

Logic · Mathematics 2020-02-24 Thomas G. Kucera , Marcos Mazari-Armida

Given a module $X$ and a regular cardinal $\kappa$ we study various notions of $(\kappa,\mathrm{Add}(X))$-freeness and $(\kappa,\mathrm{Add}(X))$-separability. Bearing on appropriate set-theoretic assumptions, we construct a non-trivial…

Rings and Algebras · Mathematics 2024-07-31 Manuel Cortés-Izurdiaga , Alejandro Poveda

We address the problem of complementing higher-order patterns without repetitions of existential variables. Differently from the first-order case, the complement of a pattern cannot, in general, be described by a pattern, or even by a…

Logic in Computer Science · Computer Science 2008-10-22 Alberto Momigliano , Frank Pfenning

Given a cardinal $\kappa$ that is $\lambda$-supercompact for some regular cardinal $\lambda\geq\kappa$ and assuming $\GCH$, we show that one can force the continuum function to agree with any function $F:[\kappa,\lambda]\cap\REG\to\CARD$…

Logic · Mathematics 2013-09-12 Brent Cody , Menachem Magidor

Assuming the existence of a strong cardinal $\kappa$, a weakly compact cardinal $\lambda$ above it and $\gamma > \lambda,$ we force a generic extension in which $\kappa$ is a singular strong limit cardinal of any given cofinality $\delta$,…

Logic · Mathematics 2020-06-26 Mohammad Golshani , Alejandro Poveda

First-order temporal logics are notorious for their bad computational behaviour. It is known that even the two-variable monadic fragment is highly undecidable over various linear timelines, and over branching time even one-variable…

Logic in Computer Science · Computer Science 2015-08-17 Christopher Hampson , Agi Kurucz

Assuming an instance of the Brodsky-Rinot proxy principle holding at a regular uncountable cardinal $\kappa$, we construct $2^\kappa$-many pairwise non-embeddable minimal non-$\sigma$-scattered linear orders of size $\kappa$. In particular,…

Logic · Mathematics 2023-12-29 Roy Shalev

Several variants of the Halpern-L\"auchli Theorem for trees of uncountable height are investigated. For $\kappa$ weakly compact, we prove that the various statements are all equivalent. We show that the strong tree version holds for one…

Logic · Mathematics 2018-03-06 Natasha Dobrinen , Dan Hathaway

We present two different types of models where, for certain singular cardinals lambda of uncountable cofinality, lambda -> (lambda, omega+1)^2, although lambda is not a strong limit cardinal. We announce, here, and will present in a…

Logic · Mathematics 2016-09-07 Saharon Shelah , Lee Stanley

We continue our study of the class $\mathscr{C}(D)$, where $D$ is a uniform ultrafilter on a cardinal $\kappa$ and $\mathscr{C}(D)$ is the class of all pairs $(\theta_1, \theta_2),$ where $(\theta_1, \theta_2)$ is the cofinality of a cut in…

Logic · Mathematics 2017-12-19 Mohammad Golshani , Saharon Shelah

In a classical paper by Ben-David and Magidor, a model of set theory was exhibited in which $\aleph_{\omega+1}$ carries a uniform ultrafilter that is $\theta$-indecomposable for every uncountable cardinal $\theta<\aleph_\omega$. In this…

Logic · Mathematics 2025-12-18 Sittinon Jirattikansakul , Inbar Oren , Assaf Rinot

Suppose lambda is a singular cardinal of uncountable cofinality kappa. For a model M of cardinality lambda, let No(M) denote the number of isomorphism types of models N of cardinality lambda which are L_{infty lambda}-equivalent to M. In…

Logic · Mathematics 2016-09-07 Saharon Shelah , Pauli Väisänen

We introduce refutationally complete superposition calculi for intentional and extensional clausal $\lambda$-free higher-order logic, two formalisms that allow partial application and applied variables. The calculi are parameterized by a…

Logic in Computer Science · Computer Science 2023-06-22 Alexander Bentkamp , Jasmin Blanchette , Simon Cruanes , Uwe Waldmann