Ron Sigal

1996
3		Ron Sigal: Generic Models of Logic Programs. J. Log. Comput. 6(5): 629-661 (1996)
1989
2		Dana May Latch, Ron Sigal: A Local Termination Property for Term Rewriting Systems. RTA 1989: 222-233
1		Ron Sigal: Undecidable Complexity Statements in E alpha S-Arithmetic. J. Symb. Log. 54(2): 415-427 (1989)

Coauthor Index

1

Dana May Latch

[2]