Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 205,568,304 papers from all fields of science
Search
Sign In
Create Free Account
Gödel numbering
Known as:
Godel set
, Godel number
, Gödel numbers
Expand
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…
Expand
Wikipedia
Create Alert
Alert
Related topics
Related topics
33 relations
Algorithm
Blum axioms
Code
Compression theorem
Expand
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
J. Sytsma
,
J. Livengood
,
Ryoji Sato
,
Mineki Oguchi
2015
Corpus ID: 21128622
A standard methodology in philosophy of language is to use intuitions as evidence. Machery, Mallon, Nichols, and Stich (2004…
Expand
2010
2010
GPU Exploration of Two-Player Games with Perfect Hash Functions
S. Edelkamp
,
Damian Sulewski
,
Cengizhan Yücel
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…
Expand
Highly Cited
2007
Highly Cited
2007
Basic Hoops: an Algebraic Study of Continuous t-norms
P. Aglianò
,
I. Ferreirim
,
F. Montagna
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…
Expand
Highly Cited
2001
Highly Cited
2001
Pseudo-t-norms and pseudo-BL algebras
P. Flondor
,
G. Georgescu
,
A. Iorgulescu
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…
Expand
Highly Cited
2000
Highly Cited
2000
Basic Fuzzy Logic is the logic of continuous t-norms and their residua
R. Cignoli
,
F. Esteva
,
L. Godo
,
A. Torrell
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…
Expand
Highly Cited
1993
Highly Cited
1993
Optimal Doubly Logarithmic Parallel Algorithms Based on Finding All Nearest Smaller Values
O. Berkman
,
B. Schieber
,
U. Vishkin
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…
Expand
Highly Cited
1987
Highly Cited
1987
An axiomatic approach to self-referential truth
H. Friedman
,
M. Sheard
Ann. Pure Appl. Log.
1987
Corpus ID: 40701869
Highly Cited
1979
Highly Cited
1979
The decision problem: Solvable classes of quantificational formulas
B. Dreben
,
W. Goldfarb
1979
Corpus ID: 8208317
Solvable Classes of Quantificational Formulas Burton Dreben and Warren D. Goldfarb, Harvard Univ. Skolem and Herbrand addressed…
Expand
1964
1964
Gödel numberings versus Friedberg numberings
M. B. Pour-El
1964
Corpus ID: 16812405
In [3], Rogers discussed the concept of Godel numbering. He defined a semi-effective numbering, constructed a semi-lattice of…
Expand
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…
Expand
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
ACCEPT & CONTINUE