Skip to main content

Unsatisfiable Formulae of Gödel Logic with Truth Constants and , \(\prec \), \(\Delta \) Are Recursively Enumerable

  • Conference paper
  • First Online:
Advances in Swarm and Computational Intelligence (ICSI 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9142))

Included in the following conference series:

Abstract

This paper brings a solution to the open problem of recursive enumerability of unsatisfiable formulae in the first-order Gödel logic. The answer is affirmative even for a useful expansion by intermediate truth constants and the equality, , strict order, \(\prec \), projection \(\Delta \) operators. The affirmative result for unsatisfiable prenex formulae of \(G_\infty ^\Delta \) has been stated in [1]. In [7], we have generalised the well-known hyperresolution principle to the first-order Gödel logic for the general case. We now propose a modification of the hyperresolution calculus suitable for automated deduction with explicit partial truth.

D. Guller—This work is partially supported by VEGA Grant 1/0592/14.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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. Baaz, M., Ciabattoni, A., Fermüller, C.G.: Theorem proving for prenex Gödel logic with delta: checking validity and unsatisfiability. Logical Methods in Computer Science 8(1) (2012)

    Google Scholar 

  2. Esteva, F., Gispert, J., Godo, L., Noguera, C.: Adding truth-constants to logics of continuous t-norms: axiomatization and completeness results. Fuzzy Sets and Systems 158(6), 597–618 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  3. Esteva, F., Godo, L., Noguera, C.: On completeness results for the expansions with truth-constants of some predicate fuzzy logics. In: Stepnicka, M., Novák, V., Bodenhofer, U. (eds.) New Dimensions in Fuzzy Logic and Related Technologies. Proceedings of the 5th EUSFLAT Conference, Ostrava, Czech Republic, September 11-14, vol. 2: Regular Sessions, pp. 21–26. Universitas Ostraviensis (2007)

    Google Scholar 

  4. Esteva, F., Godo, L., Noguera, C.: First-order t-norm based fuzzy logics with truth-constants: distinguished semantics and completeness properties. Ann. Pure Appl. Logic 161(2), 185–202 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  5. Esteva, F., Godo, L., Noguera, C.: Expanding the propositional logic of a t-norm with truth-constants: completeness results for rational semantics. Soft Comput. 14(3), 273–284 (2010)

    Article  MATH  Google Scholar 

  6. Esteva, F., Godo, L., Noguera, C.: On expansions of WNM t-norm based logics with truth-constants. Fuzzy Sets and Systems 161(3), 347–368 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  7. Guller, D.: An order hyperresolution calculus for Gödel logic - General first-order case. In: Rosa, A.C., Correia, A.D., Madani, K., Filipe, J., Kacprzyk, J. (eds.) IJCCI 2012, Proceedings of the 4th International Joint Conference on Computational Intelligence, Barcelona, Spain, October, 5–7, pp. 329–342. SciTePress (2012)

    Google Scholar 

  8. Hájek, P.: Metamathematics of Fuzzy Logic. Trends in Logic. Springer (2001). http://books.google.sk/books?id=Eo-e8Pi-HmwC

  9. Novák, V., Perfilieva, I., Močkoř, J.: Mathematical Principles of Fuzzy Logic. The Springer International Series in Engineering and Computer Science. Springer, US (1999). http://books.google.sk/books?id=pJeu6Ue65S4C

  10. Pavelka, J.: On fuzzy logic I, II, III. Semantical completeness of some many-valued propositional calculi. Mathematical Logic Quarterly 25(2529), 45–52, 119–134, 447–464 (1979)

    Google Scholar 

  11. Savický, P., Cignoli, R., Esteva, F., Godo, L., Noguera, C.: On Product logic with truth-constants. J. Log. Comput. 16(2), 205–225 (2006)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Dušan Guller .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Guller, D. (2015). Unsatisfiable Formulae of Gödel Logic with Truth Constants and , \(\prec \), \(\Delta \) Are Recursively Enumerable. In: Tan, Y., Shi, Y., Buarque, F., Gelbukh, A., Das, S., Engelbrecht, A. (eds) Advances in Swarm and Computational Intelligence. ICSI 2015. Lecture Notes in Computer Science(), vol 9142. Springer, Cham. https://doi.org/10.1007/978-3-319-20469-7_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-20469-7_27

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-20468-0

  • Online ISBN: 978-3-319-20469-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics