Martin Davis. Hilbert's Tenth Problem is Unsolvable. American Mathematical Monthly, 80(3):233-269, March 1973. Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
First 50 documents
On Diophantine Complexity and Statistical Zero-Knowledge Arguments - Lipmaa (2003) (1 citation) (Correct)
A Generalized Approach to Equational Unification - Yelick (1985) (3 citations) (Correct)
Defining Integrality at Prime Sets of High Density over.. - Shlapentokh (2001) (Correct)
On Diophantine definability and decidability in some infinite.. - Shlapentokh (2001) (Correct)
On Diophantine definability and decidability in large subrings.. - Shlapentokh (2001) (1 citation) (Correct)
Diophantine Undecidability of Function Fields of Characteristic .. - Shlapentokh (2001) (Correct)
Diophantine Representations of Linear Recurrences, I - Vsemirnov (1999) (Correct)
On Automatically Generating and Using Examples in a Computational.. - Kim (Correct)
Description Logics with Concrete Domains and Aggregation - Baader, Sattler (1998) (21 citations) (Correct)
A Survey of Computational Complexity Results in Systems and.. - Blondel, Tsitsiklis (2000) (32 citations) (Correct)
Schema Equivalence in Heterogeneous Systems: - Bridging Theory (Correct)
Information-theoretic Limitations of Formal Systems - Chaitin (1974) (4 citations) (Correct)
Description Logics with Concrete Domains and Aggregation - Baader, Sattler (1998) (21 citations) (Correct)
Extensions of Terminological Knowledge Representation Languages.. - Baader (1996) (1 citation) (Correct)
A Scheme for Integrating Concrete Domains into Concept Languages - Baader, Hanschke (1991) (120 citations) (Correct)
On the Non-Existence of a Universal Learning Algorithm for.. - Wiklicky (1994) (1 citation) (Correct)
Reengineering Unification And T-Entailment For Mantra In C++ - Kharma (1996) (Correct)
Improving Static Analysis Accuracy on Concurrent Ada Programs.. - Chamillard (1995) (1 citation) (Correct)
Schema Intension Graphs: A Formal Model for the Study of.. - Miller Ioannidis (1993) (Correct)
On Diophantine Complexity and Statistical Zero-Knowledge Arguments - Lipmaa (2003) (1 citation) (Correct)
Prvosla Obsahuj Libovoln Dlouh Aritmetick Posloupnosti - Martin Klazar Vod (Correct)
Information-theoretic Limitations of Formal Systems - Chaitin (1974) (4 citations) (Correct)
Software Tools for the Specification Language LOTOS - van Eijk (1988) (4 citations) (Correct)
Description Logics with Aggregates and Concrete Domains - Baader, Sattler (1998) (6 citations) (Correct)
The Convenience of Tilings - Boas (1997) (13 citations) (Correct)
First 50 documents
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC