A note on probabilistic logics and probabilistic networks

Abstract

1, . . . , n | ≈ ψ ? Here 1, . . . , n, ψ are premisses of some formal language, such as a propositional language or a predicate language. | ≈ is an entailment relation: the entailment holds if all models of the premisses also satisfy the conclusion, where the logic provides some suitable notion of ‘model’ and ‘satisfy’. Proof theory is normally invoked to answer a question of this form: one tries to prove the conclusion from the premisses in a finite sequence of steps, where at each step one invokes an axiom or applies a rule of inference

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,438

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.

Analytics

Added to PP
2009-01-28

Downloads
38 (#413,140)

6 months
2 (#1,221,975)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Jon Williamson
University of Kent

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references