A generalisation of Scott's information systems [15] is presented that captures exactly all L-domains. The global consistency predicate in Scott's definition is relativised in such a way that there is a consistency predicate for each atomic proposition (token) saying which finite sets of such statements express information that is consistent with the given statement.

It is shown that the states of such generalised information systems form an L-domain, and that each L-domain can be generated in this way, up to isomorphism. Moreover, the equivalence of the category of generalised information systems with the category of L-domains is derived. In addition, it will be seen that from every generalised information system capturing an algebraic bounded-complete domain a corresponding Scott information system can be obtained in an easy and natural way, and vice versa; similarly for Hoofman's continuous information systems [9] and the continuous bounded-complete domains captured by them; for Chen and Jung's disjunctive propositional logic [4] and algebraic L-domains (as well as for Wang and Li's [21] finitary version and Lawson-compact algebraic L-domains); and for Wang and Li's conjunctive sequent calculi [20] and proper continuous bounded-complete domains. The proofs always contain syntactic translations between the logical calculi involved.

提出了斯科特信息系统的一般化[15]，该信息准确地捕获了所有L域。相对于斯科特定义中的全局一致性谓词，每个原子命题（代币）都有一个一致性谓词，表示这样的有限语句集合表达与给定语句一致的信息。

结果表明，这种通用信息系统的状态形成一个L域，并且每个L域都可以这种方式生成，直到同构为止。此外，推导了广义信息系统的类别与L域的类别的等价性。另外，可以看到，从捕获代数有界完全域的每个广义信息系统中，可以以简单自然的方式获得相应的斯科特信息系统，反之亦然；反之亦然。对于霍夫曼的连续信息系统[9]以及由它们捕获的连续有界完整域，也是如此；对于陈和荣格的析取命题逻辑[4]和代数L-域（以及对于王和李的[21]最终版本和劳森-紧致代数L-域）；对于王和李 结膜继发结石[20]和适当的连续有界-完全域。证明总是包含所涉及的逻辑计算之间的句法翻译。