AbstractGiven is an ordered set in which every chain has an upper bound and every pair of elements has a greatest lower bound. Let Z be its set of maximal elements and let F be a function from Z to Z. A condition is presented that implies that F has a unique fixpoint. This is a generalization of a theorem of Naundorf. In Naundorf's theorem, the condition is related to causality for behaviour that develops in time
A partially ordered set P is ω-chain complete if every countable chain (including the empty set) in ...
In the context of abstract interpretation for languages without higher-order features we study the n...
AbstractGiven an instance of the maximum satisfiability problem involving n logical variables, truth...
Given is an ordered set in which every chain has an upper bound and every pair of elements has a gre...
AbstractGiven is an ordered set in which every chain has an upper bound and every pair of elements h...
Given a non-empty strictly inductive poset X, that is, a non-empty partially ordered set such that e...
Knaster-Tarski's theorem, characterising the greatest fixpoint of a monotone function over a complet...
AbstractThe denotational semantics of a deterministic timed system can be described by a function F:...
I try to come up with general techniques for approximating least fixpoints from below and greatest fix...
summary:A constructively valid counterpart to Bourbaki's Fixpoint Lemma for chain-complete partially...
AbstractThe mathematical semantics of programming languages is based largely on certain algebraic st...
A partially ordered set is ω-chain complete if, for every countable chain, or ω-chain, in P, the lea...
AbstractWe unveil new results based on measurement that guarantee the existence of unique fixed poin...
NASHINE, HEMANT KUMAR/0000-0002-0250-9172; Altun, Ishak/0000-0002-7967-0554; NASHINE, HEMANT KUMAR/0...
AbstractWe prove that if L is a semimodular lattice of finite length (with least element 0 and great...
A partially ordered set P is ω-chain complete if every countable chain (including the empty set) in ...
In the context of abstract interpretation for languages without higher-order features we study the n...
AbstractGiven an instance of the maximum satisfiability problem involving n logical variables, truth...
Given is an ordered set in which every chain has an upper bound and every pair of elements has a gre...
AbstractGiven is an ordered set in which every chain has an upper bound and every pair of elements h...
Given a non-empty strictly inductive poset X, that is, a non-empty partially ordered set such that e...
Knaster-Tarski's theorem, characterising the greatest fixpoint of a monotone function over a complet...
AbstractThe denotational semantics of a deterministic timed system can be described by a function F:...
I try to come up with general techniques for approximating least fixpoints from below and greatest fix...
summary:A constructively valid counterpart to Bourbaki's Fixpoint Lemma for chain-complete partially...
AbstractThe mathematical semantics of programming languages is based largely on certain algebraic st...
A partially ordered set is ω-chain complete if, for every countable chain, or ω-chain, in P, the lea...
AbstractWe unveil new results based on measurement that guarantee the existence of unique fixed poin...
NASHINE, HEMANT KUMAR/0000-0002-0250-9172; Altun, Ishak/0000-0002-7967-0554; NASHINE, HEMANT KUMAR/0...
AbstractWe prove that if L is a semimodular lattice of finite length (with least element 0 and great...
A partially ordered set P is ω-chain complete if every countable chain (including the empty set) in ...
In the context of abstract interpretation for languages without higher-order features we study the n...
AbstractGiven an instance of the maximum satisfiability problem involving n logical variables, truth...