◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

M. Morillon

5 papers hereh-index 8159 citations27 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author5

Across the 5 of 5 papers where every author was matched, so the position is known.

fields
  • math.FA3
  • math.LO2

identity via Semantic Scholar / OpenAlex

activity
20052019
collaborators

5 papers

math.LO2019

Linear extenders and the Axiom of Choice

Marianne Morillon

In set theory without the axiom of Choice ZF, we prove that for every commutative field IK, the following statement D_{\IK}: "On every non null IK-vector space, there exists a non…

math.LO2019

Multiple Choices imply the Ingleton and Krein-Milman axioms

Marianne Morillon

In set theory without the Axiom of Choice, we consider Ingleton's axiom which is the counterpart in ultrametric analysis of the Hahn-Banach axiom. We show that in ZFA, set theory…

math.FA2008

Uniform Eberlein spaces and the finite axiom of choice

Marianne Morillon

We work in set-theory without choice $\ZF$. Given a closed subset F of [0,1]I which is a bounded subset of ℓ1(I) ({\em resp.} such that F⊆ℓ0(I)), we show…

math.FA2008

Countable Choice and Compactness

Marianne Morillon

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 compac…

math.FA2005

A new proof of James' sup theorem

Marianne Morillon

We provide a new proof of James' sup theorem for (non necessarily separable) Banach spaces. One of the ingredients is the following generalization of a theorem of Hagler and Johnso…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.