English
Related papers

Related papers: Are There Enough Injective Sets?

200 papers

A set $F$ of formulas is complete relative to a given class of logics, if every logic from this class can be axiomatized by formulas from $F$. A set of formulas $F$ is {\L}-complete relative to a given class of logics, if every logic of…

Logic · Mathematics 2014-07-23 Alex Citkin

Every automorphism-invariant right non-singular $A$-module is injective if and only if the factor ring of the ring $A$ with respect to its right Goldie radical is a right strongly semiprime ring.

Rings and Algebras · Mathematics 2017-04-28 Askar Tuganbaev

A celebrated unresolved conjecture of Peter Frankl states that every finite collection of sets, with finite universe, admits an abundant element. In this paper, we prove Frankl's union-closed conjecture(FC). We provide an induction proof…

General Mathematics · Mathematics 2019-01-01 Acquaah Peter

It often happens that free algebras for a given theory satisfy useful reasoning principles that are not preserved under homomorphisms of algebras, and hence need not hold in an arbitrary algebra. For instance, if $M$ is the free monoid on a…

Logic in Computer Science · Computer Science 2023-09-28 Jonathan Sterling

The first part of this article is devoted to characterizing the cocycles $\alpha$ of a finite group $G$ that give rise to faithful projective representations of $G$. We prove that a $p$-group $G$ admits a faithful irreducible projective…

Representation Theory · Mathematics 2026-05-27 Sumana Hatui , Poonam Nayak

"Church's thesis" ($\mathsf{CT}$) as an axiom in constructive logic states that every total function of type $\mathbb{N} \to \mathbb{N}$ is computable, i.e. definable in a model of computation. $\mathsf{CT}$ is inconsistent in both…

Logic in Computer Science · Computer Science 2022-12-09 Yannick Forster

Recently, in Axioms 10(2): 119 (2021), a nonclassical first-order theory T of sets and functions has been introduced as the collection of axioms we have to accept if we want a foundational theory for (all of) mathematics that is not weaker…

General Mathematics · Mathematics 2026-03-13 Marcoen J. T. F. Cabbolet , Adrian R. D. Mathias

In this paper, we present a proof of the consistency of the New Foundations set theory ($\mathit{NF}$). $\mathit{NF}$'s main idea is to permit very large sets (including the Universal Set) by restricting set formation to stratified…

Logic · Mathematics 2025-09-05 Nicolás Sevilla Simón

Instantiation overflow is the property of those second order types for which all instances of full comprehension can be deduced from instances of atomic comprehension. In other words, a type has instantiation overflow when one can type, by…

Logic in Computer Science · Computer Science 2018-03-28 Paolo Pistone

By Tzouvaras, a set is nontypical in the Russell sense, if it belongs to a countable ordinal definable set. The class HNT of all hereditarily nontypical sets satisfies all axioms of ZF and the double inclusion HOD$\subseteq$HNT$\subseteq$V…

Logic · Mathematics 2021-11-16 Vladimir Kanovei , Vassily Lyubetsky

In this paper we show how to build a model of $ZFC$ such that all its inner models satisfying the Axiom of Choice are well-ordered with respect to inclusion, and that said ordering is of arbitrary height (including possibly $Ord$ high). We…

Logic · Mathematics 2018-12-18 Alon Navon

Let $R$ be an arbitrary ring and $(-)^+=\Hom_{\mathbb{Z}}(-, \mathbb{Q}/\mathbb{Z})$ where $\mathbb{Z}$ is the ring of integers and $\mathbb{Q}$ is the ring of rational numbers, and let $\mathcal{C}$ be a subcategory of left $R$-modules and…

Category Theory · Mathematics 2019-08-15 Zhaoyong Huang

We present a set-theoretic, proof-irrelevant model for Calculus of Constructions (CC) with predicative induction and judgmental equality in Zermelo-Fraenkel set theory with an axiom for countably many inaccessible cardinals. We use Aczel's…

Logic in Computer Science · Computer Science 2015-07-01 Gyesik Lee , Benjamin Werner

In this article, for generalized projective spaces with any weights, we prove four main theorems in three different contexts where the Unital Set Condition USC (Definition $2.8$) on ideals is further examined. In the first context we prove,…

Number Theory · Mathematics 2022-12-20 C P Anil Kumar

Let $\mathcal{P}$ be the class of rings for which every indecomposable right module is pure-projective or pure-injective. When $R$ is a Noetherian local commutative ring of maximal ideal $P$, it is proven that $R\in\mathcal{P}$ if and only…

Rings and Algebras · Mathematics 2025-07-08 François Couchot

The aim of these lectures is to give a short introduction to forcing. We will avoid metamathematical issues as much as possible and similarly we will avoid performing the actual construction of forcing. We assume familiarity with basic…

Logic · Mathematics 2015-03-30 Mohammad Golshani

Hilary Putnam once suggested that "the actual existence of sets as 'intangible objects' suffers... from a generalization of a problem first pointed out by Paul Benacerraf... are sets a kind of function or are functions a sort of set?"…

Logic · Mathematics 2024-01-02 Tim Button

We give new proofs for many injectivity results in analysis that make more careful use of the duality between unital abelian C*-algebras and compact Hausdorff spaces. We then extend many of these results to incorporate group actions. Our…

Operator Algebras · Mathematics 2007-06-21 Don Hadwin , Vern I. Paulsen

Let $G$ be some generalized $\pi$-soluble groups and ${\cal F}$ be a Fitting set of $G$. In this paper, we prove the existence and conjugacy of ${\cal F}$-injectors of $G$, and give a description of the structure of the injectors.

Group Theory · Mathematics 2017-02-14 Nanying Yang , Wenbin Guo , N. T. Vorobev

We work in set-theory without choice ZF. Denoting by AC(N) the countable axiom of choice, we show in ZF+AC(N) that the closed unit ball of a uniformly convex Banach space is compact in the convex topology (an alternative to the weak…

Functional Analysis · Mathematics 2008-12-18 Marianne Morillon