Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2010

2010

Abstract The undecidability of first-order logic implies that there is no computable bound on the length of shortest proofs of… Expand

Highly Cited

2007

Highly Cited

2007

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

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

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

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

1988

1988

Many iterative algorithms for the solution of large linear systems may be effectively vectorized if the diagonal of the matrix is… Expand

Highly Cited

1979

Highly Cited

1979

Solvable Classes of Quantificational Formulas Burton Dreben and Warren D. Goldfarb, Harvard Univ. Skolem and Herbrand addressed… Expand

1972

1972

The reduction of one combinatorial decision problem PI to another P2 can be achieved by constructing an effective map r : Pa… Expand

1964

1964

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

In § 1 we present conceptual material concerning the notion of a Godel numbering of the partial recursive functions. § 2 presents… Expand