Skip to main content
SpringerLink
Log in

On the conditional degree of satisfiability of logical formulas

  • Published:
Mathematical notes of the Academy of Sciences of the USSR Aims and scope Submit manuscript

Abstract

The concept of the conditional degree of satisfiability of logical formulas on a set of n elements is introduced and certain aspects of the asymptotic behavior of this quantity as n → ∞ are investigated.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Literature cited

  1. Yu. V. Glebskii, D. I. Kogan, I. M. Kiogon'kii, and V. A. Talanov, “The extent and degree of satisfiability of a form of the restricted predicate calculus,” in: Cybernetics (Kibernetika), [in Russian], No. 2 (1969), pp. 31–42.

    Google Scholar 

  2. J. G. Kemeny, “A logical measure function,” J. Symbolic Logic,18, No. 4, 289–308 (1953).

    Google Scholar 

  3. M. A. Taitslin, “The effective nonseparability of the set of identically true and the set of finitely refutable formulas of the elementary theory of structures,” Algebra I Logika,1, No. 3, 24–38 (1962).

    Google Scholar 

  4. A. I. Mal'tsev, Algorithms and Recursive Functions [in Russian], Moscow (1965).

  5. A. Church, “An unsolvable problem of elementary number theory,” Amer. J. Math.,58, 345–363 (1936).

    Google Scholar 

  6. A. Robinson, Introduction to Model Theory and to the Metamathematics of Algebra [Russian translation], Moscow (1967).

Download references

Author information

Authors and Affiliations

  1. N. I. Lobachevskii Gor'kii State University, USSR

    M. I. Liogon'kii

Authors
  1. M. I. Liogon'kii
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Matematicheskie Zametki, Vol. 6, No. 6, pp. 651–662, December, 1969.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Liogon'kii, M.I. On the conditional degree of satisfiability of logical formulas. Mathematical Notes of the Academy of Sciences of the USSR 6, 856–861 (1969). https://doi.org/10.1007/BF01146404

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01146404

Keywords

Search

Navigation