Skip to main content
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)Volume 10703 LNCS, 2018, Pages 170-189International Symposium on Logical Foundations of Computer Science, LFCS 2018; [state] FL; United States; 8 January 2018 through 11 January 2018; Code 209049

Probabilistic reasoning about simply typed lambda terms(Conference Paper)

  Save all to author list
  • aFaculty of Technical Sciences, University of Novi Sad, Novi Sad, Serbia
  • bMathematical Institute SANU, Belgrade, Serbia
  • cInstitute of Computer Science, University of Bern, Bern, Switzerland

Abstract

Reasoning with uncertainty has gained an important role in computer science, artificial intelligence and cognitive science. These applications urge for development of formal models which capture reasoning of probabilistic features. We propose a formal model for reasoning about probabilities of simply typed lambda terms. We present its syntax, Kripke-style semantics and axiomatic system. The main results are the corresponding soundness and strong completeness, which rely on two key facts: the completeness of simple type assignment and the existence of a maximal consistent extension of a consistent set. © Springer International Publishing AG 2018.

Author keywords

Probabilistic logicSimply typed lambda calculusSoundnessStrong completeness

Indexed keywords

Engineering controlled terms:CalculationsDifferentiation (calculus)Formal methodsSemantics
Engineering uncontrolled termsCognitive scienceKripke-style semanticsMaximal consistent extensionsProbabilistic reasoningReasoning with uncertaintySimply typed lambda calculusSoundnessStrong completeness
Engineering main heading:Probabilistic logics

Funding details

Funding sponsor Funding number Acronym
Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung
See opportunities by SNF		165549SNF
Ministarstvo Prosvete, Nauke i Tehnološkog RazvojaIII 044006,ON174008,ON174026MPNTR

  • 1

    Acknowledgements. This work was supported by the SNSF project 200021 165549 Justifications and non-classical reasoning, and by the Serbian Ministry of Education, Science and Technological Development through projects ON174026, III 044006 and ON174008.

  • ISSN: 03029743
  • ISBN: 978-331972055-5
  • Source Type: Book Series
  • Original language: English
  • DOI: 10.1007/978-3-319-72056-2_11
  • Document Type: Conference Paper
  • Volume Editors: Nerode A.,Artemov S.
  • Sponsors:
  • Publisher: Springer Verlag

  Savić, N.; Institute of Computer Science, University of Bern, Bern, Switzerland;
© Copyright 2018 Elsevier B.V., All rights reserved.

Cited by 5 documents

Kubyshkina, E. , Primiero, G.
A possible worlds semantics for trustworthy non-deterministic computations
(2024) International Journal of Approximate Reasoning
Primiero, G. , D’Asaro, F.
Proof-checking bias in labeling methods
(2022) CEUR Workshop Proceedings
D'Asaro, F.A. , Primiero, G.
Probabilistic typed natural deduction for trustworthy computations
(2021) CEUR Workshop Proceedings
View details of all 5 citations
Inform me when this document is cited in Scopus:
Set citation alert Set citation feed
{"topic":{"name":"Formal Logic; Axiomatization; Probability Theory","id":53371,"uri":"Topic/53371","prominencePercentile":29.202787,"prominencePercentileString":"29.203","overallScholarlyOutput":0},"dig":"12d78816d2827fe9577398698eb9e07687a4e9eed5cd4f3a5b3153a7e9a10727"}

SciVal Topic Prominence

Topic:
Prominence percentile: