Results 161 to 170 of about 1,324,125 (192)
Some of the next articles are maybe not open access.
Topological Games and Hyperspace Topologies
Set-Valued Analysis, 1998The author uses the ``approach spaces'' of \textit{R. Lowen} [Approach spaces: the missing link in the topology-uniformity-metric triad (1997; Zbl 0891.54001)] to give a unified treatment of various hypertopologies and their properties such as separation axioms, metrizability etc.
openaire +1 more source
THE INDISCERNIBLE TOPOLOGY: A MOCK ZARISKI TOPOLOGY
Journal of Mathematical Logic, 2001We associate with every first order structure [Formula: see text] a family of invariant, locally Noetherian topologies (one topology on each Mn). The structure is almost determined by the topologies, and properties of the structure are reflected by topological properties. We study these topologies in particular for stable structures. In nice cases, we
Junker, Markus, Lascar, Daniel
openaire +3 more sources
The Topology of Free Topological Groups
Journal of Mathematical Sciences, 2005This paper deals with the notion of the free topological group \(F(X)\) in the sense of Markov and with the topological Abelian group \(A(X)\) which is generated by a Tikhonov space \(X\). A variety of results is presented to demonstrate how useful explicit descriptions of the topologies on these groups are.
openaire +2 more sources
SIAM Journal on Algebraic Discrete Methods, 1983
The authors present a number of results on comparison of the topological bandwidth of a graph to other graphical invariant, such as cutwidth, modified cutwidth, search number, and node search number. For binary trees of order n, a 0(n log n) algorithm to compute their topological bandwidth is obtained.
Fillia Makedon +2 more
openaire +2 more sources
The authors present a number of results on comparison of the topological bandwidth of a graph to other graphical invariant, such as cutwidth, modified cutwidth, search number, and node search number. For binary trees of order n, a 0(n log n) algorithm to compute their topological bandwidth is obtained.
Fillia Makedon +2 more
openaire +2 more sources
Journal of Symbolic Logic, 1969
The purpose of this paper is to present a very versatile family of logical systems ofpositionalortopologicallogic. These systems—obtained by generalizing the existing systems of chronological logic—are to have a very general nature, capable of reflecting the characteristics of a wide range of logical systems, including not only chronological ...
Nicholas Rescher, James W. Garson
openaire +1 more source
The purpose of this paper is to present a very versatile family of logical systems ofpositionalortopologicallogic. These systems—obtained by generalizing the existing systems of chronological logic—are to have a very general nature, capable of reflecting the characteristics of a wide range of logical systems, including not only chronological ...
Nicholas Rescher, James W. Garson
openaire +1 more source
Topology and Topological Spaces
1997We have now seen four different proofs of the Fundamental Theorem of Algebra. The first two were purely analysis, while the second pair involved a wide collection of algebraic ideas. However, we should realize that even in these algebraic proofs we did not totally leave analysis.
Benjamin Fine, Gerhard Rosenberger
openaire +1 more source
On a topological observation connected with topology and *-topology
2018Valuable collections such as semiopen, *-open, semi*-I-open etc. have been handled in the most of the research areas of the topology for many applications. In the present paper, a new topological collection, namely semi(I)*-open sets, containing topology and *-topology is introduced and studied.
openaire +2 more sources
Topology Optimized Architectures with Programmable Poisson's Ratio over Large Deformations
Advanced Materials, 2015Anders Clausen +2 more
exaly