Add to ORKGsummary:A constructively valid counterpart to Bourbaki's Fixpoint Lemma for chain-complete partially ordered sets is presented to obtain a condition for one closure system in a complete lattice $L$ to be stable under another closure operator of $L$. This is then used to deal with coproducts and other aspects of frames
AbstractAn elementary combinatorial proof is presented of the following fixed point theorem: Let P b...
Approximation fixpoint theory (AFT) is an algebraical study of fixpoints of lattice operators. This ...
[eng] The celebrated Kleene fixed point theorem is crucial in the mathematical modelling of recursiv...
Abstract. A constructively valid counterpart to Bourbaki’s Fixpoint Lemma for chain-complete partial...
summary:A constructively valid counterpart to Bourbaki's Fixpoint Lemma for chain-complete partially...
AbstractIn the effective topos there exists a chain-complete distributive lattice with a monotone an...
The basic Zermelo-Bourbaki fixed point principle is being enlarged from a technical viewpoint. Some ...
It is well known that closure operators on a complete lattice, ordered pointwise, give rise to a com...
I. Introduction. A partially ordered set P is co-chain complete if every countable chain (including ...
A partially ordered set is ω-chain complete if, for every countable chain, or ω-chain, in P, the lea...
Some recent results provide sufficient conditions for complete lattices of closure operators on comp...
AbstractSome recent results provide sufficient conditions for complete lattices of closure operators...
In this paper, a theorem on the existence of complete embedding of partially ordered monoids into co...
Two fixed point theorems implementing a more general principle for partially ordered sets (which is ...
summary:In this paper the notion of weak chain-completeness is introduced for pseudo-ordered sets as...
AbstractAn elementary combinatorial proof is presented of the following fixed point theorem: Let P b...
Approximation fixpoint theory (AFT) is an algebraical study of fixpoints of lattice operators. This ...
[eng] The celebrated Kleene fixed point theorem is crucial in the mathematical modelling of recursiv...
Abstract. A constructively valid counterpart to Bourbaki’s Fixpoint Lemma for chain-complete partial...
summary:A constructively valid counterpart to Bourbaki's Fixpoint Lemma for chain-complete partially...
AbstractIn the effective topos there exists a chain-complete distributive lattice with a monotone an...
The basic Zermelo-Bourbaki fixed point principle is being enlarged from a technical viewpoint. Some ...
It is well known that closure operators on a complete lattice, ordered pointwise, give rise to a com...
I. Introduction. A partially ordered set P is co-chain complete if every countable chain (including ...
A partially ordered set is ω-chain complete if, for every countable chain, or ω-chain, in P, the lea...
Some recent results provide sufficient conditions for complete lattices of closure operators on comp...
AbstractSome recent results provide sufficient conditions for complete lattices of closure operators...
In this paper, a theorem on the existence of complete embedding of partially ordered monoids into co...
Two fixed point theorems implementing a more general principle for partially ordered sets (which is ...
summary:In this paper the notion of weak chain-completeness is introduced for pseudo-ordered sets as...
AbstractAn elementary combinatorial proof is presented of the following fixed point theorem: Let P b...
Approximation fixpoint theory (AFT) is an algebraical study of fixpoints of lattice operators. This ...
[eng] The celebrated Kleene fixed point theorem is crucial in the mathematical modelling of recursiv...