Probabilistic reasoning in a classical logic
نویسندگان
چکیده
منابع مشابه
Probabilistic reasoning in a classical logic
We offer a view on how probability is related to logic. Specifically, we argue against the widely held belief that standard classical logics have no direct way of modelling the certainty of assumptions in theories and no direct way of stating the certainty of theorems proved from these (uncertain) assumptions. The argument rests on the observation that probability densities, being functions, ca...
متن کاملDefault Reasoning Using Classical Logic
In this paper we show how propositional default theories can be characterized by classical propositional theories: for each nite default theory, we show a classical propositional theory such that there is a one-to-one correspondence between models for the latter and extensions of the former. This means that computing extensions and answering queries about coherence, set-membership and set-entai...
متن کاملA Logic For Inductive Probabilistic Reasoning
Inductive probabilistic reasoning is understood as the application of inference patterns that use statistical background information to assign (subjective) probabilities to single events. The simplest such inference pattern is direct inference: from “70% of As are Bs” and “a is an A” infer that a is a B with probability 0.7. Direct inference is generalized by Jeffrey’s rule and the principle of...
متن کاملProbabilistic Logic under Coherence, Model-theoretic Probabilistic Logic, and Default Reasoning in System Probabilistic Logic under Coherence, Model-theoretic Probabilistic Logic, and Default Reasoning in System
We study probabilistic logic under the viewpoint of the coherence principle of de Finetti. In detail, we explore how probabilistic reasoning under coherence is related to model-theoretic probabilistic reasoning and to default reasoning in System . In particular, we show that the notions of g-coherence and of g-coherent entailment can be expressed by combining notions in model-theoretic probabil...
متن کاملA Classical Propositional Logic for Reasoning About Reversible Logic Circuits
We propose a syntactic representation of reversible logic circuits in their entirety, based on Feynman’s control interpretation of Toffoli’s reversible gate set. A pair of interacting proof calculi for reasoning about these circuits is presented, based on classical propositional logic and monoidal structure, and a natural order-theoretic structure is developed, demonstrated equivalent to Boolea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Logic
سال: 2009
ISSN: 1570-8683
DOI: 10.1016/j.jal.2007.11.008