Skip to main content

Some Remarks on Probabilities Over Formalized Languages

  • Chapter
Transactions of the Eighth Prague Conference

Part of the book series: Czechoslovak Academy of Sciences ((TPCI,volume 8A))

  • 102 Accesses

Abstract

Some applications of probability theory, its methods and results in the field of automated problem solving and artificial intelligence in general need the possibility to ascribe probability values to well-formed formulas of a formalized language. First, a possibility is studied how to convert, using the model theory, such a formula into a random event in its classical set-theoretic sense. Second an, immediate definition of probability measure as a real-valued function over a formalized language is suggested. The obtained notions and assertions enable to formalize and develop some mathematical tools important when introducing the stochastic methods into the domain of automated problem solving (e.g., the notion of the so called randomized incidental phenomena).

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

  • Feys R. (1965): Modal Logics, Dunond, Paris 1965

    MATH  Google Scholar 

  • Gaines B. R. (1973): Fuzzy Reasoning and the Logics of Uncertainty. Research Report, Man-Machine Systems Laboratory, Dept. of Electrical Eng., Univ. of Essex, Colchester, Essex 1973.

    Google Scholar 

  • Haimos P.R. (1950): Measure Theory.D. van Nostrand Com., New York-Toronto-London 1950.

    Google Scholar 

  • Kolmogorov A.N. (1933): Grundgriffe der Wahrscheinlichkeitsrechnung. Springer Verlag, Berlin 1933.

    Google Scholar 

  • Kripke S.A. (1963): Semantical Analysis of Modal Logic I. Normal Modal Propositional Calculi. Zeitschrift für Math.Logik und Grundlagen der Math. 9 (1963), 67–96.

    Article  MATH  MathSciNet  Google Scholar 

  • Kripke S.A. (1965): Semantical Analysis of Modal Logic II. Non-Normal Modal Propositional Calculi. The Theory of Models. In: Proc. of The 1963 Internat.Symp at Berkeley. North Holland Publ.Comp., Amsterdam 1965, 206–220.

    Google Scholar 

  • Mostowski A. (1948): Logika matematiczna. PWN, Warszawa 1948.

    Google Scholar 

  • Å tépánková O., Havel I.M. (1976): A Logical Theory of Robot Problem Solving. Artificial Intelligence 7 (1976), 129–161.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1978 ACADEMIA, Publishing House of the Czechoslovak Academy of Sciences, Prague

About this chapter

Cite this chapter

Kramosil, I. (1978). Some Remarks on Probabilities Over Formalized Languages. In: Transactions of the Eighth Prague Conference. Czechoslovak Academy of Sciences, vol 8A. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-9857-5_36

Download citation

  • DOI: https://doi.org/10.1007/978-94-009-9857-5_36

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-009-9859-9

  • Online ISBN: 978-94-009-9857-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics