Results 51 to 60 of about 496,419 (187)
Homeomorphisms of Compact Sets in Certain Hausdorff Spaces
International Journal of Mathematics and Mathematical Sciences, Volume 2011, Issue 1, 2011., 2011 We construct a class of Hausdorff spaces (compact and noncompact) with the property that nonempty compact subsets of these spaces that have the same cardinality are homeomorphic. Also, it is shown that these spaces contain compact subsets that are infinite.
Arthur D. Grainger, Vladimir Mityushev
wiley +1 more source
Wetzel families and the continuum
Journal of the London Mathematical Society, Volume 109, Issue 6, June 2024.Abstract We provide answers to a question brought up by Erdős about the construction of Wetzel families in the absence of the continuum hypothesis: A Wetzel family is a family F$\mathcal {F}$ of entire functions on the complex plane which pointwise assumes fewer than |F|$\vert \mathcal {F} \vert$ values.
Jonathan Schilhan, Thilo Weinert
wiley +1 more source
Small sets in convex geometry and formal independence over ZFC
Abstract and Applied Analysis, Volume 2005, Issue 5, Page 469-488, 2005., 2005 To each closed subset S of a finite‐dimensional Euclidean space corresponds a σ‐ideal of sets 𝒥 (S) which is σ‐generated over S by the convex subsets of S. The set‐theoretic properties of this ideal hold geometric information about the set. We discuss the relation of reducibility between convexity ideals and the connections between convexity ideals and
Menachem Kojman
wiley +1 more source
ISABELLE - THE NEXT 700 THEOREM PROVERS [PDF]
, 1988 Isabelle is a generic theorem prover, designed for interactive reasoning in a variety of formal theories. At present it provides useful proof procedures for Constructive Type Theory, various first-order logics, Zermelo-Fraenkel set theory, and higher ...
PAULSON, LC
core +1 more source
Encoding TLA+ set theory into many-sorted first-order logic [PDF]
, 2015 We present an encoding of Zermelo-Fraenkel set theory into many-sorted first-order logic, the input language of state-of-the-art SMT solvers.
Merz, Stephan, Vanzetto, Hernán
core +3 more sources
Binary Relations as a Foundation of Mathematics [PDF]
, 2007 We describe a theory for binary relations in the Zermelo-Fraenkel style. We choose for ZFCU, a variant of ZFC Set theory in which the Axiom of Foundation is replaced by an axiom allowing for non-wellfounded sets.
Kuper, J.
core +1 more source
PARACONSISTENT AND PARACOMPLETE ZERMELO–FRAENKEL SET THEORY [PDF]
, 2023 Yurii Khomskii, Hrafn Valtýr Oddsson
openalex +1 more source
Application of formative processes to the decision problem in set theory
Le Matematiche, 2004 As part of a project aimed at the implementation of a proof-checker based on the set-theoretic formalism, the decision problem in set theory has been studied very intensively, starting in the late seventies.Several results have been produced in the ...
Domenico Cantone, Pietro Ursino
doaj
Set Matrix Theory as a Physically Motivated Generalization of\n Zermelo-Fraenkel Set Theory [PDF]
, 2012 Marcoen J. T. F. Cabbolet +1 more
openalex +2 more sources
The concept of strong and weak virtual reality
, 2006 We approach the virtual reality phenomenon by studying its relationship to set theory, and we investigate the case where this is done using the wellfoundedness property of sets.
A. Baltag +7 more
core +1 more source