Gödel numbering

Known as: Godel set, Godel number, Gödel numbers
In mathematical logic, a Gödel numbering is a function that assigns to each symbol and well-formed formula of some formal language a unique natural…
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
• 2015
• Corpus ID: 21128622
A standard methodology in philosophy of language is to use intuitions as evidence. Machery, Mallon, Nichols, and Stich (2004…
2010
2010
• SOCS
• 2010
• Corpus ID: 677683
In this paper we improve solving two-player games by computing the game-theoretical value of every reachable state. A graphics…
Highly Cited
2007
Highly Cited
2007
• Stud Logica
• 2007
• Corpus ID: 10960190
A continuous t-norm is a continuous map * from [0, 1]2 into [0, 1] such that $$\langle [0, 1], *, 1 \rangle$$ is a commutative…
Highly Cited
2001
Highly Cited
2001
• Soft Comput.
• 2001
• Corpus ID: 39852673
Abstract BL algebras were introduced by Hájek as algebraic structures for his Basic Logic, starting from continuous t-norms on [0…
Highly Cited
2000
Highly Cited
2000
• Soft Comput.
• 2000
• Corpus ID: 39838846
Abstract In this paper we prove that Basic Logic (BL) is complete w.r.t. the continuous t-norms on [0, 1], solving the open…
Highly Cited
1993
Highly Cited
1993
• J. Algorithms
• 1993
• Corpus ID: 961056
Abstract The all nearest smaller values problem is defined as follows. Let A = ( a 1 , a 2 ,..., a n ) be n elements drawn from a…
Highly Cited
1987
Highly Cited
1987
• Ann. Pure Appl. Log.
• 1987
• Corpus ID: 40701869
Highly Cited
1979
Highly Cited
1979
• 1979
• Corpus ID: 8208317
Solvable Classes of Quantificational Formulas Burton Dreben and Warren D. Goldfarb, Harvard Univ. Skolem and Herbrand addressed…
1964
1964
In [3], Rogers discussed the concept of Godel numbering. He defined a semi-effective numbering, constructed a semi-lattice of…
Highly Cited
1958
Highly Cited
1958
• H. Rogers
• Journal of Symbolic Logic
• 1958
• Corpus ID: 38325064
In § 1 we present conceptual material concerning the notion of a Gödel numbering of the partial recursive functions. § 2 presents…