The following pages link to (Q3326830):
Displaying 50 items.
- Re-visiting axioms of information systems (Q259056) (← links)
- Representations of algebraic domains and algebraic L-domains by information systems (Q276406) (← links)
- A note on finitely derived information systems (Q276427) (← links)
- Atomicity, coherence of information, and point-free structures (Q290637) (← links)
- Elements of generalized ultrametric domain theory (Q672055) (← links)
- I-categories as a framework for solving domain equations (Q685401) (← links)
- Using information systems to solve recursive domain equations (Q808273) (← links)
- Generalised information systems capture L-domains (Q831140) (← links)
- Prime algebraicity (Q843107) (← links)
- A representation of L-domains by information systems (Q896923) (← links)
- Non-deterministic information systems and their domains (Q914401) (← links)
- Information systems revisited -- the general continuous case (Q949623) (← links)
- Universal profinite domains (Q1093371) (← links)
- Full abstraction and limiting completeness in equational languages (Q1121676) (← links)
- Event structures and domains (Q1124367) (← links)
- Domain theory in logical form (Q1174593) (← links)
- Domains for logic programming (Q1185016) (← links)
- \(dI\)--domains as prime information systems (Q1198950) (← links)
- A co-induction principle for recursively defined domains (Q1318702) (← links)
- Information categories (Q1320330) (← links)
- Adequacy for a lazy functional language with recursive and polymorphic types (Q1349683) (← links)
- The presence of lattice theory in discrete problems of mathematical social sciences. Why. (Q1414820) (← links)
- Domain theory for concurrency (Q1434357) (← links)
- From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models (Q1583485) (← links)
- Fixed points of Scott continuous self-maps (Q1609606) (← links)
- Weak algebraic information systems and a new equivalent category of DOM of domains (Q1727992) (← links)
- On Scott's thesis for domains of information and well-quasi-orderings (Q1813971) (← links)
- Recursive domain equations for concrete data structure (Q1823005) (← links)
- Describing semantic domains with sprouts (Q1823713) (← links)
- Domain theoretic models of polymorphism (Q1824612) (← links)
- Building continuous webbed models for system F (Q1826624) (← links)
- New representations of algebraic domains and algebraic L-domains via closure systems (Q1982590) (← links)
- Information systems for continuous semi-lattices (Q2123056) (← links)
- Representations of stably continuous semi-lattices by information systems and abstract bases (Q2224847) (← links)
- The categorical equivalence between algebraic domains and F-augmented closure spaces. (Q2264118) (← links)
- A representation of continuous domains via relationally approximable concepts in a generalized framework of formal concept analysis (Q2302786) (← links)
- A categorical representation of algebraic domains based on variations of rough approximable concepts (Q2353995) (← links)
- Information systems for continuous posets (Q2367538) (← links)
- Some categorical aspects of information systems and domains (Q2432574) (← links)
- The categorical equivalence between domains and interpolative generalized closure spaces (Q2698278) (← links)
- Dedekind completion as a method for constructing new Scott domains (Q2841264) (← links)
- Representation of algebraic domains by formal association rule systems (Q2971115) (← links)
- Nominal Domain Theory for Concurrency (Q3644772) (← links)
- Nonflatness and totality (Q4611200) (← links)
- Consistent disjunctive sequent calculi and Scott domains (Q5048008) (← links)
- Algebraic specifications for domain theory (Q5096170) (← links)
- (Q5106330) (← links)
- Disjunctive systems and L-Domains (Q5204324) (← links)
- A representation of proper BC domains based on conjunctive sequent calculi (Q5220179) (← links)
- Various Constructions of Continuous Information Systems (Q5415627) (← links)
