E-LIB Suche - Ergebnisse für: Willard, Dan E.

1

About the characterization of a fine line that separates ge..:

Willard, Dan E
Journal of Logic and Computation. 31 (2020) 1 - p. 375-392 , 2020

Link: https://doi.org/10.1093/..

2

On the Tender Line Separating Generalizations and Boundary-..:

, In: Logical Foundations of Computer Science; Lecture Notes in Computer Science,

Willard, Dan E. - p. 268-286 , 2019

Link: https://doi.org/10.1007/..

3

Some specially formulated axiomizations for IΣ0manage to ev..:

Willard, Dan E.
Information and Computation. 207 (2009) 10 - p. 1078-1093 , 2009

Link: https://doi.org/10.1016/..

4

Passive induction and a solution to a Paris–Wilkie open que..:

Willard, Dan E.
Annals of Pure and Applied Logic. 146 (2007) 2-3 - p. 124-149 , 2007

Link: https://doi.org/10.1016/..

5

A generalization of the Second Incompleteness Theorem and s..:

Willard, Dan E.
Annals of Pure and Applied Logic. 141 (2006) 3 - p. 472-496 , 2006

Link: https://doi.org/10.1016/..

6

The Axiom System IΣ0 Manages to Simultaneously Obey and Eva..:

Willard, Dan E.
Electronic Notes in Theoretical Computer Science. 165 (2006) - p. 213-226 , 2006

Link: https://doi.org/10.1016/..

7

On the Available Partial Respects in Which an Axiomatizatio..:

Willard, Dan E.
The Journal of Symbolic Logic. 71 (2006) 4 - p. 1189-1199 , 2006

Link: https://www.jstor.org/st..

8

An Exploration of the Partial Respects in Which an Axiom Sy..:

Willard, Dan E.
The Journal of Symbolic Logic. 70 (2005) 4 - p. 1171-1209 , 2005

Link: https://www.jstor.org/st..

9

How to Extend the Semantic Tableaux and Cut-Free Versions o..:

Willard, Dan E.
The Journal of Symbolic Logic. 67 (2002) 1 - p. 465-496 , 2002

Link: https://www.jstor.org/st..

10

An Algorithm for Handling Many Relational Calculus Queries ..:

Willard, Dan E.
Journal of Computer and System Sciences. 65 (2002) 2 - p. 295-331 , 2002

Link: https://doi.org/10.1006/..

11

Self-Verifying Axiom Systems, the Incompleteness Theorem an..:

Willard, Dan E.
The Journal of Symbolic Logic. 66 (2001) 2 - p. 536-596 , 2001

Link: https://www.jstor.org/st..

12

Examining Computational Geometry, Van Emde Boas Trees, and ..:

Willard, Dan E.
SIAM Journal on Computing. 29 (2000) 3 - p. 1030-1049 , 2000

Link: https://doi.org/10.1137/..

13

Applications of Range Query Theory to Relational Data Base ..:

Willard, Dan E.
Journal of Computer and System Sciences. 52 (1996) 1 - p. 157-169 , 1996

Link: https://doi.org/10.1006/..

14

Trans-dichotomous algorithms for minimum spanning trees and..:

Fredman, Michael L. ; Willard, Dan E.
Journal of Computer and System Sciences. 48 (1994) 3 - p. 533-551 , 1994

Link: https://doi.org/10.1016/..

15

Surpassing the information theoretic bound with fusion tree:

Fredman, Michael L. ; Willard, Dan E.
Journal of Computer and System Sciences. 47 (1993) 3 - p. 424-436 , 1993

Link: https://doi.org/10.1016/..