A note on probabilistic logics and probabilistic networks

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
Keywords No keywords specified (fix it)
Categories (categorize this paper)
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 30,719
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles
Added to PP index

Total downloads
24 ( #217,741 of 2,197,279 )

Recent downloads (6 months)
1 ( #298,964 of 2,197,279 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature