English
Related papers

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

200 papers

We show: There are pairs of universes V_1 subseteq V_2 and there is a notion of forcing P in V_1 such that the change mentioned in the title occurs when going from V_1[G] to V_2[G] for a P-generic filter G over V_2. We use forcing…

Logic · Mathematics 2007-05-23 Heike Mildenberger , Saharon Shelah

Let K^0_lambda be the class of structures < lambda,<,A>, where A subseteq lambda is disjoint from a club, and let K^1_lambda be the class of structures < lambda,<,A>, where A subseteq lambda contains a club. We prove that if lambda =…

Logic · Mathematics 2016-09-07 Saharon Shelah , Jouko Väänänen

It is shown that to every Q-linear cycle \bar\alpha modulo numerical equivalence on an abelian variety A there is canonically associated a Q-linear cycle \alpha modulo rational equivalence on A lying above \bar\alpha. The assignment…

Algebraic Geometry · Mathematics 2009-08-06 Peter O'Sullivan

A forcing extension may create new isomorphisms between two models of a first order theory. Certain model theoretic constraints on the theory and other constraints on the forcing can prevent this pathology. A countable first order theory is…

Logic · Mathematics 2016-09-06 John T. Baldwin , Michael C. Laskowski , Saharon Shelah

We show that there exists $0<\alpha_0<1$ (depending on the parameters) such that the fractal percolation is almost surely purely $\alpha$-unrectifiable for all $\alpha>\alpha_0$.

We give an affirmative answer to a question of Gorelic \cite{Gorelic}, by showing it is consistent, relative to the existence of large cardinals, that there is a proper class of cardinals $\alpha$ with $cf(\alpha)=\omega_1$ and…

Logic · Mathematics 2015-06-26 Mohammad Golshani

In this paper we investigate some properties of forcing which can be considered "nice" in the context of singularizing regular cardinals to have an uncountable cofinality. We show that such forcing which changes cofinality of a regular…

Logic · Mathematics 2018-05-15 Yair Hayut , Asaf Karagila

We prove that for lambda = beta_omega or just lambda strong limit singular of cofinality aleph_0, if there is a universal member in the class K^lf_lambda of locally finite groups of cardinality lambda, then there is a canonical one…

Logic · Mathematics 2023-03-08 Saharon Shelah

Given an uncountable cardinal $\kappa$, we consider the question of whether subsets of the power set of $\kappa$ that are usually constructed with the help of the Axiom of Choice are definable by $\Sigma_1$-formulas that only use the…

Logic · Mathematics 2023-09-20 Philipp Lücke , Sandra Müller

In this article, we give a family of examples of algebras, showing that for every $n \geq 2$ and $m \geq 0$, there is an algebra displaying a path of n irreducible morphisms between indecomposable modules whose composite lies in the…

Representation Theory · Mathematics 2025-07-14 Viktor Chust , Flávio U. Coelho

An algebraic structure with two constants and one ternary operation, which is not completely commutative, is put forward to accommodate ternary Boolean algebras. When the ternary operation is interpreted as Church's conditioned disjunction,…

Rings and Algebras · Mathematics 2022-03-16 J. P. Fatelo , N. Martins-Ferreira

A club structure is defined on the category of simplicial sets. This club generalizes the operad of associative rings by adding "amalgamated" products.

Category Theory · Mathematics 2010-12-16 Dennis Borisov

We extend the inflationary fixed-point logic, IFP, with a new kind of second-order quantifiers which have (poly-)logarithmic bounds. We prove that on ordered structures the new logic $\exists^{\log^{\omega}}\text{IFP}$ captures the limited…

Logic in Computer Science · Computer Science 2022-09-07 Kexu Wang , Xishun Zhao

We prove two results intended to streamline proofs about cellularity that pass through mutual algebraicity. First, we show that a countable structure $M$ is cellular if and only if $M$ is $\omega$-categorical and mutually algebraic. Second,…

Logic · Mathematics 2022-08-11 Samuel Braunfeld , Michael C. Laskowski

We consider an extension of logic programs, called \omega-programs, that can be used to define predicates over infinite lists. \omega-programs allow us to specify properties of the infinite behavior of reactive systems and, in general,…

Programming Languages · Computer Science 2010-07-26 Alberto Pettorossi , Maurizio Proietti , Valerio Senni

This paper provides two extensions of first order logic by `$\omega$-rules'. In each case we characterize the countable structures whose theory in the logic is categorical (has a unique model). In the one-sorted inferential $\omega$-logic,…

Logic · Mathematics 2026-04-28 John T. Baldwin , Constantin C. Brîncuş

For many classes of models, there are universal members in any cardinal $\lambda$ which "essentially satisfies GCH", i.e. $\lambda = 2^{< \lambda}$, in particular for the class of a complete first order $T$ (well, if at least $\lambda >…

Logic · Mathematics 2026-03-05 Saharon Shelah

The theory of addition in the domains of natural (N), integer (Z), rational (Q), real (R) and complex (C) numbers is decidable, so is the theory of multiplication in all those domains. By Godel's Incompleteness Theorem the theory of…

Logic · Mathematics 2021-11-30 Saeed Salehi

We prove Los conjecture = Morley theorem in ZF, with the same characterization (of first order countable theories categorical in aleph_alpha for some (equivalently for every) ordinal alpha>0. Another central result here is, in this context:…

Logic · Mathematics 2008-07-08 Saharon Shelah

We show that adding recursion does not increase the total functions definable in the typed $\lambda\beta\eta$-calculus or the partial functions definable in the $\lambda\Omega$-calculus. As a consequence, adding recursion does not increase…

Logic in Computer Science · Computer Science 2023-07-19 Gordon Plotkin
‹ Prev 1 8 9 10 Next ›