Results 31 to 40 of about 6,858,530 (350)
Countable Dimensional Universal Sets [PDF]
Transactions of the American Mathematical Society, 1986 The main results of this paper are a construction of a countable union of zero dimensional sets in the Hilbert cube whose complement does not contain any subset of finite dimension n ⩾ 1 n \geqslant 1 (Theorem 2.1, Corollary 2.3) and a construction of universal sets for the transfinite extension of the Menger ...
openaire +1 more source
Algebraic and logical descriptions of generalized trees [PDF]
Logical Methods in Computer Science, 2017 Quasi-trees generalize trees in that the unique "path" between two nodes may be infinite and have any countable order type. They are used to define the rank-width of a countable graph in such a way that it is equal to the least upper-bound of the rank ...
Bruno Courcelle
doaj +1 more source
Ratio Mathematica, 2015 In this paper, we investigate some results on hoop algebras and hyper hoop-algebras. We construct a hoop and a hyper hoop on any countable set. Then using the notion of the fundamental relation we define the fundamental hoop and we show that any hoop is ...
R.A. Borzooei, H.R. Varasteh, K. Borna
doaj +1 more source
On Some Residual Properties of the Verbal Embeddings of Groups [PDF]
Advances in Group Theory and Applications, 2016 We consider verbal embedding constructions preserving some residual properties for groups. An arbitrary residually finite countable group $H$ has a $V$-verbal embedding into a residually finite $2$-generator group $G$ for any non-trivial word set $V$. If
Vahagn H. Mikaelian
doaj +1 more source
Countable ordinals and the analytical hierarchy, I [PDF]
, 1975 The following results are proved, using the axiom of Projective Determinacy: (i) For n ≥ 1, every II(1/2n+1) set of countable ordinals contains a Δ(1/2n+1) ordinal, (ii) For n ≥ 1, the set of reals Δ(1/2n) in an ordinal is equal to the largest countable ...
Kechris, A. S.
core +2 more sources
Every metric space is separable in function realizability [PDF]
Logical Methods in Computer Science, 2019 We first show that in the function realizability topos every metric space is separable, and every object with decidable equality is countable. More generally, working with synthetic topology, every $T_0$-space is separable and every discrete space is ...
Andrej Bauer, Andrew Swan
doaj +1 more source
Semialgebraic Graphs having Countable List-Chromatic Numbers [PDF]
, 2015 The set of semialgebraic graphs having countable list-chromatic numbers is characterized. Some other related sets of graphs having countable list-chromatic numbers also are.Comment: This version has been completely rewritten.
Schmerl, James H.
core +1 more source
Markov model of option pricing
Lietuvos Matematikos Rinkinys, 2021 In the article is proposed the algorithm of modeling the dynamics of asset prices by Markov process with continuous time and countable set of states and numerical option pricing.
Eimutis Valakevičius
doaj +1 more source
The least core, kernel and bargaining sets of large games [PDF]
, 1998 We study the least core, the kernel and bargaining sets of coalitional games with a countable set of players. We show that the least core of a continuous superadditive game with a countable set of players is a non-empty (norm-compact) subset of the space
Einy, Ezra, Monderer, Dov, Moreno, Diego
core +2 more sources
Positive families and Boolean chains of copies of ultrahomogeneous structures
Comptes Rendus. Mathématique, 2020 A family of infinite subsets of a countable set $X$ is called positive iff it is closed under supersets and finite changes and contains a co-infinite set.
Kurilić, Miloš S. +1 more
doaj +1 more source