Weak locale quotient morphisms and locally connected frames

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Representing Geometric Morphisms Using Power Locale Monads

It it shown that geometric morphisms between elementary toposes can be represented as adjunctions between the corresponding categories of locales. These adjunctions are characterised as those that preserve the order enrichment, commute with the double power locale monad and whose right adjoints preserve finite coproduct. They are also characterised as those adjunctions that preserve the order e...

متن کامل

Toroidalization of locally toroidal morphisms of 3-folds

A toroidalization of a dominant morphism $varphi: Xto Y$ of algebraic varieties over a field of characteristic zero is a toroidal lifting of $varphi$ obtained by performing sequences of blow ups of nonsingular subvarieties above $X$ and $Y$. We give a proof of toroidalization of locally toroidal morphisms of 3-folds.

متن کامل

Weak morphisms of higher dimensional automata

We introduce weak morphisms of higher dimensional automata and use them to define preorder relations for HDAs, among which homeomor-phic abstraction and trace equivalent abstraction. It is shown that homeomor-phic abstraction is essentially always stronger than trace equivalent abstraction. We also define the trace language of an HDA and show that, for a large class of HDAs, it is invariant und...

متن کامل

Locally Connected Recursion Categories

A recursion category is locally connected if connected domains are jointly epimorphic. New proofs of the existence of non-complemented and recursively inseparable domains are given in a locally connected category. The use of local connectedness to produce categorical analogs of undecidable problems is new; the approach allows us to relax the hypotheses under which the results were originally pr...

متن کامل

Locally Connected Recurrent Networks

The fully connected recurrent network (FRN) using the on-line training method, Real Time Recurrent Learning (RTRL), is computationally expensive. It has a computational complexity of O(N 4) and storage complexity of O(N 3), where N is the number of non-input units. We have devised a locally connected recurrent model which has a much lower complexity in both computational time and storage space....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Pure and Applied Algebra

سال: 1996

ISSN: 0022-4049

DOI: 10.1016/0022-4049(95)00100-x