Dan E. Willard

From MaRDI portal
Person:731896

Available identifiers

zbMath Open willard.dan-eMaRDI QIDQ731896

List of research outcomes





PublicationDate of PublicationType
About the characterization of a fine line that separates generalizations and boundary-case exceptions for the Second Incompleteness Theorem under semantic tableau deduction2022-02-08Paper
How the Law of Excluded Middle Pertains to the Second Incompleteness Theorem and its Boundary-Case Exceptions2020-06-01Paper
On the tender line separating generalizations and boundary-case exceptions for the second incompleteness theorem under semantic tableaux deduction2020-05-06Paper
About the Chasm Separating the Goals of Hilbert's Consistency Program from the Second Incompletess Theorem2018-07-12Paper
On How the Introducing of a New $\theta$ Function Symbol Into Arithmetic's Formalism Is Germane to Devising Axiom Systems that Can Appreciate Fragments of Their Own Hilbert Consistency2016-12-23Paper
On the Broader Epistemological Significance of Self-Justifying Axiom Systems2015-01-13Paper
On the Significance of Self-Justifying Axiom Systems from the Perspective of Analytic Tableaux2013-06-29Paper
The Axiom System IΣ0 Manages to Simultaneously Obey and Evade the Herbrandized Version of the Second Incompleteness Theorem2013-05-03Paper
A Detailed Examination of Methods for Unifying, Simplifying and Extending Several Results About Self-Justifying Logics2011-08-31Paper
Some specially formulated axiomizations for \(\mathrm{I}\Sigma _0\) manage to evade the Herbrandized version of the second incompleteness theorem2009-10-09Paper
Passive induction and a solution to a Paris-Wilkie open question2007-05-23Paper
On the available partial respects in which an axiomatization for real valued arithmetic can recognize its consistency2007-01-19Paper
An exploration of the partial respects in which an axiom system recognizing solely addition as a total function can verify its own consistency2006-09-06Paper
A generalization of the second incompleteness theorem and some exceptions to it2006-08-16Paper
Automated Reasoning with Analytic Tableaux and Related Methods2006-07-07Paper
https://portal.mardi4nfdi.de/entity/Q33673342006-01-24Paper
https://portal.mardi4nfdi.de/entity/Q44128662003-07-17Paper
An algorithm for handling many relational calculus queries efficiently.2003-05-14Paper
How to extend the semantic tableaux and cut-free versions of the second incompleteness theorem almost to Robinson's arithmetic q2003-02-06Paper
Self-verifying axiom systems, the incompleteness theorem and related reflection principles2002-08-29Paper
https://portal.mardi4nfdi.de/entity/Q27212112001-07-01Paper
Examining Computational Geometry, Van Emde Boas Trees, and Hashing from the Perspective of the Fusion Tree2000-03-19Paper
https://portal.mardi4nfdi.de/entity/Q43758001998-11-03Paper
https://portal.mardi4nfdi.de/entity/Q43645241998-04-01Paper
Applications of range query theory to relational data base join and selection operations1996-07-16Paper
Optimal sample cost residues for differential database batch query problems1994-08-21Paper
Trans-dichotomous algorithms for minimum spanning trees and shortest paths1994-06-29Paper
Surpassing the information theoretic bound with fusion trees1994-03-24Paper
https://portal.mardi4nfdi.de/entity/Q42826181994-03-17Paper
A density control algorithm for doing insertions and deletions in a sequentially ordered file in a good worst-case time1992-06-28Paper
On the angle restricted nearest neighbor problem1990-01-01Paper
Lower bounds for the addition-subtraction operations in orthogonal range queries and related problems1989-01-01Paper
Parallel processing can be harmful: The unusual behavior of interpolation search1989-01-01Paper
Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37300361986-01-01Paper
Adding range restriction capability to dynamic data structures1985-01-01Paper
New Data Structures for Orthogonal Range Queries1985-01-01Paper
Searching Unindexed and Nonuniformly Generated Files in $\log \log N$ Time1985-01-01Paper
Algorithms for resolving conflicts in dynamic storage allocation1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36852101985-01-01Paper
New trie data structures which support very fast search operations1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37144921984-01-01Paper
Log-logarithmic worst-case range queries are possible in space theta(N)1983-01-01Paper
Polygon Retrieval1982-01-01Paper
A data structure for dynamic range queries1982-01-01Paper

Research outcomes over time

This page was built for person: Dan E. Willard