Results 71 to 80 of about 590,591 (97)

On an integral equation under Henstock–Kurzweil–Pettis integrability [PDF]

A. Kryczka, A. Kryczka, A. Sikorska-Nowak, A. Sikorska-Nowak, A. Sikorska-Nowak, B. Satco, B. Satco, C. Angosto, D. O’Regan, F.S. DeBlasi, I. Dobrakov, J. Banaś, J. Banaś, J. Garcia-Falset, J.L. Gamez, L. Di Piazza, L. Yu, M. Cichoń, M. Cichoń, M. Cichoń, M. Cichoń, O. Arino, R. Agarwal, R.A. Gordon, S.B. Kaliaj   +24 more
core   +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

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:

Towards solid abelian groups: A formal proof of Nöbeling's theorem

International Conference on Interactive Theorem Proving, 2023
Condensed mathematics, developed by Clausen and Scholze over the last few years, is a new way of studying the interplay between algebra and geometry. It replaces the concept of a topological space by a more sophisticated but better-behaved idea, namely ...
D. Ásgeirsson
semanticscholar   +1 more source

Automated Theorem Proving in First-Order Logic Modulo: On the Difference between Type Theory and Set Theory

International Workshops on First Order Theorem Proving, 2023
Resolution modulo is a first-order theorem proving method that can be applied both to first-order presentations of simple type theory (also called higher-order logic) and to set theory. When it is applied to some first-order presentations of type theory,
Gilles Dowek
semanticscholar   +1 more source

Automated Theorem Proving for Metamath

International Conference on Interactive Theorem Proving, 2023
Metamath is a proof assistant that keeps surprising outsiders by its combination of a very minimalist design with a large library of advanced results, ranking high on the Freek Wiedijk’s 100 list.
Mario M. Carneiro, C. Brown, J. Urban
semanticscholar   +1 more source

Pointwise Compactness in Spaces of Continuous Functions

, 1987
In this paper we describe a class of topological spaces X such that Cp(X), the space of continuous functions on A'endowed with the topology of pointwise convergence, is an angelic space.
J. Orihuela
semanticscholar   +1 more source

Minimaxtheoreme für die diskrete gemischte erweiterung von spielen und ein approximationssatz 1

, 1980
Using a theorem of Konig [10] and a theorem proved earlier [7] minimax theorems for the discrete mixed extension of two-person zero-sum games are derived.
J. Kindler
semanticscholar   +1 more source

Duper: A Proof-Producing Superposition Theorem Prover for Dependent Type Theory

International Conference on Interactive Theorem Proving
We present Duper, a proof-producing theorem prover for Lean based on the superposition calculus. Duper can be called directly as a terminal tactic in interactive Lean proofs, but is also designed with proof reconstruction for a future Lean hammer in mind.
Joshua Clune, Yicheng Qian, Alexander Bentkamp, Jeremy Avigad   +3 more
semanticscholar   +1 more source