On an open problem of Amadio and Curien: The finite antichain condition

نویسندگان

  • Guo-Qiang Zhang
  • Ying Jiang
چکیده

More than a dozen years ago, Amadio [1] (see Amadio and Curien [2] as well) raised the question of whether the category of stable bifinite domains of Amadio-Droste [1,6,7] is the largest cartesian closed full sub-category of the category of ω-algebraic meet-cpos with stable functions. A solution to this problem has two major steps: (1) Show that for any ω-algebraic meet-cpo D, if all higher-order stable function spaces built from D are ω-algebraic, then D is finitary (i.e., it satisfies the so-called axiom I); (2) Show that for any ω-algebraic meet-cpo D, if D violates MI , then [D → D] violates either M or I. We solve the first part of the problem in this paper, i.e., for any ω-algebraic meet-cpo D, if the stable function space [D → D] satisfies M, then D is finitary. Our notion of (mub, meet)-closed set, which is introduced for step 1, will also be used for treating some example cases in step 2.

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

ثبت نام

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

منابع مشابه

An Algorithm based on Predicting the Interface in Phase Change Materials

Phase change materials are substances that absorb and release thermal energy during the process of melting and freezing. This characteristic makes phase change material (PCM)  a favourite choice to integrate it in buildings. Stephan problem including melting and solidification in PMC materials is an practical problem in many engineering processes. The position of the moving boundary, its veloci...

متن کامل

Antichain Algorithms for Finite Automata

We present a general theory that exploits simulation relations on transition systems to obtain antichain algorithms for solving the reachability and repeated reachability problems. Antichains are more succinct than the sets of states manipulated by the traditional fixpoint algorithms. The theory justifies the correctness of the antichain algorithms, and applications such as the universality pro...

متن کامل

A Classification of Antichains of Finite Tournaments

Tournament embedding is an order relation on the class of finite tournaments. An antichain is a set of finite tournaments that are pairwise incomparable in this ordering. We say an antichain A can be extended to an antichain B if A ⊆ B. Those finite antichains that can not be extended to antichains of arbitrarily large finite cardinality are exactly those that contain a member of each of four f...

متن کامل

A novel computational procedure based on league championship algorithm for solving an inverse heat conduction problem

Inverse heat conduction problems, which are one of the most important groups of problems, are often ill-posed and complicated problems, and their optimization process has lots of local extrema. This paper provides a novel computational procedure based on finite differences method and league championship algorithm to solve a one-dimensional inverse heat conduction problem. At the beginning, we u...

متن کامل

Weakly Distributive Domains

In our previous work [17] we have shown that for any ω-algebraic meet-cpo D, if all higher-order stable function spaces built from D are ω-algebraic, then D is finitary. This accomplishes the first of a possible, two-step process in solving the problem raised in [1, 2]: whether the category of stable bifinite domains of Amadio-Droste-Göbel [1, 6] is the largest cartesian closed full subcategory...

متن کامل

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


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

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

ثبت نام

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

عنوان ژورنال:
  • Inf. Comput.

دوره 202  شماره 

صفحات  -

تاریخ انتشار 2005