Results 11 to 20 of about 112,755 (263)
INITIAL SELF-EMBEDDINGS OF MODELS OF SET THEORY [PDF]
The Journal of Symbolic Logic, 2021 AbstractBy a classical theorem of Harvey Friedman (1973), every countable nonstandard model $\mathcal {M}$ of a sufficiently strong fragment of ZF has a proper rank-initial self-embedding j, i.e., j is a self-embedding of $\mathcal {M}$ such that $j[\mathcal {M}]\subsetneq \mathcal {M}$ , and the ordinal rank of each member of $j[\mathcal {M ...
Ali Enayat, Zachiri McKenzie
openaire +3 more sources
IEEE Transactions on Visualization and Computer Graphics, 2023 Accepted by IEEE Transactions on Visualization and Computer Graphics (IEEE TVCG), 2022. All resources can be found at https://liruihui.github.io/
Ruihui Li +3 more
openaire +4 more sources
Self-Embeddings of Computable Trees [PDF]
Notre Dame Journal of Formal Logic, 2008 We divide the class of infinite computable trees into three types. For the first and second types, $0'$ computes a nontrivial self-embedding while for the third type $0''$ computes a nontrivial self-embedding. These results are optimal and we obtain partial results concerning the complexity of nontrivial self-embeddings of infinite computable trees ...
Stephen Binns +4 more
openaire +4 more sources
Self-embeddings of Bedford–McMullen carpets [PDF]
Ergodic Theory and Dynamical Systems, 2017 Let$F\subseteq \mathbb{R}^{2}$be a Bedford–McMullen carpet defined by multiplicatively independent exponents, and suppose that either$F$is not a product set, or it is a product set with marginals of dimension strictly between zero and one. We prove that any similarity$g$such that$g(F)\subseteq F$is an isometry composed of reflections about lines ...
Algom, Amir, Hochman, Michael
openaire +3 more sources
Self-embedding indexed grammars
Theoretical Computer Science, 1986 The notion `self-embedding' is defined for (right-linear, linear) indexed grammars and languages, and it is shown that non self-embedding (right- linear, linear) indexed languages are exactly the (right-linear, linear) context-free languages.
Rainer Parchmann, Jürgen Duske
openaire +2 more sources
Self-embeddings of Kleinian groups [PDF]
Annales Scientifiques de l’École Normale Supérieure, 1998 The authors give sufficient conditions for a geometrically finite Kleinian group \(G\) acting in the hyperbolic space \({\mathbf H}^n\) to have a co-Hopf property, i.e. not to contain non-trivial proper subgroup isomorphic to itself. The main result of the article is the following.
Ohshika, Ken'ichi, Potyagailo, Leonid
openaire +2 more sources
On self-embeddings of computable linear orderings
Annals of Pure and Applied Logic, 2006 The authors prove that there exists a computable linear ordering without nontrivial \({\mathbf 0}^\prime\)-computable self-embeddings. It appeared that the previously published proof of this statement in [\textit{S. Lempp, A. Morozov, C. McCoy} and \textit{D. R. Solomon}, ``On self-embeddings of computable linear orders'', in: S. B. Cooper et al. (eds.)
Rodney G. Downey +2 more
openaire +3 more sources
Nearest Embedded and Embedding Self-Nested Trees
Algorithms, 2019 Self-nested trees present a systematic form of redundancy in their subtrees and thus achieve optimal compression rates by directed acrylic graph (DAG) compression. A method for quantifying the degree of self-similarity of plants through self-nested trees
Romain Azaïs
doaj +1 more source
On computable self-embeddings of computable linear orderings [PDF]
The Journal of Symbolic Logic, 2009 AbstractWe solve a longstanding question of Rosenstein, and make progress toward solving a long-standing open problem in the area of computable linear orderings by showing that every computableη-like linear ordering without an infinite stronglyη-like interval has a computable copy without nontrivial computable self-embedding.The precise ...
Downey, Rodney G. +2 more
openaire +2 more sources
Multi-label Classification Based on Label-Aware Variational Autoencoder [PDF]
Jisuanji kexue yu tansuoWith the rise of the Internet, all kinds of data are growing rapidly, and how to utilize these sample data efficiently has become an important issue in the field of data mining.
SUN Hongjian, XU Pengyu, LIU Bing, JING Liping, YU Jian
doaj +1 more source