Skip to search formSkip to main contentSkip to account menu

Gödel

Known as: Godel (programming language), Goedel (programming language), Goedel programming language 
Gödel is a declarative, general-purpose programming language that adheres to the logic programming paradigm. It is a strongly typed language, the… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2007
Highly Cited
2007
In 1931, the young Kurt Gödel published his First Incompleteness Theorem, which tells us that, for any sufficiently rich theory… 
Highly Cited
2007
Highly Cited
2007
We present the first class of mathematically rigorous, general, fully self-referential, self-improving, optimally efficient… 
2006
2006
This paper describes the enormous impact of Gödel’s work on mathematical logic and recursion theory. After a brief description of… 
Highly Cited
2000
Highly Cited
2000
Note: Article first published in 2000 in Industrial and Corporate Change, vol.9, n.2, pp.213-253. Reference CEMI-CHAPTER-2005-037… 
Review
2000
Review
2000
The many motivations for employing agent-based computation in the social sciences are reviewed. It is argued that there exist… 
Highly Cited
1986
Highly Cited
1986
In this paper we present a set of clauses for set theory, thus developing a foundation for the expression of most theorems of… 
Highly Cited
1966
Highly Cited
1966
Gödel’s famous proof [2, 1] is highly interesting, but may be hard to understand. Some of this difficulty is due to the fact that… 
Highly Cited
1961
Highly Cited
1961
Gödei's Theorem seems to me to prove that Mechanism is false, that is, that minds cannot be explained as machines. So also has it… 
Review
1949
Review
1949
Kurt Gödel became interested in general relativity theory while he and Einstein were both on staff of the Institute for Advanced… 
Highly Cited
1936
Highly Cited
1936
We shall say that a logic is “simply consistent” if there is no formula A such that both A and ∼ A are provable. “ω-consistent…