Skip to main content

The Gupta-Belnap Fixed-Point Problem and the Theory of Clones of Functions

  • Chapter
Book cover Foundations of the Formal Sciences II

Part of the book series: Trends in Logic ((TREN,volume 17))

  • 292 Accesses

Abstract

This paper presents the Gupta-Belnap Fixed-Point problem: to characterize the truth-functional schemes of the first-order logic such that, for every interpreted language L, a truth predicate for L can be defined in L using a Kripkean fixed-point. A propositional version of the problem is defined using the stipulation logic of A. Visser and then the strategy adopted for the solution to the three-valued case is presented, using the theory of clones of functions.

The author wants to thank Rafael Beneyto Torres for his constant help during the preparation of this work and the financial support offered by the grants of the Generalitat Valenciana (F.P.I.) and Fundación Caja de Madrid.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. We make this restriction for the sake of simplicity, but using codification we could get rid of it.

    Google Scholar 

  2. See the examples of Saul Kripke in [Kri175].

    Google Scholar 

  3. Cf. [Vis89] and [GupBel93].

    Google Scholar 

  4. We will use as the set of truth values in three-valued logics the set Λ3 = {0, 1, 2}, {0,1} being the classical values and 2 the value ‘is neither true nor false’.

    Google Scholar 

  5. Cf [Kri175].

    Google Scholar 

  6. The original problem (cf. [GupBel93, p. 63]) was restricted to three and four-valued schemes, because the most important many-valued logics proposed as solutions to paradoxes have three or four values.

    Google Scholar 

  7. Cf. [Vis89].

    Google Scholar 

  8. This case is easy, but not interesting, as it can be proved that the maximal bivalent clone that has the fixed-point property is the one generated by classical conjunction and disjunction.

    Google Scholar 

  9. As it is usual in the theory of algebras of functions, we represent a relation as a matrix, whose columns are the elements of the relation.

    Google Scholar 

  10. The proposition is a corollary of the Theorem 2 and the characterization of all the two-valued clones given by Post in [Pos4l].

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Fernández, J.M. (2003). The Gupta-Belnap Fixed-Point Problem and the Theory of Clones of Functions. In: Löwe, B., Malzkom, W., Räsch, T. (eds) Foundations of the Formal Sciences II. Trends in Logic, vol 17. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-0395-6_13

Download citation

  • DOI: https://doi.org/10.1007/978-94-017-0395-6_13

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-90-481-6233-8

  • Online ISBN: 978-94-017-0395-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics