Skip to search formSkip to main contentSkip to account menu

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

Related topics

Related topics

33 relations
AlgorithmBlum axiomsCodeCompression theorem

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Reference in the Land of the Rising Sun: A Cross-cultural Study on the Reference of Proper Names
A standard methodology in philosophy of language is to use intuitions as evidence. Machery, Mallon, Nichols, and Stich (2004… 
2010
2010
GPU Exploration of Two-Player Games with Perfect Hash Functions
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
Basic Hoops: an Algebraic Study of Continuous t-norms
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
Pseudo-t-norms and pseudo-BL algebras
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
Basic Fuzzy Logic is the logic of continuous t-norms and their residua
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
Optimal Doubly Logarithmic Parallel Algorithms Based on Finding All Nearest Smaller Values
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
An axiomatic approach to self-referential truth
Highly Cited
1979
Highly Cited
1979
The decision problem: Solvable classes of quantificational formulas
Solvable Classes of Quantificational Formulas Burton Dreben and Warren D. Goldfarb, Harvard Univ. Skolem and Herbrand addressed… 
1964
1964
Gödel numberings versus Friedberg numberings
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
Gödel numberings of partial recursive functions
  • 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… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License