Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.
Gödel numbering
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
A standard methodology in philosophy of language is to use intuitions as evidence. Machery, Mallon, Nichols, and Stich (2004… Expand
Is this relevant?
2015
2015
We introduce a compressed de Bruijn representation of lambda terms and define its bijections to standard representations. Compact… Expand
Is this relevant?
2014
2014
Publisher Summary
This chapter discusses semantical analysis of modal logic ii and non-normal modal propositional calculi. The… Expand
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Abstract BL algebras were introduced by Hájek as algebraic structures for his Basic Logic, starting from continuous t-norms on [0… Expand
Is this relevant?
Highly Cited
1993
Highly Cited
1993
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… Expand
Is this relevant?
1990
1990
The set of rationals is not recursive over any field of infinite tran- scendence degree. There has been a great deal of work in… Expand
Is this relevant?
1982
1982
Creative sets or the complete recursively enumerable sets play an important role in logic and mathematics and they are known to… Expand
Is this relevant?
1972
1972
The reduction of one combinatorial decision problem PI to another P2 can be achieved by constructing an effective map r : Pa… Expand
Is this relevant?
1964
1964
In [3], Rogers discussed the concept of Godel numbering. He defined a semi-effective numbering, constructed a semi-lattice of… Expand
Is this relevant?
Highly Cited
1958
Highly Cited
1958
In § 1 we present conceptual material concerning the notion of a Godel numbering of the partial recursive functions. § 2 presents… Expand
Is this relevant?