Author of the publication

Definability of Total Objects in PCF and Related Calculi.

. TLCA, volume 2044 of Lecture Notes in Computer Science, page 4-5. Springer, (2001)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Computability in Europe 2011., , , and . Ann. Pure Appl. Logic, 164 (5): 509-510 (2013)Higher-Order Computability, and . Theory and Applications of Computability Springer, (2015)Closing the gap between the continuous functionals and recursion in 3E.. Arch. Math. Log., 36 (4-5): 269-287 (1997)The extensional realizability model of continuous functionals and three weakly non-constructive classical theorems.. Logical Methods in Computer Science, (2015)David Marker, Lectures on Infinitary Model Theory - Series: Lecture Notes in Logic, Vol. 46 2016, pp. 192. ISBN-13: 978-1107181939.. Studia Logica, 106 (6): 1319-1323 (2018)A Jump Operator in Set Recursion.. Math. Log. Q., 25 (13-18): 251-264 (1979)Definability of Total Objects in PCF and Related Calculi.. TLCA, volume 2044 of Lecture Notes in Computer Science, page 4-5. Springer, (2001)The extensional ordering of the sequential functionals., and . Ann. Pure Appl. Logic, 163 (5): 575-603 (2012)The continuous functionals of finite types over the reals.. Electron. Notes Theor. Comput. Sci., (2000)The Computational Power of Muomega., and . Math. Log. Q., 48 (1): 117-124 (2002)