( en | de | ru )

 

Disambiguation of "Scott, Dana S."

Author of the publication

copydeleteadd this publication to your clipboard
Generalization of a Lemma of G. F. Rose.

, , and . J. Symb. Log., 23 (2): 137-138 (1958)

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.

Martina Christine Scotti

Pierre-François Scotto

Peter Scott

Felix Markus Hubertus Scotti

James Wesley Scott

 

Other publications of authors with the same name

Can Modalities Save Naive Set Theory?, , , and . Rev. Symb. Log., 11 (1): 21-47 (2018)Logic and Programming Languages.. Commun. ACM, 20 (9): 634-641 (1977)Will Logicians be Replaced by Machines?. TACS, volume 526 of Lecture Notes in Computer Science, page 771. Springer, (1991)What Can We Hope to Achieve From Automated Deduction? (Abstract).. CADE, volume 1104 of Lecture Notes in Computer Science, page 245. Springer, (1996)Semilattices, Domains, and Computability (Invited Talk).. CCA, volume 11 of OASIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany, (2009)Effective versions of equilogical spaces.. Workshop on Domains, volume 35 of Electronic Notes in Theoretical Computer Science, page 204. Elsevier, (1998)Automating Free Logic in HOL, with an Experimental Application in Category Theory., and . J. Autom. Reason., 64 (1): 53-72 (2020)Reconsidering Ordered Pairs., and . Bull. Symb. Log., 14 (3): 379-397 (2008)Continuous Lattices and Domains., , , , , , and . Stud Logica, 86 (1): 137-138 (2007)Extensional PERs, , , and . LICS, page 346-354. IEEE Computer Society, (1990)