Results 1  10
of
1,461
A Borsuk theorem on homotopy types
 Journal of Formalized Mathematics
, 1991
"... Summary. We present a Borsuk’s theorem published first in [1] (compare also [2, pages 119–120]). It is slightly generalized, the assumption of the metrizability is omitted. We introduce concepts needed for the formulation and the proofs of the theorems on upper semicontinuous decompositions, retrac ..."
Abstract

Cited by 108 (6 self)
 Add to MetaCart
Summary. We present a Borsuk’s theorem published first in [1] (compare also [2, pages 119–120]). It is slightly generalized, the assumption of the metrizability is omitted. We introduce concepts needed for the formulation and the proofs of the theorems on upper semicontinuous decompositions
THE NONEXISTENCE OF CONTINUOUS DECOMPOSITIONS OF 3MANIFOLDS INTO ABSOLUTE RETRACTS
"... ABSTRACT. It is shown that the only continuous decomposition of a 3manifold without boundary into absolute retracts is the trivial decomposition into points. 1. Introduction. In 1936, J. H. Roberts [8] produced an example of an upper semicontinuous decomposition of the plane each element of which ..."
Abstract
 Add to MetaCart
ABSTRACT. It is shown that the only continuous decomposition of a 3manifold without boundary into absolute retracts is the trivial decomposition into points. 1. Introduction. In 1936, J. H. Roberts [8] produced an example of an upper semicontinuous decomposition of the plane each element of which
MAP~NGTHEOREMSFORPLANECONTINUA
"... In 1927 Kuratowski [12, p. 262] defined a continuum M to be of type A if M is irreducible and every indecomposable continuum in M is a continuum of condensation. If a con tinuum M is of type A, then M admits a monotone upper semi continuous decomposition to an arc with the property that each element ..."
Abstract
 Add to MetaCart
In 1927 Kuratowski [12, p. 262] defined a continuum M to be of type A if M is irreducible and every indecomposable continuum in M is a continuum of condensation. If a con tinuum M is of type A, then M admits a monotone upper semi continuous decomposition to an arc with the property that each
Computability on Continuous, Lower SemiContinuous and Upper SemiContinuous Real Functions
 PP.109Â133 IN THEORETICAL COMPUTER SCIENCE VOL.234
, 1996
"... In this paper we investigate continuous and upper and lower semicontinuous real functions in the framework of TTE, Type2 Theory of Effectivity. First some basic facts about TTE are summarized. For each of the function spaces, we introduce several natural representations based on different intiuiti ..."
Abstract

Cited by 20 (4 self)
 Add to MetaCart
In this paper we investigate continuous and upper and lower semicontinuous real functions in the framework of TTE, Type2 Theory of Effectivity. First some basic facts about TTE are summarized. For each of the function spaces, we introduce several natural representations based on different
Upper SemiContinuous IntervalValued
"... It has been known since Cauchy’s time that if f is a continuous homomorphism on (R,+), then there is a constant c ∈ R such that f(x) = cx for all x ∈ R. The purpose of this paper is to extend this result to intervalvalued multifunctions on R as follows: For an intervalvalued multifunction f on R, ..."
Abstract
 Add to MetaCart
, f is an upper semicontinuous multihomomorphism on (R,+) if and only if f has one of the following forms:
SEMICONTINUITY FOR DERIVED CATEGORIES
, 2002
"... We prove that the number of parameters defining a complex of projective modules over an algebra is upper semicontinuous in families of algebras. Supposing that every algebra is either derived tame or derived wild, we get that a degeneration of a derived wild algebra is also derived wild. The proo ..."
Abstract
 Add to MetaCart
We prove that the number of parameters defining a complex of projective modules over an algebra is upper semicontinuous in families of algebras. Supposing that every algebra is either derived tame or derived wild, we get that a degeneration of a derived wild algebra is also derived wild
ON DIFFERENCES OF SEMICONTINUOUS FUNCTIONS
, 1999
"... Abstract. Extrinsic and intrinsic characterizations are given for the class DSC(K) of differences of semicontinuous functions on a Polish space K, and also decomposition characterizations of DSC(K) and the class PS(K) of pointwise stabilizing functions on K are obtained in terms of behavior restric ..."
Abstract
 Add to MetaCart
Abstract. Extrinsic and intrinsic characterizations are given for the class DSC(K) of differences of semicontinuous functions on a Polish space K, and also decomposition characterizations of DSC(K) and the class PS(K) of pointwise stabilizing functions on K are obtained in terms of behavior
Inverse limits with upper semicontinuous bonding functions
 of Natural Sciences and Mathematics, University of Maribor, Koroška 160, Maribor 2000, Slovenia (2) Faculty of Chemistry and Chemical Engineering, University of Maribor, Smetanova 17, Maribor 2000, Slovenia matevz.crepnjak@um.si Goran Erceg, Faculty of Na
"... Abstract. In their recent work on inverse limits with upper semicontinuous bonding functions, Ingram and Mahavier give various sufficient conditions for such an inverse limit space, lim← − f, to be a continuum. Here, we present additional conditions on the bonding functions (fi) that are sufficient ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
Abstract. In their recent work on inverse limits with upper semicontinuous bonding functions, Ingram and Mahavier give various sufficient conditions for such an inverse limit space, lim← − f, to be a continuum. Here, we present additional conditions on the bonding functions (fi
Semicontinuous sized types and termination
 In Zoltán Ésik, editor, Computer Science Logic, 20th International Workshop, CSL 2006, 15th Annual Conference of the EACSL
"... Abstract. Some typebased approaches to termination use sized types: an ordinal bound for the size of a data structure is stored in its type. A recursive function over a sized type is accepted if it is visible in the type system that recursive calls occur just at a smaller size. This approach is onl ..."
Abstract

Cited by 13 (5 self)
 Add to MetaCart
as functions from ordinals into sets of strongly normalizing terms. It is shown that upper semicontinuity of such functions is a sufficient semantic criterion for admissibility. To provide a syntactical criterion, a calculus for semicontinuous functions is developed. 1.
Results 1  10
of
1,461