Results 71 to 80 of about 603,801 (119)

Commutative Banach algebras which satisfy a Bochner-Schoenberg-Eberlein type-theorem

, 1990
Sin-Ei Takahasi, O. Hatori
semanticscholar   +1 more source

Eberlein–ŠMulyan Theorem for Abelian Topological Groups

, 2004
M. Bruguera, E. Martín-Peinador, V. Tarieladze   +2 more
semanticscholar   +1 more source

On theorem of W.F. Eberlein

, 1954
V. Pták
semanticscholar   +1 more source

Quadratic forms in harmonic analysis and the Bochner-Eberlein theorem

, 1975
R. Horn
semanticscholar   +1 more source

The Eberlein–Šmulian and Eberlein–Grothendieck Theorems

, 2020
Jürgen Voigt
openalex   +2 more sources

The Eberlein-Šmulian Theorem

, 1984
Joseph Diestel
openalex   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Some Compact-Like Properties in Non-Archimedean Functional Analysis

P-Adic Numbers, Ultrametric Analysis, and Applications, 2022
First, we define some concepts similar to the local compactoidity or the c-compactness, and study relationships between these concepts and the original ones. As a result, we find a characterization of the local compactoidity when its coefficient field is
K. Ishizuka
semanticscholar   +1 more source

Weak and Weak* Operators in Non-Separable Banach Spaces: Topological Properties, Convergence and Structural Insights

Thermodynamics Research: Open Access
This article develops a rigorous framework for the study of weak and weak* operators in nonseparable Banach spaces (NSBS), where many of the foundational results of classical functional analysis fail or require significant reformulation.
Juan Alberto Molina García
semanticscholar   +1 more source

Scott's Representation Theorem and the Univalent Karoubi Envelope

International Conference on Interactive Theorem Proving
Lambek and Scott constructed a correspondence between simply-typed lambda calculi and Cartesian closed categories. Scott's Representation Theorem is a cousin to this result for untyped lambda calculi.
Arnoud van der Leer, Kobe Wullaert, Benedikt Ahrens   +2 more
semanticscholar   +1 more source

Canonical for Automated Theorem Proving in Lean

International Conference on Interactive Theorem Proving
Canonical is a solver for type inhabitation in dependent type theory, that is, the problem of producing a term of a given type. We present a Lean tactic which invokes Canonical to generate proof terms and synthesize programs.
Chase Norman, Jeremy Avigad
semanticscholar   +1 more source