English
Related papers

Related papers: Adding Abraham clubs and $\alpha$-properness

200 papers

I propose a notion of $(\omega_1,\beta)$-morass for the case $\omega_1 \leq \beta$.

Logic · Mathematics 2011-07-26 Bernhard Irrgang

We present two ways in which the model $L({\mathbb R})$ is canonical assuming the existence of large cardinals. We show that the theory of this model, with {\em ordinal} parameters, cannot be changed by small forcing; we show further that a…

Logic · Mathematics 2007-05-23 Itay Neeman , Jindrich Zapletal

Let $Z_3$ denote $3^{rd}$ order arithmetic. Let Harrington's Principle, HP, denote the statement that there is a real $x$ such that every $x$--admissible ordinal is a cardinal in $L$. In this paper, assuming there exists a remarkable…

Logic · Mathematics 2025-10-02 Yong Cheng

Let $M$ be a cancellative and commutative monoid. A non-invertible element of $M$ is called an atom (or irreducible element) if it cannot be factored into two non-invertible elements, while an atom $a$ of $M$ is called strong if $a^n$ has a…

Commutative Algebra · Mathematics 2026-05-26 Jiya Dani , Anna Deng , Marly Gotti , Bryan Li , Arav Paladiya , Joseph Vulakh , Jason Zeng

We give a new simple proof of the decidability of the First Order Theory of (omega^omega^i,+) and the Monadic Second Order Theory of (omega^i,<), improving the complexity in both cases. Our algorithm is based on tree automata and a new…

Computer Science and Game Theory · Computer Science 2007-05-23 Thierry Cachat

In this paper, we present an improved methodology to compute $\omega$-invariant of numerical semigroup. The approach is based on adapting a recent resolution method for optimizing a linear function over the set of efficient solutions of a…

Optimization and Control · Mathematics 2018-09-25 Wissem Achour , Djamal Chaabane , Víctor Blanco

We classify essential algebras whose irredundant non-refinable covers consist of primal algebras. The proof is obtained by constructing one to one correspondence between such algebras and partial orders on finite sets. Further, we prove…

Logic · Mathematics 2014-06-26 Shohei Izawa

We develop a general framework for forcing with coherent adequate sets on $H(\lambda)$ as side conditions, where $\lambda \ge \omega_2$ is a cardinal of uncountable cofinality. We describe a class of forcing posets which we call coherent…

Logic · Mathematics 2014-06-13 John Krueger , Miguel Angel Mota

We study the relationship between Amoeba forcing (the partial order which generically adds a measure one set of random reals) and projective measurability. Given a universe V of set theory and a forcing notion P in V we say that V is…

Logic · Mathematics 2009-09-25 Jörg Brendle

We give the optimal conditions for the existence of a club consisting of former regular over an inaccessible and a measurable. The foricing construction based on iteration of distributive posets.

Logic · Mathematics 2009-09-25 Moti Gitik

In this note we give a negative answer to Abraham Robinson's question whether a finitely generated extension of an undecidable field is always undecidable. We construct 'natural' undecidable fields of transcendence degree 1 over Q all of…

Logic · Mathematics 2013-11-07 Jochen Koenigsmann

Propositional term modal logic is interpreted over Kripke structures with unboundedly many accessibility relations and hence the syntax admits variables indexing modalities and quantification over them. This logic is undecidable, and we…

Logic in Computer Science · Computer Science 2019-01-01 Anantha Padmanabha , R Ramanujam

We introduce a model-complete theory which completely axiomatizes the structure $Z_{\alpha}=(Z, +, 0, 1, f)$ where $f : x \to \lfloor{\alpha} x \rfloor $ is a unary function with $\alpha$ a fixed transcendental number. When $\alpha$ is…

Logic · Mathematics 2025-10-16 Mohsen Khani , Ali N. Valizadeh , Afshin Zarei

(withdrawn.) For every lambda we give an explicit construction of an Abelian group with no non-trivial automorphisms. In particular the group absolutely has no non-trivial automorphisms, hence is absolutely indecomposable. Earlier we knew a…

Logic · Mathematics 2019-09-10 Saharon Shelah

Hellsten \cite{MR2026390} proved that when $\kappa$ is $\Pi^1_n$-indescribable, the \emph{$n$-club} subsets of $\kappa$ provide a filter base for the $\Pi^1_n$-indescribability ideal, and hence can also be used to give a characterization of…

Logic · Mathematics 2020-01-31 Brent Cody , Victoria Gitman , Chris Lambie-Hanson

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…

Number Theory · Mathematics 2025-10-10 Magdaléna Tinková , Pavlo Yatsyna

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

In this note we will discuss a new reflection principle which follows from the Proper Forcing Axiom. The immediate purpose will be to prove that the bounded form of the Proper Forcing Axiom implies both that 2^omega = omega_2 and that…

Logic · Mathematics 2013-10-08 Justin Tatch Moore

A necessary and sufficient condition for an element of an algebra (in the sense of Universal Algebra) to be in the dominion of a subalgebra is given, in terms of transferable sets. This criterion is then used to formulate a more wieldy…

Rings and Algebras · Mathematics 2007-05-23 Arturo Magidin

Given an arbitrary countable ordinal $\alpha $, we introduce the notion of type $I_{\alpha }$ C*-algebra and $\alpha $-subhomogeneous C*-algebra. When $\alpha =0$, these recover the notions of Fell C*-algebra and of commutative C*-algebra,…

Operator Algebras · Mathematics 2026-02-24 Martino Lupini
‹ Prev 1 4 5 6 7 8 10 Next ›