This paper proves that the category of information systems with witnesses and approximable mappings is Cartesian closed, providing a direct proof and showing the natural information system structure of mappings.
Contribution
It offers a direct proof of the Cartesian closure of the category of information systems with witnesses, enhancing understanding of their algebraic structure.
Findings
01
The category of information systems with witnesses is Cartesian closed.
02
Approximable mappings form a natural information system structure.
03
Provides a direct proof of Cartesian closure, simplifying previous approaches.
Abstract
Information systems with witnesses have been introduced in [D. Spreen. Generalised information systems capture L-domains. arXiv:1610.02260v2] as a logic-style representation of L-domains: The category of such information systems with approximable mappings as morphisms is equivalent to the category of L-domains with Scott continuous functions, which is known to be Cartesian closed. In the present paper a direct proof of the Cartesian closure of the category of information systems with witnesses and approximable mapppings is given. As is shown, the collection of approximable mappings between two information systems with witnesses comes with a natural information system structure.
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRough Sets and Fuzzy Logic · Data Visualization and Analytics · Topological and Geometric Data Analysis
Full text
Information Systems with Witnesses:
The Function Space Construction
††thanks: The research leading to these results has received funding from the People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme FP7/2007-2013/ under REA grant agreement no. PIRSES-GA-2013-612638-CORCON.
Dieter Spreen
Department of Mathematics, University of Siegen
57068 Siegen, Germany
and
Department of Decision Sciences, University of South Africa
P.O. Box 392, 0003 Pretoria, South Africa
Abstract
Information systems with witnesses have been introduced in Ref. [1] as a logic-style representation of L-domains: The category of such information systems with approximable mappings as morphisms is equivalent to the category of L-domains with Scott continuous functions, which is known to be Cartesian closed. In the present paper a direct proof of the Cartesian closure of the category of information systems with witnesses and approximable mapppings is given. As is shown, the collection of approximable mappings between two information systems with witnesses comes with a natural information system structure.
1 Introduction
In a recent paper (Ref. [1]), the author introduced information systems with witnesses as a logic-style representation of L-domains. L-domains have independently been introduced by Coquand (cf. Ref. [2]) and Jung (cf. Refs. [3, 4]) and are known to form one of the two maximal Cartesian closed full subcategories of the continuous domains. They generalise the bounded-complete ones: whereas in a bounded-complete domain every bounded subset has a global least upper bound, in an L-domain such sets may have different local least upper bounds depending on the upper bounds they have.
The idea to represent classes of domains via logical calculi goes back to Dana Scott’s seminal 1982 paper (cf. Ref. [5]), in which he introduced information systems to capture the bounded-complete algebraic domains. An information system consists of a set of tokens to be thought of as atomic statements about a computational process, a consistency predicate telling us which finite sets of such statements contain consistent information, and an entailment relation saying what atomic statements are entailed by which consistent sets of these. Theories of such a logic, also called states, i.e. finitely consistent and entailment-closed sets of atomic statements, form a domain with respect to set inclusion. A state represents consistent information. So, any finite collection of substates must contain consistent information as well, and this fact is witnessed by any of its upper bounds.
Whereas in Scott’s approach the consistency witnesses are hidden, in the new approach they are made explicit. This allows to consider the more general situation in which a finite set of tokens may have different consistency witnesses, and the result of entailment may depend on them. As was shown in Ref. [1], the theories, or states, of such a more general information system form an L-domain, and, up to isomorphism, each L-domain can be obtained in this way. Moreover, there is an equivalence between the categories of information systems with witnesses and L-domains.
The category of information systems has approximable mappings as morphisms. These are relations between the consistent subsets of one information system and the tokens of another. Entailment is a particular approximable mapping.
As mentioned earlier, the category of L-domains and Scott continuous functions is Cartesian closed. Because of the equivalence of this category with the category of information systems with witnesses we know that the latter one is Cartesian closed as well. However, this means that in concrete situations we have to pass back and forth between information systems and domains in order to construct the exponent of two information systems with witnesses. In this paper we present a direct proof of the Cartesian closure of the category of information systems with witnesses. In particular, we present a construction of the exponent. This will be an information system with witnesses the states of which are exactly the approximable mappings between the information systems under consideration.
Whereas for Scott’s information systems capturing the bounded-complete algebraic domains, the function space construction is straightforward and well understood, the situation is rather intricate in the present case. This due to the fact that consistency is only locally defined and we have to deal with consistency witnesses explicitly. Moreover, as is known from Hoofman’s work (cf. Ref. [6]), in the continuous case entailment is required to allow for interpolation.
The paper is organized as follows: Section 2 contains basic definitions and results from domain theory. In Section 3 relevant definitions and facts about information systems with witnesses are recalled from Ref. [1]. Approximable mappings between such information systems are considered in Section 4. Section 5 is concerned with the function space construction: an information system with witnesses is presented the states of which are exactly the approximable mappings between two given systems.
As is shown in Section 6, this information system is indeed the exponent of the two given ones.
The paper closes with the discussion of an application of the results obtained in proof assistants and program extraction.
2 Domains: basic definitions and results
For any set A, we write X⊆finA to mean that X is finite subset of A. The collection of all subsets of A will be denoted by P(A) and that of all finite subsets by Pf(A). Moreover, for two sets A1 and A2, we let (pr1 and (pr2, respectively, be the canonical projections of A1×A2 onto the first and second component. For ν,μ∈{1,2}, set (prν,μ=(prν∘(prμ.
Let (D,⊑) be a poset. D is pointed if it contains a least element ⊥. For an element x∈D, ↓x denotes the principal ideal generated by x, i.e., ↓x={y∈D∣y⊑x}. A subset S of D is called consistent if it has an upper bound. S is directed, if it is nonempty and every pair of elements in S has an upper bound in S. D is a directed-complete partial order (dcpo), if every directed subset S of D has a least upper bound ⨆S in D, and D is bounded-complete if every consistent subset has a least upper bound.
Assume that x,y are elements of a poset D. Then x is said to approximatey, written x≪y, if for any directed subset S of D the least upper bound of which exists in D, the relation y⊑⨆S always implies the existence of some u∈S with x⊑u. Moreover, x is compact if x≪x. A subset B of D is a basis of D, if for each x∈D the set \mathord{\mbox{\makebox[0.0pt][l]{\raisebox{-1.72218pt}{\downarrow}}\downarrow\,}}\!_{B}x=\{\,u\in B\mid u\ll x\,\} contains a directed subset with least upper bound x. Note that the set of all compact elements of D is included in every basis of D. A directed-complete partial order D is said to be continuous (or a domain) if it has a basis and it is called algebraic (or an algebraic domain) if its compact elements form a basis. A pointed bounded-complete domain is called bc-domain. Standard references for domain theory and its applications are [11, 10, 7, 12, 8, 9].
Lemma 2.1**.**
In a poset D the following statements hold for all x,y,z∈D:
The approximation relation ≪ is transitive.
2. 2.
x≪y⟹x⊑y.
3. 3.
x≪y⊑z⟹x≪z.
4. 4.
If D has a least element ⊥, then ⊥≪x.
5. 5.
If F⊆↓x∩↓y such that the least upper bounds ⨆xF and ⨆yF, respectively, exist relative to ↓x and ↓y, then
[TABLE]
6. 6.
If D is a continuous domain with basis B, and M⊆finD, then
Let D and D′ be posets. A function f:D→D′ is Scott continuous if it is monotone and for any directed subset S of D with existing least upper bound,
[TABLE]
With respect to the pointwise order the set [D→D′] of all Scott continuous functions between two dcpo’s D and D′ is a dcpo again. Observe that it need not be continuous even if D and D′ are. This is the case, however, if D′ is an L-domain (cf. Ref. [7]).
Definition 2.3**.**
A pointed111Note that in Ref. [9] pointedness is not required. domain D is an L-domain, if each pair x,y∈D bounded above by z∈D has a least upper bound x⊔zy in ↓z.
Obviously, every bc-domain is an L-domain.
As has been shown by Jung (cf. Refs. [3, 4]), the category L of L-domains is one of the two maximal Cartesian closed full subcategories of the category CONT⊥ of pointed domains and Scott continuous maps. The same holds for the category aL of algebraic L-domains with respect to the category ALG⊥ of pointed algebraic domains. The one-point domain is the terminal object in these categories and the categorical product D×E of two domains D and E is the Cartesian product of the underlying sets ordered coordinatewise.
For domains D and D′ and basic elements d∈D and d′∈D′ the single-step function(d↘d′):D→D′ is defined by
[TABLE]
As is well known, every Scott continuous function f:D→D′ is the least upper-bound of all single-step functions approximating it:
[TABLE]
In general, however, the set of these single-step functions is not directed. A way to get out of this problem is to require the existence of joins of bounded finite collections of single-step functions. Such joins are called step functions.
If D′ is bounded-complete, the pointwise least upper bound ⨆ν=1n(dν↘dν′) exists, if the set {dν′∣1≤ν≤n∧dν≪x} is bounded for all x∈D. The cost of generalising this to the case of L-domains is at least the burden of bookkeeping where least upper bounds are taken. In particular, if (dν↘dν′), ν=1,…,n, are single-step functions below f, then their least upper bound in ↓f, written ⨆1≤ν≤nf(dν↘dν′), is given by
[TABLE]
3 Information systems with witnesses
In this section, the ideas outlined in the introduction are made precise: An information system with witnesses consists of a set A of tokens, a consistency predicate (CON classifying which finite sets of tokens are consistent with which token as witness, and an entailment relation between pairs of consistent sets and associated witnesses on the one side, and arbitrary tokens on the other. The conditions that have to be satisfied are grouped. There are requirements which consistency predicate and entailment relation have to meet in which the consistency witness is kept fixed. They are well known from Scott’s information systems and Hoofman’s extension of this notion to the continuous case. In addition, we find conditions that specify the interplay between consistency witnesses.
Note that we sometimes write X∈(CON(i) instead of (i,X)∈(CON. Proofs of the results can be found in Ref. [1].
Definition 3.1**.**
Let A be a set, Δ∈A, (CON⊆A×Pf(A), and \mbox{\vdash}\subseteq\mathop{\mathstrut\rm CON}\nolimits\times A. Then (A,(CON,⊢,Δ) is an information system with witnesses if the following conditions hold, for all i,j,a∈A and all finite subsets X,Y of A:
{i}∈(CON(i)
2. 2.
Y⊆X∧X∈(CON(i)⇒Y∈(CON(i)
3. 3.
(i,∅)⊢Δ
4. 4.
X∈(CON(i)∧(i,X)⊢Y⇒Y∈(CON(i)
5. 5.
X,Y∈(CON(i)∧X⊆Y∧(i,X)⊢a⇒(i,Y)⊢a
6. 6.
X∈(CON(i)∧(i,X)⊢Y∧(i,Y)⊢a⇒(i,X)⊢a
7. 7.
(i,X)⊢a⇒(∃Z∈(CON(i))(i,X)⊢Z∧(i,Z)⊢a
8. 8.
(i,X)⊢Y⇒(∃e∈A)(i,X)⊢e∧Y∈(CON(e)
9. 9.
{i}∈(CON(j)⇒(CON(i)⊆(CON(j)
10. 10.
{i}∈(CON(j)∧X∈(CON(i)∧(i,X)⊢a⇒(j,X)⊢a
11. 11.
{i}∈(CON(j)∧X∈(CON(i)∧(j,X)⊢a⇒(i,X)⊢a
All requirements are very natural: Each token witnesses its own consistency (1). If the consistency of some set is witnessed by i, the same holds for all of its subsets (2). Δ is entailed by any set of information and each of its witnesses, i.e., it represents global truth (3). By Condition (4) entailment preserves consistency. If a set X with consistency witness i entails a, so does any bigger set with the same witness (5). For fixed witness, entailment is transitive (6). Consistency and entailment are preserved when moving from a witness i to another one j with respect to which i is consistent (9, 10). Moreover, entailment is conservative in that case: what is entailed with respect to witness j from a set consistent with respect to i is already entailed with respect to i (11). Conditions (7) and (8) are both interpolation properties. They can be combined into one, called Global Interpolation Property.
Lemma 3.2**.**
Let A be a set, Δ∈A, (CON⊆A×Pf(A), and \mbox{\vdash}\subseteq\mathop{\mathstrut\rm CON}\nolimits\times A such that Axioms 3.1(4, 5, 9-11) are satisfied. Then Axioms 3.1(7, 8) hold if, and only if, for all i∈A, X∈(Coni and F⊆finA,
Let A be a set, Δ∈A, (CON⊆A×Pf(A), and \mbox{\vdash}\subseteq\mathop{\mathstrut\rm CON}\nolimits\times A such that Axioms 3.1(4, 5, 7) are satisfied. Then the following rule holds, for all a∈A, F⊆finA and (i,X)∈(CON,
[TABLE]
Proof.
Let b∈F. By Axiom 3.1(7) there is some Zb∈(CON(i) with (i,X)⊢Zb and (i,Zb)⊢b. Set Z=⋃{Zb∣b∈F}. Then (i,X)⊢Z. Hence, Z∈(CON(i), by Condition 3.1(4). Because of Axiom 3.1(5) we therefore have that (i,Z)⊢F.
∎
Sometimes a stronger requirement than 3.1(6) is needed which reverses Condition 3.1(7).
Lemma 3.4**.**
Let (A,(CON,⊢,Δ) be an information system with witnesses. Then the following rule holds, for all a∈A and (i,X),(j,Y)∈(CON,
[TABLE]
To relate information systems to domains, the notion of state is required.
Definition 3.5**.**
Let (A,(CON,⊢,Δ) be an information system with witnesses. A subset x of A is a state of (A,(CON,⊢,Δ) if the following three conditions hold:
As follows from the definition, states are subsets of tokens that are finitely consistent (1) and closed under entailment (2). Furthermore, each token in a state is derivable (3), i.e. for each token the state contains a consistent set and its witness entailing the token.
By Condition 3.5(1) states are never empty: Choose F to be the empty set. Then the state contains some i with ∅∈(CON(i).
Note that Conditions (1, 3) in Definition 3.5 can be replaced by a single requirement.
Proposition 3.6**.**
Let (A,(CON,⊢,Δ) be an information system with witnesses and x be a subset of A. Then Conditions 3.5(1) and (3) together are equivalent to the following statement:
[TABLE]
With respect to set inclusion the states of A form a directed-complete partially ordered set, denoted by ∣A∣. Moreover, the consistent subsets of A generate a canonical basis of ∣A∣. For (i,X)∈(CON let
[TABLE]
Then [X]i is a state and for every z∈∣A∣, the set of all [X]i with {i}∪X⊆z is directed and z is its union.
This result allows characterising the approximation relation on A in terms of the entailment relation. The characterisation nicely reflects the intuition that x≪y, if x is covered by a “finite part” of y.
Proposition 3.7**.**
For x,y∈∣A∣,
[TABLE]
Because of Axioms 3.1(1, 2) we have that ∅∈(CON(i), for all i∈A. Moreover, with Axioms 3.1(3, 4), it follows that {Δ}∈(CON(j), for all j∈A. As is easily verified, [∅]i=[{Δ}]j, for all i,j∈A, and [∅]Δ⊆x, for all x∈∣A∣.
Local least upper bounds can be computed in a similar way as directed least upper bounds. Let x,y,z∈∣A∣ so that x,y⊆z. Then
[TABLE]
is the least upper bound of x and y in ↓z.
Theorem 3.8**.**
Let (A,(CON,⊢,Δ) be an information system with witnesses. Then L(A)=(∣A∣,⊆,[∅]Δ) is an L-domain with basis (CON={[X]i∣(i,X)∈(CON}.
Let us see next when L(A) is algebraic.
Definition 3.9**.**
Let (A,(CON,⊢,Δ) be an information system with witnesses. An element (j,V)∈(CON is called reflexive if (j,V)⊢(j,V).
Obviously, [V]j is compact, for every reflexive (j,V)∈(CON. We denote the subset of reflexive elements of (CON by (CONrefl.
Theorem 3.10**.**
Let (A,(CON,⊢,Δ) be an information system with witnesses. Then L(A) is algebraic if, and only if, the information system A satisfies Condition (ALG) saying that for all (i,X)∈(CON and F⊆finA,
[TABLE]
Condition (ALG) is a global interpolation requirement. Similarly to Lemma 3.2 it is equivalent to a local condition.
Lemma 3.11**.**
Condition (ALG) holds if, and only if, the following Condition (SALG) is satisfied for all (i,X)∈(CON and a∈A,
[TABLE]
In Scott’s information systems a finite set of tokens is consistent, if it has a consistency witness, independently of which token this might be. This provides us with a condition forcing an information system with witnesses to generate a bounded-complete domain.
Theorem 3.12**.**
Let (A,(CON,⊢,Δ) be an information system with witnesses. Then L(A) is bounded-complete, and hence a bc-domain, if the information system A satisfies Condition (BC) saying that for all X⊆finA and i,j∈A,
[TABLE]
It is unknown whether the requirement on A is also necessary.
So far, we have seen that information systems with witness generate L-domains. But the converse holds as well: Every L-domain defines a canonical information system with witnesses such that the L-domain generated by it is isomorphic to the given domain.
Let (D,⊑) be an L-domain with basis B and least element ⊥. Set I(D)=(B,(CON,⊢,⊥) with
[TABLE]
Theorem 3.13**.**
Let D be an L-domain. Then I(D) is an information system with witnesses such that D and L(I(D)) are isomorphic. In addition,
D* is algebraic if, and only if, the information system I(D) satisfies Condition (ALG).*
2. 2.
D* is bounded-complete if, and only if, Condition (BC) holds in I(D).*
4 Approximable mappings
In the next step we want to consider the appropriate morphisms between information systems with witnesses. They will be relations between the consistent sets and their consistency witnesses of one information system with witnesses and the tokens of another, just as the entailment relations.
Definition 4.1**.**
An approximable mappingH between information systems with witnesses (A,(CON,⊢,Δ) and (A′,(CON′,⊢′,Δ′), written H:A⊩A′, is a relation between (CON and A′ satisfying the following nine conditions, for all i,j∈A, X,X′⊆finA, b,k∈A′ and Y,F⊆finA′ with X∈(CON(i) and Y∈(CON′(k):
(Δ,∅)HΔ′.
2. 2.
X′∈(CON(i)∧X⊆X′∧(i,X)Hb⇒(i,X′)Hb
3. 3.
(i,X)⊢X′∧(i,X′)Hb⇒(i,X)Hb
4. 4.
(i,X)Hb⇒(∃U∈(CON(i))(i,X)⊢U∧(i,U)Hb
5. 5.
(i,X)H(k,Y)∧(k,Y)⊢′b⇒(i,X)Hb
6. 6.
(i,X)Hb⇒(∃(d,V)∈(CON′)(i,X)H(d,V)∧(d,V)⊢′b
7. 7.
(i,X)HF⇒(∃e∈A′)(i,X)He∧F∈(CON′(e).
8. 8.
{i}∈(CON(j)∧(i,X)Hb⇒(j,X)Hb
9. 9.
{i}∈(CON(j)∧(j,X)Hb⇒(i,X)Hb
Here, (i,X)HY means that (i,X)Hc, for all c∈Y, and (i,X)H(k,Y) that (i,X)Hk as well as (i,X)HY.
Note that because of Condition 3.1(5), Condition 4.1(2) follows from Conditions 4.1(3, 4).
The Left Interpolation Rule 4.1(4) together with the Conservativity Requirement 4.1(9) can be replaced by one rule.
Lemma 4.2**.**
Let (A,(CON,⊢,Δ) and (A′,(CON′,⊢′,Δ′) be information systems with witnesses. Then, for any H⊆(CON×A′ satisfying Conditions 4.1(2, 3, 8), any (i,X)∈(CON, and all F⊆finA′, Conditions 4.1(4, 9) together are equivalent to the following requirement:
[TABLE]
Proof.
Assume that Requirement (1) holds. Then Condition 4.1(4) follows as a special case because of Condition 4.1(8). For Condition 4.1(9) suppose that {i}∈(CON(j) and (j,X)Hb. With Requirement (1) we obtain that there is some (c,U)∈(CON so that (j,X)⊢(c,U) and (c,U)Hb. Since X∈(CON(i), it follows with Axiom 3.1(11) that (i,X)⊢(c,U). Thus, {c}∈(CON(i) and therefore (i,U)Hb, by Condition 4.1(8). With Condition 4.1(3) we finally obtain that (i,X)Hb.
Now, conversely, suppose that Conditions 4.1(4) and 4.1(9) hold. Moreover, assume that (i,X)HF. Then (i,X)Hb, for all b∈F. Thus, there are Ub∈(CON(i) with (i,X)⊢Ub and (i,Ub)Hb. Set U={ub∣b∈F}. It follows that (i,X)⊢U. Hence, U∈(CON(i). With Condition 4.1(2) we therefore have that (i,U)HF. By Axiom 3.1(8) we moreover obtain from (i,X)⊢U that there is some c∈A with (i,X)⊢c and U∈(CON(c). Thus, {c}∈(CON(i). Consequently, (c,U)HF, because of Condition 4.1(9).
∎
Similarly, the Right Interpolation Rule 4.1(6) and the Witness Generation Rule 4.1(7) can be combined into one rule.
Lemma 4.3**.**
Let (A,(CON,⊢,Δ) and (A′,(CON′,⊢′,Δ′) be information systems with witnesses. Then, for any H⊆(CON×A′, (i,X)∈(CON, and F⊆finA′, Conditions 4.1(6, 7) together are equivalent to the following requirement:
[TABLE]
Proof.
Assume that Requirement (2) holds. Then Condition 4.1(6) follows as a special case. For Condition 4.1(7) suppose that (i,X)HF. Then there is some (e,V)∈(CON′) so that (i,X)H(e,V) and (e,V)⊢′F. It follows that (i,X)He and F∈(CON′(e).
Next, conversely, suppose that Conditions 4.1(6) and 4.1(7) hold. Moreover, assume that (i,X)HF. Then, for all b∈F, there exist (db,Vb)∈(CON′ such that (i,X)H(db,Vb) and (db,Vb)⊢′b. Let V={Vb∪{db}∣b∈F}. Since we have that (i,X)HV, it follows with Requirement 4.1(7) that there is some e∈A′ with (i,X)He and V∈(CON′(e). Hence, {db}∈(CON′(e) and thus (e,Vb)⊢′b, from which we obtain that (e,V)⊢′F. In addition, we have that (i,X)H(e,V).
∎
Finally, the extended left and right Interpolation Rules (1) and (2) together can be exchanged for one rule.
Lemma 4.4**.**
Let (A,(CON,⊢,Δ) and (A′,(CON′,⊢′,Δ′) be information systems with witnesses. Then, for any H⊆(CON×A′, (i,X)∈(CON, and F⊆finA′, Conditions (1) and (2) together are equivalent to the following rule:
Similarly to Lemma 3.4 a strengthening of Axiom 4.1(3) can be derived. It reverses the implication in Condition 4.1(4).
Lemma 4.5**.**
Let H be an approximable mapping between information systems A and A′ with witnesses. Then for all (i,X),(j,Y)∈(CON and b∈A′,
[TABLE]
As has already been mentioned, entailment relations are special approximable mappings. For (i,X)∈(CON and a∈A, set (i,X)(IdAa if (i,X)⊢a. Then (Id:A⊩A such that for all H:A⊩A′, H∘(IdA′=H=(IdA∘H, where for approximable mappings H:A⊩A′ and G:A′⊩A′′ their composition H∘G:A⊩A′′ is defined by
[TABLE]
Let ISW be the category of information systems with witnesses and approximable mappings and aISW, bcISW, and abcISW, respectively, be the full categories of information systems with witnesses that satisfy Condition (ALG), Condition (BC) or both of them.
Theorem 4.6**.**
The category ISW of information systems with witnesses and approximable mappings is equivalent to the category L of L-domains and Scott continuous functions.
Corollary 4.7**.**
The categories aISW, bcISW and abcISW, respectively, of information systems with witnesses satisfying Conditions (ALG), (BC), or both of them, and approximable mappings are equivalent to the categories aL, BC and aBC of algebraic L-domain, bc-domains and algebraic bc-domains with Scott continuous functions.
5 The function space construction
As mentioned earlier, the categories L and aL are Cartesian closed. The same is true for BC and aBC. Because of the equivalence of theses categories with ISW, aISW, bcISW and abcISW, respectively, we know that the latter categories are Cartesian closed as well. In this and the next section we present a direct proof of the Cartesian closure of ISW and its just mentioned full subcategories. To this end we first show that the collection of approximable mappings between two information systems with witnesses comes itself with a natural information system structure. We start with some preliminary definitions and then discuss what will be the tokens of this information system.
Definition 5.1**.**
Let (A,(CON,⊢,Δ) be an information system with witnesses and X⊆finA. Two witnesses i,j∈A are called X-equivalent, written i∼j[X], if there are n∈ω and k1,…,kn,a0,…,an∈A with a0=i, an=j, X∈(CON(aν−1)∩(CON(aν) and {aν−1},{aν}∈(CON(kν), for ν=1,…,n.
If the information system is generated from an L-domain as in Theorem 3.13, the witnesses i and j are basic elements and X is a finite subset of such, then i∼j[X] implies that the suprema of X with respect to i and j, respectively, coincide.
Lemma 5.2**.**
For any X⊆finA, ∼[X] is a partial equivalence relation. Moreover, the following five statements hold, for all i,j,k∈A and U⊆finA:
For the remaining statements let i∼j[X]. Then there are n∈ω and k1, …, kn, a0, …, an∈A such that a0=i, an=j, X∈(CON(aν−1)∩(CON(aν) and {aν−1},{aν}∈(CON(kν), for ν=1,…,n.
and consequently that (i,X)⊢a, exactly if (j,X)⊢a, for all a∈A.
(4) Let 1≤ν≤n. Then we have that aν∼i[X] and hence, by Statement (2), that (aν,X)⊢U. Thus U∈(CON(aν). This shows that for all ν=1,…,n, U∈(CON(aν−1)∩(CON(aν) Since also {aν−1},{aν}∈(CON(kν), we obtain that i∼j[U].
(5) We have that (j,X)⊢U and hence that i∼j[U], by Rule (3). Thus there are m∈ω and r1,…,rm,b0,…,bm with b0=i, bm=j, U∈(CON(bμ−1)∩(CON(bμ) and {bμ−1},{bμ}∈(CON(rμ), with μ=1,…,m. By assumption (j,X)⊢k. Hence, {k}∈(CON(j). As {j}∈(CON(rm), we obtain that {k}∈(CON(rm). Now, set bm=k. Then it follows that i∼k[U].
∎
Lemma 5.3**.**
Let (A′,(CON′,⊢′,Δ′) be a further information system with witnesses and H be an approximable mapping between A and A′. Moreover, let X⊆finA, i,j∈A, and b∈A′. Then
[TABLE]
Proof.
Let i∼j[X] and (i,X)Hb. By Lemma 4.4 there is some (c,U)∈(CON such that (i,X)⊢(c,U) and (c,U)Hb. Because of Lemma 5.2(2) it follows that also (j,X)⊢(c,U). With Lemma 4.5 we therefore obtain that (j,X)Hb.
∎
For X⊆fin(CON and (a,S)∈(CON define
[TABLE]
Then (CL((a,S),X) is finite. Let in addition
[TABLE]
Lemma 5.4**.**
Let (a,S),(c,T)∈(CON such that (a,S)⊢T and a∼c[T]. Then
[TABLE]
Proof.
Let (i,X)∈X and i∼j[X] so that (c,T)⊢(j,X). Then also (a,T)⊢(j,X) and hence, (a,S)⊢(j,X).
∎
Next, set
[TABLE]
and let (A′,(CON′,⊢′,Δ′) be a further information system with witnesses.
Definition 5.5**.**
For V⊆fin(CON×A′, U⊆V and a∈W((pr1(V)), (a,U) is V-maximal if the following condition holds, for all ((i,X),j)∈V:
[TABLE]
Lemma 5.6**.**
Let (a,U) be V-maximal and c∈W((pr1(U)) with c∼a[⋃(pr2,1(U)]. Then (c,U) is V-maximal as well.
Proof.
Let ((i,X),j)∈V with X⊆⋃(pr2,1(U) with c∼i[X]. Then a∼c[X], by Lemma 5.2(3), and hence a∼i[X]. Therefore, ((i,X),j)∈U, as (a,U) is V-maximal.
∎
As in the case of Scott’s information systems, the tokens of the function space A→A′ will be finite subsets of (CON×A′. Let V={((i1,X1),c1),…,((in,Xn),cn)} be such a set and (a,S)∈(CON. Assume that J⊆{1,…,n} with (a,S)⊢(iν,Xν), exactly if ν∈J. Then we need a witness for the set {cν∣ν∈J}. Moreover, if Jμ⊆{1,…,n}, for μ=1,…,m, with (a,S)⊢(iν,Xν), for ν∈Jμ and 1≤μ≤m, and tμ is a witness for {cν∣ν∈Jμ}, then we also need a witness for {tμ∣1≤μ≤m}.
Definition 5.7**.**
W⊆(CON×A′ is an associate of V if for each J⊆{1,…,n}, R({(iν,Xν)∣ν∈J}) is a system of representatives of W({(iν,Xν)∣ν∈J}) with respect to ∼[⋃ν∈JXν] so that R(∅)={Δ} and R({(iν,Xν})={iν}, and there exists an increasing chain (W(κ))κ∈ω of subsets of (CON×A′ such that
For all J⊆{1,…,n} with ∥J∥=κ and all e∈R({(iν,Xν)∣ν∈J}) for which (e,{((iν,Xν),cν)∣ν∈J}) is V-maximal, there is exactly one j∈A′ so that
i.
{t∈A′∣(∃a∈A)(∃K⊆{1,…,n})⋃ρ∈KXρ⊆⋃ν∈JXν∧a∼e[⋃ρ∈KXρ]∧\mbox\mbox[(∥K∥=1∧((a,⋃ρ∈KXρ),t)∈V)∨(a∈R({(iρ,Xρ)∣ρ∈K})∧\mbox\mbox((a,⋃ρ∈KXρ),t)∈W(κ−1))]}∈(CON′(j),
2. ii.
((a,⋃ν∈JXν),j)∈W(κ).
2. (b)
For all ((a,T),b)∈W(κ) there are J⊆{1,…n} and a∈R({(iν,Xν)∣ν∈J}) so that ∥J∥=κ, (a,{((iν,Xν),cν)∣ν∈J}) is V-maximal, T=⋃ν∈JXν, and b satisfies Condition (3(a)i).
Let J⊆{1,…,n} and a∈W({(iν,Xν)∣ν∈J}) so that (a,{((iν,Xν),cν)∣ν∈J}) is V-maximal. If J=∅, then both sets {(iν,Xν)∣ν∈J} and {cν∣ν∈J} are empty as well. Moreover, Δ∈W(∅) and ∅∈(CON′(Δ′). This explains Condition 5.7(2). Note that (Δ,∅) is not V-maximal, if for some 1≤κ≤n, Xκ=∅.
For the larger cardinalities it follows from Condition 5.7(3(a)i) that the second components of pairs in W are the consistency witnesses for the sets of second components in V we were looking for above.
Note in Condition 5.7(3(a)i) that if J⊆{1,…,n} with ∥J∥≥1 and
[TABLE]
for some aj∈A and tJ∈A′, then (aJ,{((iν,Xν),cν)∣ν∈J}) must be V-maximal, by Condition 5.7(3b). Thus, if for some K⊆{1,…,n} one has that ⋃κ∈KXκ⊆⋃ν∈JXν, then K⊆J.
Let (AC(V) be the set of all associates of V. We write ⟨W∣V⟩ with V⊆fin(CON×A′ to mean that W∈(AC(V). Similarly, for sets V⊆finPf((CON×A′) and W⊆finP((CON×A′) of equal cardinality, say V={V1,…,Vm} and W={W1,…,Wm}, such that Wν∈(AC(Vν), for ν=1,…,m, we write ⟨W∣V⟩ for the set {⟨Wν∣Vν⟩∣1≤ν≤m}. In this sense we also say that ⟨W∣V⟩⊆finP(((CON×A′)2).
Lemma 5.8**.**
For (c,U)∈(CON and Z⊆finA′ let D={((c,U),d)∣d∈Z}. Moreover, let b∈A′ with Z∪{Δ′}∈(CON′(b), if U is not empty, and Z∈(CON′(b), otherwise, and define
[TABLE]
Then E∈(AC(D).
The proof is a straightforward exercise. Note that for any nonempty subset V⊆Z, (c,{((c,U),d)∣d∈V}) is D-maximal, exactly if V=Z. If U is empty, this is even true for any subset V.
For (a,S)∈(CON,
[TABLE]
is the V-spectrum of (a,S). Set (DS((a,S),V)=(pr1((SP((a,S),V) and (RS((a,S),V)=(pr2((SP((a,S),V).
Assume again that V={((i1,X1),c1),…,((in,Xn),cn)} and let W∈(AC(V). If ((c,T),d)∈W, if follows from Condition 5.7(3b) that there is exactly one subset J⊆{1,…,n} such that (c,{((iν,Xν),cν)∣ν∈J}) is V-maximal, c∈W({(iν,Xν)∣ν∈J}), and T=⋃ν∈JXν. Then (DS((c,T),V)={(iν,Xν)∣ν∈J} and (RS((c,T),V)={cν∣ν∈J}.
Define
[TABLE]
As a consequence of Lemma 5.4 we have for (c,T)∈(CON with (a,S)⊢T and a∼c[T] that (AP((c,T),V)⊆(AP((a,S),V).
Let M⊆{1,…,n} such that
[TABLE]
Then (a,{((iκ,Xκ),cκ)∣κ∈M}) is V-maximal.
It follows that
[TABLE]
Moreover, there exists exactly one pair (e,j) with e∈W({(iκ,Xκ)∣κ∈M}) and j∈A′ so that
[TABLE]
Set
[TABLE]
Then we also write
[TABLE]
The next lemma is a consequence of Lemma 5.4 and Condition 5.7(3(a)i)
Lemma 5.9**.**
Let (a,S),(c,T)∈(CON. Then the following statements hold:
If (a,S)⊢T and a∼c[T]. Then {W2(c,T)}∈(CON′(W2(a,S)).
2. 2.
If T⊆S and a∼c[T]. Then {W2(c,T)}∈(CON′(W2(a,S)).
3. 3.
If (a,S)⊢(c,T) and (c,T)⊢(CL((a,S),(pr1(V))). Then
[TABLE]
Definition 5.10**.**
Let (A,(CON,⊢,Δ) and (A′,(CON′,⊢′,Δ′) be information systems with witnesses. Define
In Condition 5.10(3a) one needs that
(AP((e,Y),⋃V)∈(CON′(W2(e,Y)).
This is an easy consequence of Condition 5.10(2b): choose r=W2(e,Y) and note that by definition of W2(e,Y),
(AP((e,Y),V)∈(CON′(W2(e,Y)).
Because of Condition 3.1(2) we therefore have that
[TABLE]
Lemma 5.11**.**
Let ⟨W∣V⟩∈(CON→(⟨W∣V⟩) and ⟨G∣F⟩⊆finA→A′ such that Condition 5.10(3a) holds for all ⟨G∣F⟩∈⟨G∣F⟩. Then for all (a,S)∈(CON,
[TABLE]
Proof.
Let b∈(AP((a,S),⋃F). Then there are (j,U)∈(CON and j′∈A such that ((j,U),b)∈⋃F, j∼j′[U], and (a,S)⊢(j′,U). As a consequence of our assumption, we have that (W2(j,U),(AP((j,U),⋃V))⊢′b. Then W2(j,U)=W2(j′,U) and {W2(j,U)}∈(CON′(W2(a,S)). It follows that also (W2(a,S),(AP((j,U),⋃V))⊢′b. Since moreover (AP((j,U),⋃V)⊆⋃{(AP((c,T),⋃V)∣(c,T)∈(CL((a,S),(pr1(⋃F))}, we finally obtain that (W2(a,S),⋃{(AP((c,T),⋃V)∣(c,T)∈(CL((a,S),(pr1(⋃F))})⊢′b.
∎
Lemma 5.12**.**
Let ⟨W∣V⟩∈(CON→(⟨W∣V⟩) and ⟨B∣A⟩∈A→A′ so that Condition 5.10(3b) holds. Then for all (a,S)∈(CON, B2(a,S)∼W2(a,S)[(AP((a,S),A)].
Proof.
By definition of B(a,S),
[TABLE]
So, Condition 5.10(3b) implies that B2(a,S)∼W2(a,S)[(AP((a,S),A)].
∎
Proposition 5.13**.**
Let (A,(CON,⊢,Δ) and (A′,(CON′,⊢′,Δ′) be information systems with witnesses. Then (A→A′,(CON→,⊢→,Δ→) is an information system with witnesses as well.
In the subsequent lemmas we verify the conditions in Definition 3.1.
Let ⟨W∣V⟩∈(CON→(⟨W∣V⟩) and ⟨G∣F⟩⊆⟨W∣V⟩. We need to verify that ⟨G∣F⟩∈(CON→(⟨W∣V⟩): Condition 5.10(2a) holds trivially. For Requirement 5.10(2b) apply Lemma 5.2(3).
∎
Let ⟨W∣V⟩∈(CON→(⟨W∣V⟩), ⟨G∣F⟩⊆finA→A′, and ⟨B∣A⟩∈A→A′ with (⟨W∣V⟩,⟨W∣V⟩)⊢→⟨G∣F⟩ and (⟨W∣V⟩,⟨G∣F⟩)⊢→⟨B∣A⟩. We need to show that
[TABLE]
The first condition to be verified is a consequence of Lemma 5.11. For the second condition let ((a,Z),b)∈B. By our assumption there is some k∈A′ so that
Then Eν∈(AC(Dν) by Lemma 5.8. It remains to show that ⟨E∣D⟩ with E={E1,…,Em} and D={D1.…,Dm} meets Requirements (5).
As a consequence of Statements (7) and (12) we gain that
[TABLE]
For the verification of Condition 5.10(3b), let ((a,Z),b)∈Eν and set k=b. If
[TABLE]
it follows that Uν is not empty and therefore (DS((Δ,∅),Dν)) and (RS((Δ,∅),Dν) are both empty. In case that ((a,Z),b)=((eν,Uν),kν), we have that (DS((eν,Uν),Dν)={(eν,Uν)} and (RS((eν,Uν),Dν)=Zν. Thus in both cases,
[TABLE]
in the first case because of Axiom 3.1(3), and in the other one as a consequence of Statements (7, 11) as well as Axiom 3.1(11).
This shows that (⟨W∣V⟩,⟨W∣V⟩)⊢→⟨E∣D⟩.
It remains to show that (⟨W∣V⟩,⟨E∣D⟩)⊢→⟨G∣F⟩.
Note that by Statement (7) and Axiom 3.1(4), {kν}∈(CON(W2(aν,Tν)). Moreover,
[TABLE]
With Lemma 5.17 it follows from what we have just seen that ⟨E∣D⟩∈(CON→(⟨W∣V⟩). Thus, (AP((aν,Tν),⋃D)∈(CON′(W2(aν,Tν)). As a consequence of Statement (8) we now obtain that
[TABLE]
for all 1≤ν≤m.
For the second condition let ((a,Z),b)∈G. Since (⟨W∣V⟩,⟨W∣V⟩)⊢→⟨G∣F⟩, there is some k∈A′ with k∼b[(RS((a,Z),F)] and {k}∈(CON′(W2(a,Z)). With Statement (14) it follows that
[TABLE]
Because of Axiom 3.1(8) there is thus some r∈A′ such that
[TABLE]
and (RS((a,Z),F)∈(CON′(r). Hence, {r}∈(CON′(W2(a,Z)), from which it ensues that r∼k[(RS((a,Z),F)]. So, r∼b[(RS((a,Z),F)] and
Let ⟨W∣V⟩∈A→A′, ⟨G∣F⟩⊆finA→A′, and ⟨W∣V⟩∈(CON→(⟨W∣V⟩) with
[TABLE]
We will construct some ⟨B∣A⟩∈A→A′ so that
[TABLE]
If ⋃F is empty, set ⟨B∣A⟩=Δ→. Let us now assume that ⋃F is non-empty. In particular, let ⋃F={((a1,T1),d1),…,((am,Tm),dm)} and 1≤ν≤m. As in the proof of Lemma 5.19 there exists Zν∈(CON′(W2(aν,Tν)) with
[TABLE]
and (eν,Uν)∈(CON such that
[TABLE]
Set
[TABLE]
Then it follows as in the derivation of Lemma 5.19 that
[TABLE]
We will now construct some B∈(AC(A) satisfying the Requirements (15). For each J⊆{1,…,m}, let R({(eν,Uν)∣ν∈J}) be a system of representatives of W({(eν,Uν)∣ν∈J}) with respect to ∼[⋃ν∈JUν] so that R(∅)={Δ} und R({(eν,Uν)})={eν}, for 1≤ν≤m. By Axiom 5.10(3b) there is some ka,Z,⟨G∣F⟩∈A′, for each ⟨G∣F⟩∈⟨G∣F⟩ and ((a,Z),b)∈G, with ka,Z,⟨G∣F⟩∼b[(RS((a,Z),F)] and
[TABLE]
In case ((a,Z),b)=((Δ,∅),Δ′), we choose kΔ,∅,⟨G∣F⟩=Δ′.
*Claim 1 *
For every J⊆A and each a∈R((pr1(J)) such that (a,J) is A-maximal there is some ta,J∈A′ with the next two properties:
[TABLE]
[TABLE]
With respect to the last set on the left hand side note that if ((c,Z),b)∈G, then there is some L⊆F so that (c,L) is F-maximal and Z=⋃(pr2,1(L). It follows that ∥L∥≤∥J∥.
The claim is shown by induction on the cardinality κ of the subset J. The case κ=0 is obvious. Set ta,∅=Δ′, if (a,∅) is A-maximal. All other sets on the right hand side in Statement (5) are empty in this case, except the last one, which is the singleton {Δ′}, if for some ⟨G∣F⟩∈⟨G∣F⟩, ((Δ,∅),Δ′)∈G.
Assume next that the claim holds for all subsets K⊆A of cardinality κ and let J⊆A with ∥J∥=κ+1. Then
[TABLE]
because of Statement (20), Axiom 5.10(3b), and the induction hypothesis. By Condition 3.1(8) there is hence some ta,J∈A′ so that Properties (5) and (5) hold.
With help of the claim we can now define B. Let B(0) be as in Definition 5.7 and for κ≥1 set
[TABLE]
Obviously, B∈(AC(A). Moreover, (⟨W∣V⟩,⟨W∣V⟩)⊢→⟨B∣A⟩: Condition 5.10(3a) follows with Statement (20), and Condition 5.10(3b) is a consequence of Statement (5). It remains to show that
[TABLE]
For Condition 5.10(2a) let ⟨G∣F⟩∈⟨G∣F⟩ and (a,S)∈(CON. Then there is some M⊆{1,…,m} such that
[TABLE]
In addition, there are e∈A and b∈A′ with
a∼e[⋃μ∈MTμ)]
so that ((e,⋃μ∈MTμ),b)=G(a,S). Moreover,
[TABLE]
that is
[TABLE]
Let J⊆A such that
[TABLE]
Then (a,J) is A-maximal. Hence, there is some c∈A such that a∼c[⋃(pr2,1(J)] and ((c,⋃(pr2,1(J)),tc,J)=B(a,S). Because of Statement (18) we moreover have that {(eμ,Uμ)∣μ∈M}⊆(pr1(J). Thus, {ke,⋃μ∈MTμ,⟨G∣F⟩}∈(CON′(B2(a,S)), by Statement (5).
For Condition 5.10(2b), finally, let 1≤ν≤m. Note that by Statement (18),
[TABLE]
With Lemma 5.17 it follows from what we have just seen that {⟨B∣A⟩}∈(CON→(⟨W∣V⟩). Thus, (AP((aν,Tν),A)∈(CON′(W2(aν,Tν)). As a consequence of Statement (17) we obtain that
[TABLE]
from which we gain with Lemma 5.11 that for all (i,X)∈(CON,
[TABLE]
Hence,
[TABLE]
because of Lemmas 5.12 and 5.2(2). Condition 5.10(2b) now follows with Lemma 5.2(4).
∎
Let {⟨B∣A⟩}∈(CON→(⟨W∣V⟩) and ⟨G∣F⟩∈(CON→(⟨B∣A⟩). We have to show that ⟨G∣F⟩∈(CON→(⟨W∣V⟩).
Let (a,S)∈(CON. As {⟨B∣A⟩}∈(CON→(⟨W∣V⟩), there is some kA∈A′ so that {kA}∈(CON′(W2(a,S)) and kA∼B2(a,S)[(AP((a,S),A)]. Now, using that ⟨G∣F⟩∈(CON→(⟨B∣A⟩), it follows that kA∼B2(a,S)[(AP((a,S),⋃F)], from which we obtain with Lemma 5.2(3) that for every ⟨G∣F⟩∈⟨G∣F⟩, kA∼B2(a,S)[(AP((a,S),F)].
Moreover, there is some kF∈A′ so that kF∼G2(a,S)[(AP((a,S),F)] and {kF}∈(CON′(B2(a,S)). It follows that
[TABLE]
This shows that
[TABLE]
As said, {kA}∈(CON′(W2(a,S)).
Thus, the first of the two conditions in Def. 5.10(2) holds. For the second one let r∈A′ with r∼W2(a,S)[(AP((a,S),V)]. Then
[TABLE]
as {⟨B∣A⟩}∈(CON→(⟨W∣V⟩). Since {kA}∈(CON′(W2(a,S)), it follows that
[TABLE]
and because kA∼B2(a,S)[(AP((a,S),A)], we obtain that r∼B2(a,S)[(AP((a,S),A)]. Moreover,
[TABLE]
Now, note that for any s∈A′ with s∼B2(a,S)[(AP((a,S),A)] we have that
[TABLE]
As consequence we gain that r∼W2(a,S)[(AP((a,S),⋃F)].
∎
Let {⟨B∣A⟩}∈(CON→(⟨W∣V⟩), ⟨G∣F⟩∈(CON→(⟨B∣A⟩) and ⟨Z∣Y⟩∈A→A′ so that (⟨B∣A⟩,⟨G∣F⟩)⊢→⟨Z∣Y⟩. We must prove that (⟨W∣V⟩,⟨G∣F⟩)⊢→⟨Z∣Y⟩.
Let ((c,T),b)∈Y and choose kA according to Condition 5.10(2a). Then B2(c,T)∼kA[(AP((c,T),A)] and {kA}∈(CON′(W2(c,T)).
Moreover, we have that
[TABLE]
With Lemma 5.2(2) it follows that also (kA,(AP((c,T),A))⊢′b. Hence,
[TABLE]
by Axiom 3.1(10). The other condition follows similarly.
∎
The verification of Condition 3.1(11) proceeds in an analogous way.
Proposition 5.23**.**
Let (A,(CON,⊢,Δ) and (A′,(CON′,⊢′,Δ′) be information systems with witnesses satisfying Condition (ALG). Then (A→A′,(CON→,⊢→,Δ→) satisfies (ALG) as well.
Proof.
As follows from a slight modification of the construction in Lemma 5.19, Condition (SALG) is satisfied: Because of Condition (ALG) (eν,Uν)∈(CON and (kν,Zν)∈(CON′ can be chosen as reflexive, for each 1≤ν≤m. Moreover, as a consequence of Statement (13), {kν}∈(CON′(W2(eν,Uν)). Therefore, we have that (W2(eν,Uν),Zν)⊢′(kν,Zν). By definition of ⟨E∣D⟩, Zν⊆(AP((eν,Uν),⋃D). Hence,
[TABLE]
which implies that (⟨W∣V⟩,⟨E∣D⟩)⊢→⟨E∣D⟩.
∎
Condition (BC) as well is inherited to the function space.
Proposition 5.24**.**
Let (A,(CON,⊢,Δ) and (A′,(CON′,⊢′,Δ′) be information systems with witnesses. If (A′,(CON′,⊢′,Δ′) satisfies Condition (BC), so does (A→A′,(CON→,⊢→,Δ→).
Proof.
Let ⟨B∣A⟩,⟨W∣V⟩∈A→A′ and ⟨G∣F⟩∈(CON→(⟨B∣A⟩)∩(CON→(⟨W∣V⟩). We need to show that for any ⟨I∣H⟩∈A→A′,
[TABLE]
As a consequence of Axiom 5.10(2b) we have that for any (a,S)∈(CON,
[TABLE]
Then also
[TABLE]
Because of Condition (BC) it follows for all ((e,Y),f)∈H that
Let f∈∣A→A′∣. Then f⊆A→A′, i.e., f is a set of pairs in P((CON×A′)×Pf((CON×A′) such that the first component is an associate of the second. We will now show that the states of A→A′ correspond to the approximable mappings between A and A′ in a one-to-one way.
Lemma 5.25**.**
For f∈∣A→A′∣, let (AM(f)=⋃(pr2(f). Then (AM(f):A⊩A′.
Proof.
In order to show that (AM(f) is an approximable mapping we need to verify Conditions (4.1)(1-9).
(1) is a consequence of the fact that because of Axiom 3.1(3) and Condition 3.5(2), Δ→ is contained in every state.
(2) Let i∈A, X,X′∈(CON(i), and b∈A′ so that X⊆X′ and (i,X)(AM(f)b. We need to show that (i,X′)(AM(f)b.
Since (i,X)(AM(f)b, there is some ⟨B∣A⟩∈f with ((i,X),b)∈A. Because of Condition 3.5(3) it follows that (⟨W∣V⟩,⟨W∣V⟩)⊢→⟨B∣A⟩, for some ⟨W∣V⟩∈f and ⟨W∣V⟩⊆finf with ⟨W∣V⟩∈(CON→(⟨W∣V⟩). Thus, (W2(i,X),(AP((i,X),⋃V))⊢′b. By Lemma 5.9(2), we have that {W2(i,X)}∈(CON′(W2(i,X′)). Moreover, (AP((i,X),⋃V)⊆(AP((i,X′),⋃V). Therefore,
Consequently, by Axiom 3.1(8), there is some e∈A′ with
[TABLE]
and {b,Δ′}∈(CON′(e).
Now, set D={((i,X′),b)} and let E∈(AC(D be as in Lemma 5.8. Then Statement (25) means that (⟨W∣V⟩,⟨W∣V⟩)⊢→⟨E∣D⟩: for Condition 5.10(3b) choose k=e or k=Δ′, respectively. By Condition 3.5(2) it follows that ⟨E∣D⟩∈f. Hence (i,X′)(AM(f)b.
(5) Let (i,X)∈(CON, (k,Y)∈(CON′ and b∈A′ so that (i,X)(AM(f)(k,Y) and (k,Y)⊢′b. We must show that (i,X)(AM(f)b.
Since (i,X)(AM(f)(k,Y), we have again that for all c∈{k}∪Y there are tokens ⟨Bc∣Ac⟩∈f so that ((i,X),c)∈Ac. Let ⟨G∣F⟩={⟨Bc∣A)c⟩∣c∈{k}∪Y}. Because of Condition (ST) there exist ⟨W∣V⟩∈f and ⟨W∣V⟩⊆finf so that (⟨W∣V⟩,⟨W∣V⟩)⊢→⟨G∣F⟩. It follows that
[TABLE]
Since (k,Y)⊢′b, we have that (W2(i,X),(AP((i,X),⋃V))⊢′b, from which it follows as above that (i,X)(AM(f)b.
It remains to verify Conditions 4.1(4, 6, 7, 9). Because of Lemmas 4.2, 4.3 and 4.4 it suffices to verify Requirement (3) instead.
Let (i,X)∈(CON and F⊆finA′ with (i,X)(AM(f)F. We have to show that there are (c,U)∈(CON and (e,V)∈(CON′ so that (i,X)⊢(c,U), (c,U)(AM(f)(e,V) and (e,V)⊢′F.
As we have already seen, there are ⟨W∣V⟩∈f and ⟨W∣V⟩⊆finf with
[TABLE]
Moreover, by the Global Interpolation Property (GIP), there exists (c,U)∈(CON such that (i,X)⊢(c,U) and (c,U)⊢(CL((i,X),(pr1(⋃V)). It follows with Lemma 5.9(3) that also (W2(c,U),(AP((c,U),⋃V))⊢′F. Apply the Global Interpolation Property again to obtain some (e,V)∈(CON′ so that (W2(c,U),(AP((c,U),⋃V))⊢′(e,V) and (e,V)⊢′F. Let V∪{e}={b1,…,bn}, and for 1≤ν≤n, set Dν={((c,U),bν)}. Moreover, let Eν∈(AC(Dν) be as in Lemma 5.8. Then (⟨W∣V⟩,⟨W∣V⟩)⊢→⟨Eν∣Dν⟩. It follows that ⟨Eν∣Dν⟩∈f and hence that (c,U)(AM(f)(e,V).
∎
Lemma 5.26**.**
For H:A⊩A′, let (ST(H) be the set of all ⟨B∣A⟩∈A→A′ such that the following two conditions hold:
A⊆H**
2. 2.
(∀((a,Z),b)∈B)(∃j∈A′)(a,Z)Hj∧j∼b[(RS((a,Z),A)].**
Then (ST(H)∈∣A→A′∣.
Proof.
In order to verify that (ST(H) is a state of ∣A→A′∣, we check Conditions 3.5(2) and (ST).
3.5(2) Let ⟨W∣V⟩,⟨B∣A⟩∈(CON→ and ⟨W∣V⟩⊆fin(CON→(⟨W∣V⟩) such that {⟨W∣V⟩}∪⟨W∣V⟩⊆(ST(H) and (⟨W∣V⟩,⟨W∣V⟩)⊢→⟨B∣A⟩. We must show that ⟨B∣A⟩∈(ST(H).
For the first requirement let ((c,U),d)∈A. Then we have that
[TABLE]
By assumption, ⟨W∣V⟩∈(ST(H). Thus, there is some j∈A′ such that (c,U)Hj and j∼W2(c,U)[(AP((c,U),V)]. Since ⟨W∣V⟩∈(CON→(⟨W∣V⟩), we conclude that j∼W2(c,U)[(AP((c,U),⋃V)]. With Lemma 5.2(2) we thus obtain that also
[TABLE]
Now, let b∈(AP((c,U),⋃V). Then there is (e,Y)∈(CON so that ((e,Y),b)∈⋃V and for some e′∈A with e∼e′[Y], (c,U)⊢(e′,Y). As ⋃V⊆H, it follows with Lemma 5.3 that (e′,Y)Hb and hence with Lemma 4.5 that (c,U)Hb. This shows that
For the second requirement let ((a,Z),b)∈B. By assumption, (⟨W∣V⟩,⟨W∣V⟩)⊢→⟨B∣A⟩. Hence there is some k∈A′ such that b∼k[(RS((a,Z),A)] and
[TABLE]
from which it follows as above that (a,Z)Hk.
(ST) Let ⟨G∣F⟩⊆fin(ST(H). We need to show that there are ⟨W∣V⟩∈(ST(H) and ⟨W∣V⟩⊆fin(ST(H) with ⟨W∣V⟩∈(CON→(⟨W∣V⟩) so that (⟨W∣V⟩,⟨W∣V⟩)⊢→⟨G∣F⟩. The construction proceeds as in Lemma 5.20. Instead of Condition 5.10(3b), however, we now make use of Requirement 5.26(2).
Let ⋃F={((cν,Tν),eν)∣1≤ν≤n}. Then (cν,Tν)Heν. By Rule (3) there are (iν,Yν)∈(CON and (jν,Zν)∈(CON′ with
[TABLE]
Set
[TABLE]
Then V⊆H. We will next construct W∈(AC(V) such that ⟨W∣V⟩∈(ST(H) and (⟨WV⟩,{⟨WV⟩})⊢→⟨G∣F⟩. If ⋃F is empty, set ⟨W∣V⟩=Δ→.
Let us now assume that ⋃F is non-empty and that, for each J⊆{1,…,n}, R({(iν,Yν)∣ν∈J}) is a system of representatives of W({(iν,Yν)∣ν∈J}) with respect to ∼[⋃ν∈JYν] so that R(∅)={Δ} und R({(iν,Yν)})={iν}, for 1≤ν≤n. By Condition 5.26(2) there is some ja,Z,⟨G∣F⟩∈A′, for each ⟨G∣F⟩∈⟨G∣F⟩ and ((a,Z),b)∈G, with ja,Z,⟨G∣F⟩∼b[(RS((a,Z),F)] and (a,Z)Hja,Z,⟨G∣F⟩. In case ((c,Z),b)=((Δ,∅),Δ′), choose jΔ,∅,⟨G∣F⟩=Δ′.
*Claim 1 *
For every J⊆V and each a∈R((pr1(J)) so that (a,J) is V-maximal there is some ta,J∈A′ with the following two properties:
[TABLE]
[TABLE]
With respect to the last set on the right hand side note that if ((c,Z),b)∈G, then there is some L⊆F so that (c,L) is F-maximal and Z=⋃(pr2,1(L). It follows that ∥L∥≤∥J∥.
The claim is shown by induction on the cardinality κ of the subset J. The case κ=0 is obvious. Set ta,∅=Δ′, if (a,∅) is V-maximal. All other sets on the left hand side in Statement (5) are empty in this case, except the last one, which is the singleton {Δ′}, if for some ⟨G∣F⟩∈⟨G∣F⟩, ((Δ,∅),Δ′)∈G.
Assume next that the claim holds for all subsets K⊆V of cardinality κ and let J⊆V with ∥J∥=κ+1. Then
[TABLE]
because of Statement (27), Condition 5.26(2), and the induction hypothesis. By Condition 4.1(7) there is hence some ta,J∈A′ so that Properties (5) and (5) hold.
With help of Claim 5 we can now define W. Let W(0) be as in Definition 5.7 and for κ≥1 set
[TABLE]
Obviously, W∈(AC(V).
*Claim 2 *
⟨W∣V⟩∈St(H).
By definition, V⊆H. For Requirement 5.26(2) let (a,Z),b)∈W. Then there is some subset J⊆V so that (a,J) is V-maximal, a∈R((pr1(J)), Z=⋃(pr2,1(J) and b=ta,J. Hence, (pr2(J)∈(CON′(b) and (a,Z)Hb. Note that (pr2(J)=(RS((a,Z),V)]. Thus, b∼b[(RS((a,Z),J)].
*Claim 3 *
(⟨W∣V⟩,{⟨W∣V⟩})⊢→⟨G∣F⟩.
Let 1≤ν≤n, Then Zν⊆(AP((cν,Tν),V) and {kν}∈(CON′(W2(cν,Tν)). As a consequence of Statement (28) we therefore have that (W2(cν,Tν),(AP((cν,Tν),V))⊢′eν, which means that Condition 5.10(3a) holds.
For Condition 5.10(3b), let ⟨G∣F⟩∈⟨G∣F⟩ and ((a,Z),b)∈G. As a consequence of Condition 5.10(3a) we have that
(W2(a,Z),(AP((a,Z),V))⊢′(RS((a,Z),F).
Because of Condition 3.1(8) there is thus some k∈A′ so that (W2(a,Z),(AP((a,Z),V))⊢′k and
[TABLE]
It follows that
[TABLE]
Let J={((i,Y),d)∈V∣(i,Y)∈(CL((a,Z),(pr1(V))} and W(a,Z)=((e,U),t). Then (e,J) is V-maximal, e∼a[U], U=⋃(pr2,1(J), and W2(a,Z)=te,J. Since ((a,Z),b)∈G, there is some K⊆F such that Z=⋃(pr2,1(K) and {(iμ,Yμ)∣1≤μ≤n∧(cμ,Tμ)∈(pr1(K)}⊆(pr1(J). It follows that
[TABLE]
Moreover,
[TABLE]
since ⟨G∣F⟩∈(ST(H), by assumption. As a consequence of Statements (31–34) we obtain that b∼k[(RS((a,Z),F)], as was be shown.
∎
In the next two lemmas we verify that the operators (AM and (ST between ∣A→A′∣ and the set of all approximable mappings between A and A′ are inverse to each other.
Lemma 5.27**.**
For f∈∣A→A′∣, (ST((AM(f))=f.
Proof.
Let ⟨B∣A⟩∈f. Then A⊆⋃(pr2(f). Thus, A⊆(AM(f), i.e., Condition 5.26(1) holds.
For Condition 5.26(2), let ((a,Z),b)∈B. Since ⟨B∣A⟩∈f, there are ⟨W∣V⟩∈f and ⟨W∣V⟩⊆finf with ⟨W∣V⟩∈(CON→(⟨W∣V⟩) and (⟨W∣V⟩,⟨W∣V⟩)⊢→⟨B∣A⟩. It follows by Condition 5.10(3b) that there is some k∈A′ such that
[TABLE]
Let ((i,X),c)∈⋃V such that (i,X)∈(CL((a,Z),(pr1(⋃V)). Then (i,X)(AM(f)c, as V⊆(pr2(f) and hence ⋃V⊆⋃(pr2(V)=(AM(f). So, we have that
[TABLE]
By Condition 4.1(7) there is now some j∈A′ such that
[TABLE]
and (AP((a,Z),⋃V)∈(CON′(j). Furthermore, with Lemma 4.2, we obtain some some (c,U)∈(CON such that (a,Z)⊢(c,U) and (c,U)(AM(f)j. It follows that there is some ⟨E∣D⟩∈f with ((c,U),j)∈D. Moreover, since f is a state, there exists ⟨G∣F⟩∈f with {⟨W∣V⟩,⟨E∣D⟩}(CON→(⟨G∣F⟩). Because of Condition 5.10(2a) there are thus e⟨W∣V⟩,e⟨E∣D⟩∈A′ so that
[TABLE]
Note that by construction j∈(AP((a,Z),D). With Lemma 5.2(3) we hence obtain from the first of Statements (39) that E2(a,Z)∼e⟨E∣D⟩[{j}]. Since (AP((a,Z),⋃V)∈(CON′(j), it follows that E2(a,Z)∼e⟨E∣D⟩[(AP((a,Z),⋃V)].
With Axiom 5.10(2b) we obtain from the first of Statements (38) that also
[TABLE]
So, since {e⟨E∣D⟩},{e⟨W∣V⟩}∈(CON′(G2(a,Z)), we have that
[TABLE]
Finally, as {j}∈(CON′(E2(a,Z)) by Axiom 5.7(3a), we find that
Statements (36, 37, 40) now imply that (a,Z)(AM(f)k. Moreover, if follows with Statement (40) that {k}∈(CON′(j). With Statement (35) we thus have that j∼b[(RS((a,Z),A)]. This shows that ⟨B∣A⟩∈(ST((AM(f)).
For the converse inclusion let ⟨B∣A⟩∈(ST((AM(f)). Then A⊆(AM(f).
Let A={((cν,Tν),eν)∣1≤ν≤n}. As ((cν,Tν),eν)∈(AM(f), there is some ⟨E(ν)∣D(ν)⟩∈f with ((cν,Tν),eν)∈D(ν), for each 1≤ν≤n. Because of Condition (ST) there are furthermore some ⟨W∣V⟩∈f and a subset ⟨W∣V⟩⊆finf with (⟨W∣V⟩,⟨W∣V⟩)⊢→{⟨E(ν)∣D(ν)⟩∣1≤ν≤n}. Hence, we have for every 1≤ν≤n that
[TABLE]
Let ((a,Z),b)∈B. Then it follows that
[TABLE]
Because of Condition 3.1(8) there is thus some k∈A′ with (RS((a,Z),A)∈(CON′(k) and
[TABLE]
Hence, {k}∈(CON′(W2(a,Z)). By Requirement 5.26(2) we furthermore obtain some j∈A′ with j∼b[(RS((a,Z),A)] and (a,Z)(AM(f)j. As above, it follows that
[TABLE]
Thus, {j}∈(CON′(W2(a,Z)) as well. Consequently, b∼k[(RS((a,Z),A)]. With Statement (41) we now obtain that
[TABLE]
Therefore, ⟨B∣A⟩∈f.
∎
Lemma 5.28**.**
For H:A⊩A′, (AM((ST(H))=H.
Proof.
Let ((a,S),b)∈(AM((ST(H)). Then ((a,S),b)∈⋃(pr2((ST(H)). Thus, there is some ⟨B∣A⟩∈(ST(H) with ((a,S),b)∈A. Since A⊆H, it follows that ((a,S),b)∈H.
For the converse implication, let ((c,T),e)∈H. As (Δ,∅)HΔ′, we have that
[TABLE]
Hence, there is some d∈A′ with (c,T)Hd and {Δ′,e}∈(CON′(d). Set D={((c,T),e)} and let E∈(AC(D) be as in Lemma 5.8. Then D⊆H. Next, let ((a,Z),b)∈E. Then either ((a,Z),b)=((c,T),d) or ((a,Z),b)=((Δ,∅),Δ′). In the latter case T is non-empty. Therefore (RS((a,Z),D)=∅. Choose j=Δ′ in this case. In the other case (RS((a,Z),D)={d}. Now, choose j=d. Then we have in both cases that j∼b[(RS((a,Z),D)] and (a,Z)Hj. This shows that ⟨E∣D⟩∈(ST(H). Thus, D⊆⋃(pr2((ST(H)), which means that ((c,T),e)∈(AM((ST(H)).
∎
Proposition 5.29**.**
Let (A,(CON,⊢,Δ) and (A′,(CON′,⊢′,Δ′) be information systems with witnesses. Then the states of A→A′ are in a one-to-one correspondence to the approximable mappings between A and A′:
{⋃(pr2(f)∣f∈∣A→A′∣}* is the set of all approximable mappings between A and A′.*
2. 2.
∣A→A′∣* is the collection of all sets {⟨B∣A⟩∈A→A′∣A⊆H∧(∀((a,Z),b)∈B)(∃j∈A′)(a,Z)Hj∧j∼b[(RS((a,Z),A)]}, where H is an approximable mapping H between A and A′.*
In Ref. [1] it was shown how approximable mappings between two information systems with witnesses A and A′ as well as Scott continuous functions from ∣A∣ to ∣A′∣ correspond to each other. As we will show next, this correspondence establishes an isomorphism between the domains ∣A→A′∣ and [∣A∣→∣A′∣].
For G:A⊩A′ and x∈∣A∣ let
[TABLE]
Then L(G)∈[∣A∣→∣A′∣]. Since for f∈∣A→A′∣, (AM(f):A⊩A′, it follows that L((AM(f))∈[∣A∣→∣A′∣]. Set
[TABLE]
Then we have for x∈∣A∣ that
[TABLE]
where the last equality follows as in the second part of the proof of Lemma 5.28. As is now easily seen, (fct∈[∣A→A′∣→[∣A∣→∣A′∣]].
Conversely, let g∈[∣A∣→∣A′∣] and for (i,X)∈(CON and b∈A′ define
The function (st:[∣A∣→∣A′∣]→∣A→A′∣ is Scott continuous.
Proof.
Obviously, (st is monotone. Let G⊆[∣A∣→∣A′∣] be directed and ⟨B∣A⟩∈(st(⨆G). Then A⊆H⨆G. Since A is finite and G directed, we gain some g∈G so that A⊆Hg.
Now, let ((a,Z),b)∈B. Then (a,Z)Hg(RS((a,Z),A). Because of Condition 4.1(9) there is hence some j∈A′ with (a,Z)Hgj and (RS((a,Z),A)∈(CON′(j). It follows that (a,Z)H⨆Gj as well. Since ⟨B∣A⟩∈(st(⨆G), there is also some k∈A′ with (a,Z)H⨆Gk and k∼b[(RS((a,Z),A)]. Again by Condition 4.1(9) there is some r∈A′ with (a,Z)H⨆Gr and {j,k}∈(CON′(r). Consequently, j∼b[(RS((a,Z),A)], which shows that ⟨B∣A⟩∈(st(g). The converse inclusion follows by monotonicity.
∎
As shown in Ref. [1], L(Hg)=g and HL(G)=G. With Lemmas 5.27 and 5.28 we therefore obtain that the two functions (fct and (st are inverse to each other.
Proposition 5.31**.**
Let (A,(CON,⊢,Δ) and (A′,(CON′,⊢′,Δ′) be information systems with witnesses. Then the domains ∣A→A′∣ and [∣A∣→∣A′∣] are isomorphic.
6 Cartesian closure
As was shown in Ref. [1], the category ISW, as well as its full subcategories aISW, bcISW and abcISW, possess a terminal object and are closed under taking finite products.
The one-point information system with witnesses T=({Δ},(CONT,⊢T,Δ) with (CONT={(Δ,∅),(Δ,{Δ})) and ⊢T = (CONT×{Δ} is a terminal object.
For ν=1,2, let (Aν,(CONν,⊢ν,Δν) be an information system with witnesses. Set A×=A1×A2, Δ×=(Δ1,Δ2),
[TABLE]
and for ((i,j),X)∈(CON× and (a1,a2)∈A× define
[TABLE]
Moreover, let the relations Prν⊆(CON××Aν, with ν=1,2, be given by
[TABLE]
Then (A×,Pr1,Pr2) is the categorical product of A1 and A2.
The aim of this section is to show for information systems with witnesses A and A′ that ∣A→A′∣ is the exponent of A and A′ in the category ISW.
For a∈A, ⟨B∣A⟩∈A→A′, Z∈(CON(A→A′)×A(⟨B∣A⟩,a), and b∈A′, let
[TABLE]
Lemma 6.1**.**
(EV:(A→A′)×A⊩A′.
Proof.
We have to verify the conditions in Def. 4.1.
In case of Condition 4.1(1) we have to verify that
[TABLE]
i.e., we have to check whether (Δ′,(AP((Δ,∅),∅))⊢′Δ′, which holds by Axiom 3.1(3). Note that (AP((Δ,∅),∅) is empty.
For Condition 4.1(2) let Z,Z′∈(CON(A→A′)×A(⟨B∣A⟩,a)) with Z⊆Z′. Then
[TABLE]
Thus,
[TABLE]
Moreover,
[TABLE]
Therefore, the condition follows with Axioms 3.1(5, 9).
For Conditions 4.1(4, 6, 7, 9) we make use of Lemmas 4.2, 4.3 and 4.4, and verify Requirement (3) instead. Suppose to this end that ((⟨B∣A⟩,a),Z)(EVF. Then
[TABLE]
Because of the Global Interpolation Property there is some (j,Y)∈(CON′ so that
[TABLE]
By definition we moreover have that
[TABLE]
Hence, there exists (i,X)∈(CON with
[TABLE]
It follows that (CL((i,X),(pr1(A))⊆(CL((a,(pr2(Z)),(pr1(A)) and thus that {B2(i,X)}∈(CON′(B2(a,(pr2(Z))). Moreover, (AP((i,X),⋃(pr2,1(Z))=(AP((a,(pr2(Z)),⋃(pr2,1(Z)). So, we gain that
[TABLE]
By Axiom 3.1(8) there is thus some ˉ∈A′ such that
[TABLE]
and Y∪{j,Δ′}∈(CON′(ˉ).
Let D={((i,X),e)∣e∈Y∪{j}} and E∈(AC(D) be as in Lemma 5.8. Then we have for ((d,V),b)∈E that either ((d,V),b)=((i,X),ˉ), (DS((d,V),D)={(i,X)} and (RS((d,V),D)=Y∪{j}, or ((d,V),b)=((Δ,∅),Δ′), X is not empty, and (DS((d,V),D) and (RS((d,V),D) are both empty. It follows that in either case
[TABLE]
With Statement (49) we hence obtain that (⟨B∣A⟩,(pr1(Z))⊢→⟨E∣D⟩. By the Global Interpolation Property there are now ⟨W∣V⟩∈A→A′ and ⟨W∣V⟩∈(CON→(⟨W∣V⟩) such that
Z∈(CON(A→A′)×A(⟨B∣A⟩,j), and
((⟨B∣A⟩,j),Z)(EVb.
Then we have that
[TABLE]
(pr1(Z)∈(CON→(⟨B∣A⟩),
(pr2(Z)∈(CON(j),
{⟨B∣A⟩}∈(CON→(⟨W∣V⟩), and
{j}∈(CON(i), from which it follows that (pr1(Z)∈(CON→(⟨W∣V⟩) and (pr2(Z)∈(CON(i). Thus, Z∈(CON(A→A′)×A(⟨W∣V⟩,i).
Again we have to verify the conditions in Def. 4.1.
For Condition 4.1(1) we need to show that (Δ,∅)Λ(H)Δ→. Condition 6.2(1) holds vacuously. In case of Condition 6.2(2) it only needs be shown that ((Δ,Δ′),∅)HΔ′′, which is valid by Axiom 4.1(1). The remaining condition follows with Lemma 5.2(1).
Condition 4.1(2) is obviously satisfied, as it holds for H.
For Condition 4.1(3) assume that (a,S)⊢S′. Moreover, let (i,X)∈(CON′ and c∈A′′ such that ((a,i),S′×X)Hc. By Lemma 4.2 there is some ((aˉ,ˉ),U)∈(CONA×A′ such that
[TABLE]
and ((aˉ,ˉ),U)Hc. It follows that (a,S′)⊢(aˉ,(pr1(U)). Hence, (a,S)⊢(aˉ,(pr1(U)) and thus, ((a,i),S×X)⊢A×A′((aˉ,ˉ),U). Therefore, ((a,i),S×X)Hc. It is now an easy consequence that from (a,S′)Λ(H)⟨E∣D⟩ one obtains (a,S)Λ(H)⟨E∣D⟩.
As in the preceding proof, we verify Requirement (3) instead of Conditions 4.1(4, 6, 7, 9). Suppose that
[TABLE]
We have to show that there exists (ˉ,U)∈(CON and (⟨B∣A⟩,⟨W∣V⟩)∈(CONA′→A′′ so that
[TABLE]
If ⋃F is empty, let (ˉ,U)=(Δ,∅), ⟨B∣A⟩=ΔA′→A′′ and ⟨W∣V⟩={ΔA′→A′′}. Otherwise, assume that ⋃F={((iν,Xν),eν)∣1≤ν≤n}. Then we have for all 1≤ν≤n that ((a,iν),S×Xν)Heν. Thus, for each such ν there are ((aˉν,ˉν),Mν)∈(CONA×A′ and (^ν,Nν)∈(CON′′ with
[TABLE]
It follows that
[TABLE]
Thus, there is (aˉ,M)∈(CON with (a,S)⊢(aˉ,M) and (aˉ,M)⊢⋃ν=1n{aˉν}∪(pr1(Mν). Moreover, ((a,iν),S×Xν)⊢A×A′(aˉ,ˉν).
By definition of product information systems we have that
[TABLE]
Since Mν⊆(pr1(Mν)×(pr2(Mν), it follows with Statement (53) that
[TABLE]
By Statement (52) we have that (iν,Xν)⊢′(ˉν,(pr2(Mν)). Thus, there is some (^ν,Mν)∈(CON′ with (iν,Xν)⊢′(^ν,Mν) and (^ν,Mν)⊢′(ˉν,(pr2(Mν)). Here is what we have obtained so far:
[TABLE]
Since {(aˉ,ˉν)}∈(CONA×A′(aˉ,^ν), it follows with Statement (55) that
Next, we will construct B∈(AC(A) so that (aˉ,M)Λ(H)(⟨B∣A⟩,{⟨B∣A⟩}) and
[TABLE]
For each J⊆{1,…,n}, let R({(^ν,Mν)∣ν∈J}) be a system of representatives of W({(^ν,Mν)∣ν∈J}) with respect to ∼[⋃ν∈JMν] so that R(∅)={Δ} und R({^ν,Mν)})={^ν}, for 1≤ν≤n. By 6.2(2) there is some j(e,Z),(c,T),⟨G∣F⟩∈A′′, for each (e,Z)∈(CON, ⟨G∣F⟩∈⟨G∣F⟩ and ((c,T),b)∈G, with
[TABLE]
and ((e,c),Z×T)Hj(e,Z),(c,T),⟨G∣F⟩. In case that ((c,T),b)=((Δ′,∅),Δ′′), choose
[TABLE]
*Claim 1 *
For every J⊆A and each e∈R((pr1(J)) so that (e,J) is A-maximal there is some te,J∈A′′ with the following two properties:
[TABLE]
[TABLE]
With respect to the last set on the right hand side note that if ((c,T),b)∈G, then there is some L⊆F so that (c,L) is F-maximal and T=⋃(pr2,1(L). It follows that ∥L∥≤∥J∥.
The claim is demonstrated by induction on the cardinality κ of J. The case κ=0 is obvious. Set te,∅=Δ′′, if (e,∅) is A-maximal. All other sets on the left hand side in Statement (6) are empty in this case, except the last one, which is the singleton {Δ′′}, if for some ⟨G∣F⟩∈⟨G∣F⟩, ((Δ′,∅),Δ′′)∈G.
Assume next that the claim holds for all K⊆A of cardinality κ and let J⊆A of cardinality κ+1. Then
[TABLE]
because of Statement (58), Axiom 6.2(2) and the induction hypothesis. By Condition 4.1(9) there is hence some te,J∈A′′ so that Properties (6) and (6) hold.
With help of Claim 6 we can now define B. Let B(0) be as in Definition 5.7 and for κ≥1 set
[TABLE]
Obviously, B∈(AC(A).
*Claim 2 *
(aˉ,M)Λ(H)⟨B∣A⟩.
Because of Statement (58), Condition 6.2(1) is satisfied. For Condition 6.2(2) let
[TABLE]
Then there is some J⊆A such that (e,J) is A-maximal, T=⋃(pr2,1(J) and b=te,J. As follows from Properties (6) and (6), (pr2(J)∈(CON′′(te,J) and ((aˉ,e),M×T)Hte,J. Note that (pr2(J)=(RS((e,T),A) and choose j=te,J.
*Claim 3 *
(⟨B∣A⟩,{⟨B∣A⟩})⊢A′→A′′⟨G∣F⟩.
Let ⟨G∣F⟩∈⟨G∣F⟩ and ((iν,Xν),eν)∈F. Then (^ν,Nν)⊢′′eν. Moreover, Nν⊆(AP((iν,Xν),A), and by construction of B, {^ν}∈(CON′′(B2(iν,Xν)). Thus,
[TABLE]
which means that Condition 5.10(3a) holds. For Condition 5.10(3b) let (c,T),b)∈G and L⊆{1,…,n} such that (DS((c,T),F)={(iν,Xν)∣ν∈L}. Then it follows with Statement (61) that
[TABLE]
Note that {eν∣ν∈L}=(RS((c,T),F). By Axiom 3.1(8) there is thus some k∈A′′ with {eν∣ν∈L}∈(CON′′(k) and
[TABLE]
Therefore, {k}∈(CON′′(B2(c,T)).
By the definition of B(c,T) there is some J⊆A such that (B1,1(c,T),J) is A-maximal and B1,2(c,T)=⋃(pr2,1(J). Moreover, {((^ν,Mν),d)∣d∈Nν∧ν∈L}⊆J and B2(c,T)=tB1,1(c,T),J. It follows that
[TABLE]
Since in addition, j(aˉ,M),(c,T),⟨G∣F⟩∼b[(RS((c,T),F)], we obtain that also k∼b[(RS((c,T),F)].
Let to this end ((j,Y),d)∈D. As a consequence of Statement (63) we obtain that
[TABLE]
Moreover, because of Statement (62), we have for ((i,X),e)∈A∪⋃V that
[TABLE]
Now, suppose that (i,X)∈(CL((j,Y),(pr1(A∪⋃V)). Then i∼j[X] and hence (a,i)∼(a,j)[S×X]. With Lemma 5.3 it therefore follows with Statement (65) that ((a,j),S×X)He. Note that X⊆(CL((j,Y),(pr1(A∪⋃V)) and (CL((j,Y),(pr1(A∪⋃V))∈(CON′(j). Thus,
[TABLE]
by Axiom 4.1(2). Since (j,Y)⊢′(CL((j,Y),(pr1(A∪⋃V)), it ensues that ((a,j),S×Y)He, which shows that
[TABLE]
Because of Condition 4.1(9) there is hence some r∈A′′ with
[TABLE]
Furthermore, as a consequence of Axiom 6.2(2) and Statement (62), there is some rˉ∈A′′ with ((a,j),S×Y)H(rˉ,(AP((j,Y),A)) and
[TABLE]
It follows that for some r^∈A′′, ((a,j),S×Y)Hr^ and {r,rˉ}∈(CON′′(r^). Thus, r∼B2(j,Y)[(AP((j,Y),A)]. As ⟨W∣V⟩∈(CON→(⟨B∣A⟩), we obtain with Axiom 5.10(2b) that r∼B2(j,Y)[(AP((j,Y),⋃V)]. With Statement (64) we therefore have that
Because of Statement (63) and Axiom 5.10(3b) there is some k∈A′′ so that
[TABLE]
and
[TABLE]
As in the first part of the proof this implies that ((a,c),S×T)Hk. Thus, (a,S)Λ(H)⟨E∣D⟩.
For Condition 4.1(8) let {a}∈(CON(b), S∈(CON(a), (i,X)∈(CON′ and c∈A′′ so that ((a,i),S×X)Hc. We have that {(a,i)}∈(CONA×A′(b,i) and S×X∈(CONA×A′(a,i). Hence, S×X∈(CONA×A′(b,i) and ((b,i),S×X)Hc. Therefore, if (a,S)Λ(H)⟨E∣D⟩ then also (b,S)Λ(H)⟨E∣D⟩.
∎
Lemma 6.4**.**
(Λ(H)×(IdA′)∘(EV=H. for all H:A×A′⊩A′′.
Proof.
Let ((a,b),U)∈(CONA×A′ and c∈A′′ with ((a,b),U)((Λ(H)×(IdA′)∘(EV)c. Because of Lemma 4.2 there exists ((a′,b′),U′)∈(CONA×A′ such that
[TABLE]
In addition there is some ((⟨B∣A⟩,bˉ),U)∈(CON(A′→A′′)×A′ with
Together with Statement (76) we thus obtain that ((a,b),U)Hc.
Next assume conversely that ((a,b),U)Hc. Because of Lemmas 4.2, 4.3 and 4.4 there exist ((a′,b′),U′), ((a′′,b′′),U′′)∈(CONA×A′ and (j,V)∈(CON′′ such that
[TABLE]
Set
[TABLE]
and let B∈(AC(A) be as in Lemma 5.8. Then we have for (i,X)∈(CON′ that
[TABLE]
This shows that (a′′,(pr1(U′′))Λ(H)⟨B∣A⟩. Moreover, we obtain with Statement (78) that
[TABLE]
Now, note that (AP((b′,(pr2(U′)),A)=V and B2(b′,(pr2(U′))=j. Therefore, it follows with Statement (81) that
[TABLE]
Let Z={⟨B∣A⟩}×(pr2(U′). Then Z∈(CON(A′→A′′)×A′(⟨B∣A⟩,b′).
In addition, we have that ((⟨B∣A⟩,b′),Z)(EVc. With Statement (82) we now gain that
[TABLE]
as was to be shown.
∎
Lemma 6.5**.**
Λ((G×(IdA′)∘(EV)=G, for all G:A⊩A′→A′′.
Proof.
Let (a,V)∈(CON and ⟨W∣V⟩∈A′→A′′ so that
[TABLE]
Moreover, assume that V={((iν,Xν),eν)∣1≤ν≤n}. Then we have for every 1≤ν≤n that
[TABLE]
Thus, there are ((⟨B(ν)∣A(ν)⟩,bν),Zν)∈(CON(A′→A′′)×A′ with
from which we additionally gain that for ((t,S),c)∈W,
[TABLE]
Because of Axiom 3.1(8) there is thus some j∈A′′ so that
[TABLE]
It follows that also
[TABLE]
By definition, (t,S)⊢′(CL((t,S),(pr1(⋃D∪D)). Hence, there is some (b,T)∈(CON′ with
[TABLE]
Then
[TABLE]
Thus, we also have that
[TABLE]
So far we have shown that
[TABLE]
from which we obtain that
[TABLE]
Because of Statement (83) and Condition 6.2(2) there is also some ˉ∈A′′ so that
[TABLE]
With Condition 4.1(9) there then some k∈A′′ such that {j,ˉ}∈(CON′′(k) and ((a,t),V×S)((G×(IdA′)∘(EV)k. It follows that also j∼c[(RS((t,S),V)]. So, we have shown that
[TABLE]
from which we obtain with Statement (92) that (a,V)G⟨W∣V⟩.
Next, conversely, let (a,V)∈(CON and ⟨W∣V⟩∈A′→A′′ with
[TABLE]
Then there is some (⟨B∣A⟩,⟨G∣F⟩)∈(CONA′→A′′ with
[TABLE]
Let V={(iν,Xν),eν)∣1≤ν≤m}. Then we obtain for 1≤ν≤m that
[TABLE]
Moreover, there are (bν,Yν)∈(CON′, for 1≤ν≤m, with
[TABLE]
It follows that
[TABLE]
Thus,
[TABLE]
Set Zν=⟨G∣F⟩×Yν. Then Zν∈(CON(A′→A′′)×A′(⟨B∣A⟩,bν) and
[TABLE]
which means we have that
[TABLE]
It remains to verify Condition 6.2(2). Let to this end ((c,T),d)∈W. Because of Statement (95) and Condition 5.10(3b) there is some k∈A′′ with
[TABLE]
It follows that also
[TABLE]
Let (bˉ,Y)∈(CON′ such that
[TABLE]
Then
[TABLE]
and hence
[TABLE]
Set Z=⟨G∣F⟩×Y. Then Z∈(CON(A′→A′′)×A′(⟨B∣A⟩,bˉ)) and
Let A and A′ be information system with witnesses. Then (A→A′,(EV) is their exponent in ISW.
With Propositions 5.23 and 5.24 we moreover have that if both A and A′ satisfy Condition (ALG), (BC), or both of them, then (A→A′,(EV) is their exponent in aISW, bcISW, and abcISW, respectively.
As we have already seen, ISW as well as aISW, bcISW, and abcISW contain a terminal object. Moreover, we have shown how to construct the categorical product of information systems with witnesses.
Theorem 6.7**.**
The category ISW of information systems with witnesses and approximable mappings as well as its full subcategories aISW, bcISW, and abcISW, respectively, of information systems with witnesses satisfying Condition (ALG), (BC), or both of them are Cartesian closed.
7 Final remarks
This paper is a continuation of Ref. [1] where information systems with witnesses were introduced as a logic-style representation of L-domains: the category of these information systems with approximable mappings as morphisms was shown to be equivalent to the category of L-domains with Scott continuous functions. As demonstrated in Ref. [3], the latter category is one of the two Cartesian closed full subcategories of the category of continuous domains. It follows in particular that the category of information systems with witnesses is Cartesian closed as well. In the present paper a direct construction of exponentiation in this category is presented.
Logic-style representations of domains—in particular those forming a Cartesian closed category—allow incorporating the domains into proof assistants, as done in the Minlog system, developed by the Munich logic group (cf. Ref. [13]).
Minlog is an interactive proof system based on first order natural deduction calculus. It is intended to reason about higher-type computable functionals, using minimal rather than classical or intuitionistic logic. Minlog implements a theory of computable functionals. The underlying semantics is the Scott-Ershov model of partial continuous functionals, with free algebras as base types. These algebras are viewed as domains represented by Scott’s information systems, whose tokens are constructor trees possibly involving the symbol ∗ (“no information”) (Ref. [14]).
By using information systems with witnesses instead of Scott’s information systems a larger class of data structures and computable functionals can be considered. Examples of topological hyperspaces are known that are L-domains with respect to superset inclusion, but are not bounded-complete (cf. e.g. Ref. [3, p. 58]).
Bibliography14
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] D. Spreen. Generalised information systems capture L-domains. Theoret. Comput. Sci. 869 1–28 (2021); doi.org/10.1016/j.tcs.2020.12.044.
2[2] T. Coquand. Categories of embeddings. Theoret. Comput. Sci. 68 221–238 (1989).
3[3] A. Jung, Cartesian Closed Categories of Domains. CWI Tracts, vol. 66 . Centrum voor Wiskunde en Informatica, Amsterdam (1989).
4[4] A. Jung, The classification of continuous domains. In: Proc., Fifth Annual IEEE Symposium on Logic in Computer Science . IEEE Computer Society Press, New York (1990), pp. 35–40.
5[5] D. Scott, Domains for denotational semantics. In: M. Nielsen et al. (eds.), Automata, Languages and Programming , Aarhus (1982). Lecture Notes in Computer Science, vol. 140 . Springer, Berlin (1982), pp. 577–613.
6[6] R. Hoofman, Continuous information systems. Inform. Computation . 105 42–71 (1993).
7[7] S. Abramsky and A. Jung, Domain theory. In: S. Abramsky et al. (eds.), Handbook of Logic in Computer Science , vol. 3 . Clarendon Press, Oxford (1994), pp. 1–168.
8[8] R. M. Amadio and P.-L. Curien, Domains and Lambda-Calculi . Cambridge University Press, Cambridge (1998).