Crossref Citations
This Book has been
cited by the following publications. This list is generated based on data provided by Crossref.
Stoltenberg-Hansen, V.
and
Tucker, J. V.
1993.
Semantics: Foundations and Applications.
Vol. 666,
Issue. ,
p.
531.
Palmgren, E.
and
Stoltenberg-Hansen, V.
1995.
Logically presented domains.
p.
455.
Sigstam, Inger
1995.
Formal spaces and their effective presentations.
Archive for Mathematical Logic,
Vol. 34,
Issue. 4,
p.
211.
Hedberg, Michael
1996.
A type-theoretic interpretation of constructive domain theory.
Journal of Automated Reasoning,
Vol. 16,
Issue. 3,
p.
369.
Edalat, Abbas
1997.
Domains for Computation in Mathematics, Physics and Exact Real Arithmetic.
Bulletin of Symbolic Logic,
Vol. 3,
Issue. 4,
p.
401.
Palmgren, Erik
and
Stoltenberg-Hansen, Viggo
1997.
A logical presentation of the continuous functionals.
Journal of Symbolic Logic,
Vol. 62,
Issue. 3,
p.
1021.
Schwichtenberg, Helmut
and
Stroetmann, Karl
1997.
Logic and Scientific Methods.
p.
209.
Baier, Christel
and
Majster-Cederbaum, Mila
1997.
The connection between initial and unique solutions of domain equations in the partial order and metric approach.
Formal Aspects of Computing,
Vol. 9,
Issue. 4,
p.
425.
Spreen, Dieter
1998.
On effective topological spaces.
Journal of Symbolic Logic,
Vol. 63,
Issue. 1,
p.
185.
Mislove, Michael
1998.
Foundations of Software Science and Computation Structures.
Vol. 1378,
Issue. ,
p.
1.
Negri, Sara
1998.
Types for Proofs and Programs.
Vol. 1512,
Issue. ,
p.
333.
Blanck, Jens
Stoltenberg-Hansen, Viggo
and
Tucker, John V.
1998.
Prospects for Hardware Foundations.
Vol. 1546,
Issue. ,
p.
27.
Hanus, Michael
and
Lucas, Salvador
1999.
Functional and Logic Programming.
Vol. 1722,
Issue. ,
p.
353.
Edalat, Abbas
and
Lieutier, André
1999.
Foundation of a computable solid modeling.
p.
278.
Normann, Dag
Palmgren, Erik
and
Stoltenberg-Hansen, Viggo
1999.
Hyperfinite type structures.
Journal of Symbolic Logic,
Vol. 64,
Issue. 3,
p.
1216.
Normann, Dag
2000.
Computability over the partial continuous functionals.
Journal of Symbolic Logic,
Vol. 65,
Issue. 3,
p.
1133.
Bauer, Andrej
and
Birkedal, Lars
2000.
Computer Science Logic.
Vol. 1862,
Issue. ,
p.
202.
Blanck, Jens
2001.
Computability and Complexity in Analysis.
Vol. 2064,
Issue. ,
p.
1.
Tsaur, Rueiher
and
Smyth, Michael B.
2001.
Digital and Image Geometry.
Vol. 2243,
Issue. ,
p.
75.
Aceto, Luca
Fokkink, Wan
and
Verhoef, Chris
2001.
Handbook of Process Algebra.
p.
197.