minimal fixed point
Recently Published Documents


TOTAL DOCUMENTS

6
(FIVE YEARS 0)

H-INDEX

3
(FIVE YEARS 0)

2013 ◽  
Vol 2013 ◽  
pp. 1-6
Author(s):  
Zhilong Li ◽  
Shujun Jiang

We presented some maximal and minimal fixed point theorems of set-valued monotone mappings with respect to a partial order introduced by a vector functional in cone metric spaces. In addition, we proved not only the existence of maximal and minimal fixed points but also the existence of the largest and the least fixed points of single-valued increasing mappings. It is worth mentioning that the results on single-valued mappings in this paper are still new even in the case of metric spaces and hence they indeed improve the recent results.


1995 ◽  
Vol 2 (29) ◽  
Author(s):  
Nils Klarlund

Binary Decision Diagrams are in widespread use in verification systems<br />for the canonical representation of Boolean functions. A BDD representing<br />a function phi : B^nu -> N can easily be reduced to its canonical form in<br />linear time.<br />In this paper, we consider a natural online BDD refinement problem<br />and show that it can be solved in O(n log n) if n bounds the size of the<br />BDD and the total size of update operations.<br />We argue that BDDs in an algebraic framework should be understood<br />as minimal fixed points superimposed on maximal fixed points. We propose<br />a technique of controlled growth of equivalence classes to make the<br />minimal fixed point calculations be carried out efficiently. Our algorithm<br />is based on a new understanding of the interplay between the splitting<br />and growing of classes of nodes.<br />We apply our algorithm to show that automata with exponentially<br />large, but implicitly represented alphabets, can be minimized in time<br />O(n log n), where n is the total number of BDD nodes representing the<br />automaton.


1991 ◽  
Vol 56 (4) ◽  
pp. 1452-1468 ◽  
Author(s):  
James Cain ◽  
Zlatan Damnjanovic

AbstractIt is well known that the following features hold of AR + T under the strong Kleene scheme, regardless of the way the language is Gödel numbered:1. There exist sentences that are neither paradoxical nor grounded.2. There are fixed points.3. In the minimal fixed point the weakly definable sets (i.e., sets definable as {n ∣ A(n) is true in the minimal fixed point}, where A(x) is a formula of AR + T) are precisely the sets.4. In the minimal fixed point the totally defined sets (sets weakly defined by formulae all of whose instances are true or false) are precisely the sets.5. The closure ordinal for Kripke's construction of the minimal fixed point is .In contrast, we show that under the weak Kleene scheme, depending on the way the Gödel numbering is chosen:1. There may or may not exist nonparadoxical, ungrounded sentences.2. The number of fixed points may be any positive finite number, ℵ0, or .3. In the minimal fixed point, the sets that are weakly definable may range from a subclass of the sets 1-1 reducible to the truth set of AR to the sets, including intermediate cases.4. Similarly, the totally definable sets in the minimal fixed point range from precisely the arithmetical sets up to precisely the sets.5. The closure ordinal for the construction of the minimal fixed point may be ω, , or any successor limit ordinal in between.In addition we suggest how one may supplement AR + T with a function symbol interpreted by a certain primitive recursive function so that, irrespective of the choice of the Gödel numbering, the resulting language based on the weak Kleene scheme has the five features noted above for the strong Kleene language.


Sign in / Sign up

Export Citation Format

Share Document