×

Chain properties in Pomega. (English) Zbl 0471.68009


MSC:

68P05 Data structures
06B99 Lattices
68Q60 Specification and verification (program logics, model checking, etc.)
68N01 General topics in the theory of software
Full Text: DOI

References:

[1] Addison, J. W., Methods of Alternating Chains, (Theory of Models (1965), North-Holland: North-Holland Amsterdam) · Zbl 0199.01201
[2] Manna, Z., Mathematical Theory of Computation (1974), McGraw-Hill: McGraw-Hill New York · Zbl 0353.68066
[3] Reynolds, J., On the relation between direct and continuation semantics, Proc. Second Colloquium on Automata, Languages and Programming (1974), Saarbrucken · Zbl 0313.68023
[4] Rogers, H., Theory of recursive functions and effective computability (1967), McGraw-Hill: McGraw-Hill New York · Zbl 0183.01401
[5] D. Scott, Continuous lattices, Lecture notes in Mathematics 274 (Springer, Berlin).; D. Scott, Continuous lattices, Lecture notes in Mathematics 274 (Springer, Berlin). · Zbl 0239.54006
[6] Scott, D., Data types as lattices, Siam J. Comput. (1976), September · Zbl 0337.02018
[7] Scott, D.; Tang, A., Normal form theorems and enumeration reducibility in Pω (1978), to appear
[8] Sciore, E.; Tang, A., Computability theory in admissible domains, SIGACT theory of computing (1978) · Zbl 1282.68093
[9] Tang, A., Borel sets in Pω, IRIA Report, No. 137 (1975)
[10] A. Tang and W. Wadge, Wadge reducibility in Pω (in preparation).; A. Tang and W. Wadge, Wadge reducibility in Pω (in preparation).
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.