Logics with Probability Operators
|
|
- Buddy Harvey
- 5 years ago
- Views:
Transcription
1 Logics with Probability Operators Zoran Ognjanovi and Dragan Doder Mathematical Institute SANU and IRIT, Universite Paul Sabatier August 6, 2018 Ognjanovi, Doder (SANU, IRIT) Logics with probability operators 6/8/ / 40
2 About the course Goal of the course Probability is one of the most popular tools for reasoning about uncertainty in a quantitative way Modal logic is a powerful tool for reasoning about computation and (qualitative) uncertainty Ognjanovi, Doder (SANU, IRIT) Logics with probability operators 6/8/ / 40
3 About the course Goal of the course Probability is one of the most popular tools for reasoning about uncertainty in a quantitative way Modal logic is a powerful tool for reasoning about computation and (qualitative) uncertainty Combining probability and modal approach: Philosophy Articial Intelligence Computer Science Economics Ognjanovi, Doder (SANU, IRIT) Logics with probability operators 6/8/ / 40
4 About the course Goal of the course Probability is one of the most popular tools for reasoning about uncertainty in a quantitative way Modal logic is a powerful tool for reasoning about computation and (qualitative) uncertainty Combining probability and modal approach: Philosophy Articial Intelligence Computer Science Economics The goal of this course is to show how to combine those two approaches into a powerful formalism for reasoning about uncertainty. Syntax, semantics, axiomatic systems, completeness theorem, decidability... Ognjanovi, Doder (SANU, IRIT) Logics with probability operators 6/8/ / 40
5 About the course Outline of the course (tentative) Lecture 1: Historical roots and basic concepts: The ideas of Leibniz and Boole, work of Keisler and Nilsson. The key concepts of probability logics (syntax, semantics and satisability relation). Lecture 2: Basic probability logics: Propositional, without iterations of probability operators. Logic with linear weight formulas (FHM), the fuzzy approach (HGE), ω-rules. The axiomatization techniques, decidability. Lecture 3: Probabilistic modal logic: Reasoning about higher-order probabilities. First order case. Lecture 4: Extensions of probability logics: new types of operators (conditional probability, imprecise probabilities, qualitative probability, independence); alternative ranges of probability functions. Lecture 5: Probability and other modalities: Temporal probability logics, probabilistic common knowledge. Dealing with transitive closure operators. Ognjanovi, Doder (SANU, IRIT) Logics with probability operators 6/8/ / 40
6 About the course What is not the topic of the course Probability valued logics Fuzzy logics non-monotonic reasoning Ognjanovi, Doder (SANU, IRIT) Logics with probability operators 6/8/ / 40
7 About the course Based on the book Ognjanovic et.al. Probability Logics Probability-Based Formalization of Uncertain Reasoning Springer Ognjanovi, Doder (SANU, IRIT) Logics with probability operators 6/8/ / 40
8 Roots of Probability logic Mathematical logic and Probability For a long time, logic and probability are developed in parallel: Gotfried W. Leibnitz ( ), Jacobus Bernoulli ( ), Johann Bernoulli ( ), Thomas Bayes ( ), Johann Heinrich Lambert ( ), Bernard Bolzano ( ), Pierre Simon de Laplace ( ) Augustus De Morgan ( ), John Venn ( ), Hugh MacColl ( ), Charles S. Pierce ( ) George Boole, An Investigation into the Laws of Thought, on which are founded the Mathematical Theories of Logic and Probabilities, Ognjanovi, Doder (SANU, IRIT) Logics with probability operators 6/8/ / 40
9 Roots of Probability logic Mathematical logic and Probability For a long time, logic and probability are developed in parallel: Gotfried W. Leibnitz ( ), Jacobus Bernoulli ( ), Johann Bernoulli ( ), Thomas Bayes ( ), Johann Heinrich Lambert ( ), Bernard Bolzano ( ), Pierre Simon de Laplace ( ) Augustus De Morgan ( ), John Venn ( ), Hugh MacColl ( ), Charles S. Pierce ( ) George Boole, An Investigation into the Laws of Thought, on which are founded the Mathematical Theories of Logic and Probabilities, The end of XIX and in XX century big progress in the development in both of the elds (Gottlob Frege, Bertrand Russell, Kurt Goedel classical rst-order logic, Andrey Kolmogorov probability theory). The independent developments of the elds begin Ognjanovi, Doder (SANU, IRIT) Logics with probability operators 6/8/ / 40
10 Roots of Probability logic Mathematical logic and Probability For a long time, logic and probability are developed in parallel: Gotfried W. Leibnitz ( ), Jacobus Bernoulli ( ), Johann Bernoulli ( ), Thomas Bayes ( ), Johann Heinrich Lambert ( ), Bernard Bolzano ( ), Pierre Simon de Laplace ( ) Augustus De Morgan ( ), John Venn ( ), Hugh MacColl ( ), Charles S. Pierce ( ) George Boole, An Investigation into the Laws of Thought, on which are founded the Mathematical Theories of Logic and Probabilities, The end of XIX and in XX century big progress in the development in both of the elds (Gottlob Frege, Bertrand Russell, Kurt Goedel classical rst-order logic, Andrey Kolmogorov probability theory). The independent developments of the elds begin In the 70's and 80's a form or reunion through probability quantiers and operators Ognjanovi, Doder (SANU, IRIT) Logics with probability operators 6/8/ / 40
11 Roots of Probability logic Leibnitz Figure: The blogger of his age: Gottfried Leibniz ( ) Ognjanovi, Doder (SANU, IRIT) Logics with probability operators 6/8/ / 40
12 Roots of Probability logic Leibnitz Leibnitz (1) Dissertation (1665): he used numbers from [0, 1] to represent legal conditional rights 0 and 1 denote non-existence of rights and absolute rights, respectively; fractions stand for dierent degrees of certainty Leibnitz gave a denition of probability, relaying on equally possible cases, as the ratio of favorable cases to the total number of cases. Moral certainty something which is innitely probable. Probability, or better said probability logic, had the central role in his attempts to create a powerful universal calculus. Ognjanovi, Doder (SANU, IRIT) Logics with probability operators 6/8/ / 40
13 Roots of Probability logic Leibnitz Leibnitz (2) Leibnitz is particularly focused on analogies between the processes of thinking and computation. Thomas Hobbes, everywhere a profound examiner of principles, rightly stated that everything done by our mind is a computation Ognjanovi, Doder (SANU, IRIT) Logics with probability operators 6/8/ / 40
14 Roots of Probability logic Leibnitz Leibnitz (2) Leibnitz is particularly focused on analogies between the processes of thinking and computation. Thomas Hobbes, everywhere a profound examiner of principles, rightly stated that everything done by our mind is a computation Starting from his thesis, Leibnitz publicized ideas to develop a doctrine - or a new kind of logic - of de gradibus probabilitatis (degrees of probability) He used the new ideas in a debate about inheritance of throne of Poland in Ognjanovi, Doder (SANU, IRIT) Logics with probability operators 6/8/ / 40
15 Roots of Probability logic Leibnitz Leibnitz (2) New Essays on Human Understanding, nished in 1704 (translations): (66) As for the inevitability of the result, and degrees of probability, we don't yet possess the branch of logic that would let them be estimated. (372) Perhaps opinion based on likelihood also deserves the name of knowledge; otherwise nearly all historical knowledge will collapse, and a good deal more... probability or likelihood is broader: it must be drawn from the nature of things; and the opinion of weighty authorities is one of the things which can contribute to the likelihood of an opinion, but it does not produce the entire likelihood by itself. (464) The entire form of judicial procedures is, in fact, nothing but a kind of logic, applied to legal questions. Ognjanovi, Doder (SANU, IRIT) Logics with probability operators 6/8/ / 40
16 Roots of Probability logic Leibnitz Leibnitz (3) (466) I have said more than once that we need a new kind of logic, concerned with degrees of probability, since Aristotle in his Topics couldn't have been further from it. He is satised with arranging a few familiar rules according to common patterns; these could serve on the occasion when one is concerned with amplifying a discourse so as to give it some likelihood. No eort is made to provide a balance necessary to weight the likelihoods in order to obtain a rm judgment. Anyone wanting to deal with this question would do well to pursue the investigation of games of chance. In general, I wish that some skillful mathematician were interested in producing a detailed study of all kinds of games, carefully reasoned and with full particulars. This would be of great value in improving discovery-techniques, since the human mind appears to better advantage in games than in the most serious pursuits. Ognjanovi, Doder (SANU, IRIT) Logics with probability operators 6/8/ / 40
17 Roots of Probability logic Leibnitz Leibnitz (4) Once realized, all these ideas would lead to a formal system - universal language and a powerful logical calculus - which could be the basis for all sciences and replace arguments by formal computation: If this is done, whenever controversies arise, there will be no more need for arguing among two philosophers than among two mathematicians. For it will suce to take pens into the hand and to sit down by the abacus, saying to each other (and if they wish also to a friend called for help): Let us calculate! Ognjanovi, Doder (SANU, IRIT) Logics with probability operators 6/8/ / 40
18 Roots of Probability logic Bolzano Bernhard Placidus Johann Nepomuk Bolzano ( ) Bernard Bolzano, Die Wissenschaftslehre oder Versuch einer Neuen Darstellung der Logik, Ognjanovi, Doder (SANU, IRIT) Logics with probability operators 6/8/ / 40
19 Roots of Probability logic Bolzano Wissenschaftslehre: describes probability as a part of logic Bolzano relates deductive inference and conditional probability. Deductive consequence and incompatibility are two extremes of conditional probability. The notion of validity: degree of validity of A(x) (its absolute probability) the usual ratio of favorable cases to the total number of cases x U : A(x) U Relative validity of a proposition M with respect to a set of propositions A, B, C,... was actually the conditional probability P(M A B C...) Ognjanovi, Doder (SANU, IRIT) Logics with probability operators 6/8/ / 40
20 Roots of Probability logic De Morgan Augustus De Morgan ( ) A. De Morgan, Formal logic, or, The calculus of inference, necessary and probable, Ognjanovi, Doder (SANU, IRIT) Logics with probability operators 6/8/ / 40
21 Roots of Probability logic De Morgan De Morgan considered probabilistic inference as a part of logic The old doctrine of modals is made to give place to the numerical theory of probability. Many will object to this theory as extralogical... I cannot understand why the study of the eect which partial belief of the premises produces with respect to the conclusion, should be separated from that of the consequences of supposing the former to be absolutely true Subjective, epistemic approach to probability. By degree of probability we really mean, or ought to mean, degree of belief... I will take it then that all the grades of knowledge, from knowledge of impossibility to knowledge of necessity, are capable of being quantitatively conceived He discussed uncertain reasoning with necessary valid inferences (arguments) and probable premises (testimonies) Ognjanovi, Doder (SANU, IRIT) Logics with probability operators 6/8/ / 40
22 Roots of Probability logic Boole George Boole ( ) G. Boole, An Investigation of the Laws of Thought on Which are Founded the Mathematical Theories of Logic and Probabilities, Ognjanovi, Doder (SANU, IRIT) Logics with probability operators 6/8/ / 40
23 Roots of Probability logic Boole An investigation of the laws of thought almost half of the text was devoted to the relationship between logic and probability. The design of the following treatise is to investigate the fundamental laws of those operations of the mind by which reasoning is performed; to give expression to them in the symbolical language of a Calculus, and upon this foundation to establish the science of Logic and construct its method; to make that method itself the basis of a general method for the application of the mathematical doctrine of Probabilities; and, nally, to collect from the various elements of truth brought to view in the course of these inquiries some probable intimations concerning the nature and constitution of the human mind... The general doctrine and method of Logic above explained form also the basis of a theory and corresponding method of Probabilities... Hence the subject of Probabilities belongs equally to the science of Number and to that of Logic. Ognjanovi, Doder (SANU, IRIT) Logics with probability operators 6/8/ / 40
24 Roots of Probability logic Boole Boole's understanding of probability was that it is founded upon partial knowledge about the relative frequency of occurrences of events. Instead of considering the numerical probability of the occurrence of an event, Boole often expressed it as the probability of the truth of the proposition declaring that the event will occur. The goal of probability theory can be dened as: for a given probability of an event, nd the probability of another, related event. Hailperin: Boole developed probabilistic inference, from probabilistic assumptions derive probability of the conclusion. Ognjanovi, Doder (SANU, IRIT) Logics with probability operators 6/8/ / 40
25 Roots of Probability logic Boole Principles Boole's principles (mostly taken from Laplace) the basis for the above mentioned doctrine. They corresponded to additivity of probabilities, probabilities of (in)dependent events, Bayes' theorem for a priori equally probable causes, etc. Conditional probability: 4th. The probability that if an event, E, take place, an event, F, will also take place, is equal to the probability of the concurrence of the events E and F, divided by the probability of the occurrence of E. By combining these principles one can calculate the probability of a compound event which depends on a set of independent events with known probabilities. Ognjanovi, Doder (SANU, IRIT) Logics with probability operators 6/8/ / 40
26 Roots of Probability logic Probability logic in the 20th century 20th century Ognjanovi, Doder (SANU, IRIT) Logics with probability operators 6/8/ / 40
27 Roots of Probability logic Probability logic in the 20th century 20th century Gaifman, Scott, and Krauss: probabilities on rst-order sentences Keisler: probability quantiers Probabilities in the framework of modal logics Ognjanovi, Doder (SANU, IRIT) Logics with probability operators 6/8/ / 40
28 Roots of Probability logic Probability logic in the 20th century Jerome Keisler Px 1 2 a probabilistic quantier M, µ = (Px r)φ(x) i µ({a : M = φ(a)}) r Ognjanovi, Doder (SANU, IRIT) Logics with probability operators 6/8/ / 40
29 Roots of Probability logic Probability logic in the 20th century Jerome Keisler Px 1 2 a probabilistic quantier M, µ = (Px r)φ(x) i µ({a : M = φ(a)}) r nitary, innitary languages, axiomatizations, completeness Ognjanovi, Doder (SANU, IRIT) Logics with probability operators 6/8/ / 40
30 Roots of Probability logic Probability logic in the 20th century Jerome Keisler Px 1 2 a probabilistic quantier M, µ = (Px r)φ(x) i µ({a : M = φ(a)}) r nitary, innitary languages, axiomatizations, completeness H. J. Keisler. Hypernite model theory. In: R. O. Gandy, J. M. E. Hyland (editors), Logic Colloquim 76, North-Holland H. J. Keisler. Probability quantiers. In: J. Barwise and S. Feferman (editors), Model Theoretic Logics, Springer-Verlag, Berlin Douglas N. Hoover. Probability logic. Annals of mathematical logic, 14, Ognjanovi, Doder (SANU, IRIT) Logics with probability operators 6/8/ / 40
31 Roots of Probability logic Probability logic in the 20th century N. Nilsson, Probabilistic logic, Articial intelligence, Nilsson asked for a generalization of classical logic to deal with uncertain knowledge. Knowledge base: if A 1 then B 1 if A 2 then B 2 if A 3 then B 3... Ognjanovi, Doder (SANU, IRIT) Logics with probability operators 6/8/ / 40
32 Roots of Probability logic Probability logic in the 20th century N. Nilsson, Probabilistic logic, Articial intelligence, Nilsson asked for a generalization of classical logic to deal with uncertain knowledge. Knowledge base: if A 1 then B 1 (cf c 1 ) if A 2 then B 2 (cf c 2 ) if A 3 then B 3 (cf c 3 )... Uncertain knowledge: from statistics, our experiences and beliefs, etc. Ognjanovi, Doder (SANU, IRIT) Logics with probability operators 6/8/ / 40
33 Roots of Probability logic Probability logic in the 20th century N. Nilsson, Probabilistic logic, Articial intelligence, Nilsson asked for a generalization of classical logic to deal with uncertain knowledge. Knowledge base: if A 1 then B 1 (cf c 1 ) if A 2 then B 2 (cf c 2 ) if A 3 then B 3 (cf c 3 )... Uncertain knowledge: from statistics, our experiences and beliefs, etc. To check consistency of (nite) sets of sentences. To deduce probabilities of conclusions from uncertain premises. Ognjanovi, Doder (SANU, IRIT) Logics with probability operators 6/8/ / 40
34 Roots of Probability logic Probability logic in the 20th century Probability operators The probability logics allow strict reasoning about probabilities using well-dened syntax and semantics. Example: the probability that Tweety ies is at least 0.75 P 0.75 flies Tweety Formulas in these logics remain either true or false. Formulas do not have probabilistic (numerical) truth values. Ognjanovi, Doder (SANU, IRIT) Logics with probability operators 6/8/ / 40
35 Roots of Probability logic Probability logic in the 20th century Probability quantiers vs. probability operators the probability that birds y is 0.75 the probability that A ies is 0.75 (Px = 0.75)Fly(x) P =0.75 flies A M = (Px = 0.75)Fly(x) i µ({d : M = F (d)}) = 0.75 M = P =0.75 flies A i µ({w : w = flies A }) = 0.75 Ognjanovi, Doder (SANU, IRIT) Logics with probability operators 6/8/ / 40
36 Roots of Probability logic Probability logic in the 20th century Early papers H. Gaifman. A Theory of Higher Order Probabilities. In: Proceedings of the Theoretical Aspects of Reasoning about Knowledge (edts. J.Y. Halpern), Morgan-Kaufmann, San Mateo, California, M. Fattorosi-Barnaba and G. Amati. Modal operators with probabilistic interpretations I. Studia Logica 46(4), R. Fagin, J. Halpern and N. Megiddo. A logic for reasoning about probabilities. Information and Computation 87(1-2): M. Ra²kovi. Classical logic with some probability operators. Publications de l'institut Mathématique, n.s. 53(67), R. Fagin and J. Halpern. Reasoning about knowledge and probability. Journal of the ACM, 41(2):340367, A. Frish and P. Haddawy. Anytime deduction for probabilistic logic. Articial Intelligence 69, Ognjanovi, Doder (SANU, IRIT) Logics with probability operators 6/8/ / 40
37 Logics with probability operators Logics with probability operators Ognjanovi, Doder (SANU, IRIT) Logics with probability operators 6/8/ / 40
38 Logics with probability operators Logic Logical language, formulas axiom system (axioms, rules) semantics (models, satisability) proofs consequence relation Ognjanovi, Doder (SANU, IRIT) Logics with probability operators 6/8/ / 40
39 Logics with probability operators Syntax and Semantics Language of propositional logic Unary operators: P s, s Q [0, 1] α - a classical propositional formula Ognjanovi, Doder (SANU, IRIT) Logics with probability operators 6/8/ / 40
40 Logics with probability operators Syntax and Semantics Language of propositional logic Unary operators: P s, s Q [0, 1] α - a classical propositional formula Basic probabilistic formula: P s α Probabilistic formula = a Boolean combination of basic probabilistic formulas P <s α means P s α,... Example: P <r α P s β P <t (α β), p P s P =t (p q), Ognjanovi, Doder (SANU, IRIT) Logics with probability operators 6/8/ / 40
41 Logics with probability operators Syntax and Semantics Language of propositional logic Unary operators: P s, s Q [0, 1] α - a classical propositional formula Basic probabilistic formula: P s α Probabilistic formula = a Boolean combination of basic probabilistic formulas P <s α means P s α,... Example: P <r α P s β P <t (α β), p P s P =t (p q), Extensions: Richer language: linear / polynomial combinations of probabilities FO logic iterations of operators changing the background logic changing the co-domain of probabilities Ognjanovi, Doder (SANU, IRIT) Logics with probability operators 6/8/ / 40
42 Logics with probability operators Syntax and Semantics Semantics (1) Modal logic: α necessarily α α possibly α P s α somewhere between Ognjanovi, Doder (SANU, IRIT) Logics with probability operators 6/8/ / 40
43 Logics with probability operators Syntax and Semantics Semantics (1) Modal logic: α necessarily α α possibly α P s α somewhere between Possible world semantics M = W, R, v : W a set worlds, R W W accessibility relation v a valuation Ognjanovi, Doder (SANU, IRIT) Logics with probability operators 6/8/ / 40
44 Logics with probability operators Syntax and Semantics Semantics (1) Modal logic: α necessarily α α possibly α P s α somewhere between Possible world semantics M = W, R, v : W a set worlds, R W W accessibility relation v a valuation Satisability: w = α i u = α for every u s.t. wru w = α i u = α for some u s.t. wru w = P s α if µ({u wru}) s Ognjanovi, Doder (SANU, IRIT) Logics with probability operators 6/8/ / 40
45 Logics with probability operators Syntax and Semantics Semantics (2) A probability space M = S, H, µ : S is a nonempty set H P(S) is a σ-algebra: H and closed under complements and countable unions. (closeness under nite unions an algebra) Ognjanovi, Doder (SANU, IRIT) Logics with probability operators 6/8/ / 40
46 Logics with probability operators Syntax and Semantics Semantics (2) A probability space M = S, H, µ : S is a nonempty set H P(S) is a σ-algebra: H and closed under complements and countable unions. (closeness under nite unions an algebra) µ : H [0, 1] is a probability measure: µ(s) = 1 µ( + n=1 An) = + n=1 µ(an), whenever {An}+ n=1 is a collection of pairwise disjoint sets. (countable additivity) Ognjanovi, Doder (SANU, IRIT) Logics with probability operators 6/8/ / 40
47 Logics with probability operators Syntax and Semantics Semantics (2) A probability space M = S, H, µ : S is a nonempty set H P(S) is a σ-algebra: H and closed under complements and countable unions. (closeness under nite unions an algebra) µ : H [0, 1] is a probability measure: µ(s) = 1 µ( + n=1 An) = + n=1 µ(an), whenever {An}+ n=1 is a collection of pairwise disjoint sets. (countable additivity) µ(a B) = µ(a) + µ(b), whenever A and B are disjoint sets. additivity) (nite Ognjanovi, Doder (SANU, IRIT) Logics with probability operators 6/8/ / 40
48 Logics with probability operators Syntax and Semantics Semantics (2) A probability space M = S, H, µ : S is a nonempty set H P(S) is a σ-algebra: H and closed under complements and countable unions. (closeness under nite unions an algebra) µ : H [0, 1] is a probability measure: µ(s) = 1 µ( + n=1 An) = + n=1 µ(an), whenever {An}+ n=1 is a collection of pairwise disjoint sets. (countable additivity) µ(a B) = µ(a) + µ(b), whenever A and B are disjoint sets. additivity) (nite Finitary language focus on nite additivity! P( + n=1 α n) = + n=1 P(α n) Ognjanovi, Doder (SANU, IRIT) Logics with probability operators 6/8/ / 40
49 Logics with probability operators Syntax and Semantics Semantics (3) A probability model M = W, H, µ, v : W is a nonempty set of elements called worlds, H is an algebra of subsets of W, µ : H [0, 1] is a nitely additive probability measure, and v : W Var {, } is a valuation Ognjanovi, Doder (SANU, IRIT) Logics with probability operators 6/8/ / 40
50 Logics with probability operators Syntax and Semantics Semantics (3) A probability model M = W, H, µ, v : W is a nonempty set of elements called worlds, H is an algebra of subsets of W, µ : H [0, 1] is a nitely additive probability measure, and v : W Var {, } is a valuation Measurable models α For C [α] = {w W : w = α} [α] H Ognjanovi, Doder (SANU, IRIT) Logics with probability operators 6/8/ / 40
51 Logics with probability operators Syntax and Semantics Satisability M = P s α if µ([α] M ) s, M = α if M = α, M = α β if M = α and M = β. A set of formulas F = {α 1, α 2,...} is satisable if there is a model M: M = α i for i = 1, 2,... Ognjanovi, Doder (SANU, IRIT) Logics with probability operators 6/8/ / 40
52 Logics with probability operators Syntax and Semantics Satisability M = P s α if µ([α] M ) s, M = α if M = α, M = α β if M = α and M = β. A set of formulas F = {α 1, α 2,...} is satisable if there is a model M: M = α i for i = 1, 2,... Remark: Iterations of probability operators every world is equipped with a probability measure! Ognjanovi, Doder (SANU, IRIT) Logics with probability operators 6/8/ / 40
53 Logics with probability operators Axiomatization Logic Logical language, formulas axiom system (axioms, rules) semantics (models, satisability) proofs consequence relation Ognjanovi, Doder (SANU, IRIT) Logics with probability operators 6/8/ / 40
54 Logics with probability operators Axiomatization Logic Logical language, formulas axiom system (axioms, rules) semantics (models, satisability) proofs consequence relation T α vs T = α Ognjanovi, Doder (SANU, IRIT) Logics with probability operators 6/8/ / 40
55 Logics with probability operators Axiomatization Logical issues (1) Providing a sound and complete axiom system simple completeness (every consistent formula is satisable, = A i A) extended completeness (every consistent set of formulas is satisable) Decidability (there is a procedure which decides if an arbitrary formula formula is valid) Ognjanovi, Doder (SANU, IRIT) Logics with probability operators 6/8/ / 40
56 Logics with probability operators Axiomatization Logical issues (1) Providing a sound and complete axiom system simple completeness (every consistent formula is satisable, = A i A) extended completeness (every consistent set of formulas is satisable) Decidability (there is a procedure which decides if an arbitrary formula formula is valid) Compactness (a set of formulas is satisable i every nite subset is satisable) Ognjanovi, Doder (SANU, IRIT) Logics with probability operators 6/8/ / 40
57 Logics with probability operators Axiomatization Logical issues (2) Inherent non-compactness: F = { P =0 p} {P <1/n p : n is a positive integer} Ognjanovi, Doder (SANU, IRIT) Logics with probability operators 6/8/ / 40
58 Logics with probability operators Axiomatization Logical issues (2) Inherent non-compactness: F = { P =0 p} {P <1/n p : n is a positive integer} F k = { P =0 p, P <1/1 p, P <1/2 p,..., P <1/k p} c: 0 < c < 1 k, µ[p] = c M satises F k, but does not satisfy F Ognjanovi, Doder (SANU, IRIT) Logics with probability operators 6/8/ / 40
59 Logics with probability operators Axiomatization Logical issues (2) Inherent non-compactness: F = { P =0 p} {P <1/n p : n is a positive integer} F k = { P =0 p, P <1/1 p, P <1/2 p,..., P <1/k p} c: 0 < c < 1 k, µ[p] = c M satises F k, but does not satisfy F nitary axiomatization + extended completeness compactness nitary axiomatization for real valued probability logics: there are consistent sets that are not satisable Ognjanovi, Doder (SANU, IRIT) Logics with probability operators 6/8/ / 40
60 Logics with probability operators Axiomatization Choices (1) Finitary axiomatization [simple completeness] Restrictions on ranges of probabilities: {0, 1 n, 2 n,..., n 1 n, 1} Innitary axiomatization Ognjanovi, Doder (SANU, IRIT) Logics with probability operators 6/8/ / 40
61 Logics with probability operators Axiomatization Choices (2) Describing nite additivity: With a formula Ognjanovi, Doder (SANU, IRIT) Logics with probability operators 6/8/ / 40
62 Logics with probability operators Axiomatization Choices (2) Describing nite additivity: With a formula An extension of the language (linear weight formula) If (α β) is a propositional tautology, then w(α β) = w(α) + w(β) Fagin, Halpern, Megiddo. A logic for reasoning about probabilities. Information and Computation Ognjanovi, Doder (SANU, IRIT) Logics with probability operators 6/8/ / 40
63 Logics with probability operators Axiomatization Choices (2) Describing nite additivity: With a formula An extension of the language (linear weight formula) If (α β) is a propositional tautology, then w(α β) = w(α) + w(β) Fagin, Halpern, Megiddo. A logic for reasoning about probabilities. Information and Computation With a set of formulas If (α β) is a propositional tautology, then (P =r α P =s β) P =r+s (α β) Ognjanovi, Doder (SANU, IRIT) Logics with probability operators 6/8/ / 40
64 Logics with probability operators Extensions Extensions Ognjanovi, Doder (SANU, IRIT) Logics with probability operators 6/8/ / 40
65 Logics with probability operators Extensions Extensions Iterations of probability operators P s P t α, β P s α Ognjanovi, Doder (SANU, IRIT) Logics with probability operators 6/8/ / 40
66 Logics with probability operators Extensions Extensions Iterations of probability operators P s P t α, β P s α First order case ( x)p 1/2 α(x) Ognjanovi, Doder (SANU, IRIT) Logics with probability operators 6/8/ / 40
67 Logics with probability operators Extensions Extensions Iterations of probability operators P s P t α, β P s α First order case ( x)p 1/2 α(x) New probability operators α β CP s (β, α) α β L s α, U s α Ognjanovi, Doder (SANU, IRIT) Logics with probability operators 6/8/ / 40
68 Logics with probability operators Extensions Extensions Iterations of probability operators P s P t α, β P s α First order case ( x)p 1/2 α(x) New probability operators α β CP s (β, α) α β L s α, U s α Combining probability and other modalities Ognjanovi, Doder (SANU, IRIT) Logics with probability operators 6/8/ / 40
69 Logics with probability operators Extensions Extensions Iterations of probability operators P s P t α, β P s α First order case ( x)p 1/2 α(x) New probability operators α β CP s (β, α) α β L s α, U s α Combining probability and other modalities Fuzzy probability operator Ognjanovi, Doder (SANU, IRIT) Logics with probability operators 6/8/ / 40
AN EXTENSION OF THE PROBABILITY LOGIC LP P 2. Tatjana Stojanović 1, Ana Kaplarević-Mališić 1 and Zoran Ognjanović 2
45 Kragujevac J. Math. 33 (2010) 45 62. AN EXTENSION OF THE PROBABILITY LOGIC LP P 2 Tatjana Stojanović 1, Ana Kaplarević-Mališić 1 and Zoran Ognjanović 2 1 University of Kragujevac, Faculty of Science,
More informationCOMPLETENESS THEOREM FOR A LOGIC WITH IMPRECISE AND CONDITIONAL PROBABILITIES. Zoran Ognjanović, Zoran Marković
PUBLICATIONS DE L INSTITUT MATHÉMATIQUE Nouvelle série, tome 78(92) (2005), 35 49 COMPLETENESS THEOREM FOR A LOGIC WITH IMPRECISE AND CONDITIONAL PROBABILITIES Zoran Ognjanović, Zoran Marković and Miodrag
More information1) Totality of agents is (partially) ordered, with the intended meaning that t 1 v t 2 intuitively means that \Perception of the agent A t2 is sharper
On reaching consensus by groups of intelligent agents Helena Rasiowa and Wiktor Marek y Abstract We study the problem of reaching the consensus by a group of fully communicating, intelligent agents. Firstly,
More informationModal Probability Logic
Modal Probability Logic ESSLLI 2014 - Logic and Probability Wes Holliday and Thomas Icard Berkeley and Stanford August 14, 2014 Wes Holliday and Thomas Icard: Modal Probability 1 References M. Fattorosi-Barnaba
More informationTHE LOGIC OF COMPOUND STATEMENTS
THE LOGIC OF COMPOUND STATEMENTS All dogs have four legs. All tables have four legs. Therefore, all dogs are tables LOGIC Logic is a science of the necessary laws of thought, without which no employment
More information-1- THE PROBABILITY THAT TWEETY IS ABLE TO FLY Giangiacomo Gerla Dipartimento di Matematica e Fisica, Università di Camerino ITALY.
-1- THE PROBABILITY THAT TWEETY IS ABLE TO FLY Giangiacomo Gerla Dipartimento di Matematica e Fisica, Università di Camerino ITALY. Abstract. Consider the question of assigning a probabilistic valuation
More informationA generalization of modal definability
A generalization of modal definability Tin Perkov Polytechnic of Zagreb Abstract. Known results on global definability in basic modal logic are generalized in the following sense. A class of Kripke models
More informationAn Alternative To The Iteration Operator Of. Propositional Dynamic Logic. Marcos Alexandre Castilho 1. IRIT - Universite Paul Sabatier and
An Alternative To The Iteration Operator Of Propositional Dynamic Logic Marcos Alexandre Castilho 1 IRIT - Universite Paul abatier and UFPR - Universidade Federal do Parana (Brazil) Andreas Herzig IRIT
More information2 C. A. Gunter ackground asic Domain Theory. A poset is a set D together with a binary relation v which is reexive, transitive and anti-symmetric. A s
1 THE LARGEST FIRST-ORDER-AXIOMATIZALE CARTESIAN CLOSED CATEGORY OF DOMAINS 1 June 1986 Carl A. Gunter Cambridge University Computer Laboratory, Cambridge C2 3QG, England Introduction The inspiration for
More informationOn 3-valued paraconsistent Logic Programming
Marcelo E. Coniglio Kleidson E. Oliveira Institute of Philosophy and Human Sciences and Centre For Logic, Epistemology and the History of Science, UNICAMP, Brazil Support: FAPESP Syntax Meets Semantics
More informationBoolean Algebra and Propositional Logic
Boolean Algebra and Propositional Logic Takahiro Kato September 10, 2015 ABSTRACT. This article provides yet another characterization of Boolean algebras and, using this characterization, establishes a
More informationChapter 2 Background. 2.1 A Basic Description Logic
Chapter 2 Background Abstract Description Logics is a family of knowledge representation formalisms used to represent knowledge of a domain, usually called world. For that, it first defines the relevant
More informationSome Non-Classical Approaches to the Brandenburger-Keisler Paradox
Some Non-Classical Approaches to the Brandenburger-Keisler Paradox Can BAŞKENT The Graduate Center of the City University of New York cbaskent@gc.cuny.edu www.canbaskent.net KGB Seminar The Graduate Center
More informationLogic: Propositional Logic (Part I)
Logic: Propositional Logic (Part I) Alessandro Artale Free University of Bozen-Bolzano Faculty of Computer Science http://www.inf.unibz.it/ artale Descrete Mathematics and Logic BSc course Thanks to Prof.
More informationBoolean Algebra and Propositional Logic
Boolean Algebra and Propositional Logic Takahiro Kato June 23, 2015 This article provides yet another characterization of Boolean algebras and, using this characterization, establishes a more direct connection
More informationAhmad KARIMI A NON-SELF-REFERENTIAL PARADOX IN EPISTEMIC GAME THEORY
REPORTS ON MATHEMATICAL LOGIC 52 (2017), 45 56 doi:10.4467/20842589rm.17.002.7140 Ahmad KARIMI A NON-SELF-REFERENTIAL PARADOX IN EPISTEMIC GAME THEORY A b s t r a c t. The beliefs of other people about
More informationOn some Metatheorems about FOL
On some Metatheorems about FOL February 25, 2014 Here I sketch a number of results and their proofs as a kind of abstract of the same items that are scattered in chapters 5 and 6 in the textbook. You notice
More informationWhat is logic, the topic of this course? There are at least two answers to that question.
Applied Logic Lecture 1 CS 486 Spring 2005 Tuesday, January 25, 2005 What is Logic? What is logic, the topic of this course? There are at least two answers to that question. General logic: critical examination
More informationPropositional Logic: Syntax
Logic Logic is a tool for formalizing reasoning. There are lots of different logics: probabilistic logic: for reasoning about probability temporal logic: for reasoning about time (and programs) epistemic
More informationFormal Epistemology: Lecture Notes. Horacio Arló-Costa Carnegie Mellon University
Formal Epistemology: Lecture Notes Horacio Arló-Costa Carnegie Mellon University hcosta@andrew.cmu.edu Logical preliminaries Let L 0 be a language containing a complete set of Boolean connectives, including
More informationLogic. Propositional Logic: Syntax. Wffs
Logic Propositional Logic: Syntax Logic is a tool for formalizing reasoning. There are lots of different logics: probabilistic logic: for reasoning about probability temporal logic: for reasoning about
More informationIntroduction to Metalogic
Introduction to Metalogic Hans Halvorson September 21, 2016 Logical grammar Definition. A propositional signature Σ is a collection of items, which we call propositional constants. Sometimes these propositional
More informationMajority Logic. Introduction
Majority Logic Eric Pacuit and Samer Salame Department of Computer Science Graduate Center, City University of New York 365 5th Avenue, New York 10016 epacuit@cs.gc.cuny.edu, ssalame@gc.cuny.edu Abstract
More informationBoolean Algebra. The Building Blocks of Digital Logic Design. Section. Section Overview. Binary Operations and Their Representation.
Section 3 Boolean Algebra The Building Blocks of Digital Logic Design Section Overview Binary Operations (AND, OR, NOT), Basic laws, Proof by Perfect Induction, De Morgan s Theorem, Canonical and Standard
More informationExamples: P: it is not the case that P. P Q: P or Q P Q: P implies Q (if P then Q) Typical formula:
Logic: The Big Picture Logic is a tool for formalizing reasoning. There are lots of different logics: probabilistic logic: for reasoning about probability temporal logic: for reasoning about time (and
More informationPrinciples of Knowledge Representation and Reasoning
Principles of Knowledge Representation and Reasoning Modal Logics Bernhard Nebel, Malte Helmert and Stefan Wölfl Albert-Ludwigs-Universität Freiburg May 2 & 6, 2008 Nebel, Helmert, Wölfl (Uni Freiburg)
More informationPropositional Logics and their Algebraic Equivalents
Propositional Logics and their Algebraic Equivalents Kyle Brooks April 18, 2012 Contents 1 Introduction 1 2 Formal Logic Systems 1 2.1 Consequence Relations......................... 2 3 Propositional Logic
More informationDiscrete Mathematics
Discrete Mathematics Yi Li Software School Fudan University March 13, 2017 Yi Li (Fudan University) Discrete Mathematics March 13, 2017 1 / 1 Review of Lattice Ideal Special Lattice Boolean Algebra Yi
More informationExplicit Logics of Knowledge and Conservativity
Explicit Logics of Knowledge and Conservativity Melvin Fitting Lehman College, CUNY, 250 Bedford Park Boulevard West, Bronx, NY 10468-1589 CUNY Graduate Center, 365 Fifth Avenue, New York, NY 10016 Dedicated
More informationA probability logic for reasoning about quantum observations
A probability logic for reasoning about quantum observations Angelina Ilic Stepic, Zoran Ognjanovic LAP 2017, Dubrovnik Outline 1 Quantum mechanics -basic concepts 2 Existing logical approaches 3 Logic
More informationLogic: Propositional Logic Truth Tables
Logic: Propositional Logic Truth Tables Raffaella Bernardi bernardi@inf.unibz.it P.zza Domenicani 3, Room 2.28 Faculty of Computer Science, Free University of Bolzano-Bozen http://www.inf.unibz.it/~bernardi/courses/logic06
More informationCS206 Lecture 21. Modal Logic. Plan for Lecture 21. Possible World Semantics
CS206 Lecture 21 Modal Logic G. Sivakumar Computer Science Department IIT Bombay siva@iitb.ac.in http://www.cse.iitb.ac.in/ siva Page 1 of 17 Thu, Mar 13, 2003 Plan for Lecture 21 Modal Logic Possible
More informationINDEPENDENCE OF THE CONTINUUM HYPOTHESIS
INDEPENDENCE OF THE CONTINUUM HYPOTHESIS CAPSTONE MATT LUTHER 1 INDEPENDENCE OF THE CONTINUUM HYPOTHESIS 2 1. Introduction This paper will summarize many of the ideas from logic and set theory that are
More information1. Propositional Calculus
1. Propositional Calculus Some notes for Math 601, Fall 2010 based on Elliott Mendelson, Introduction to Mathematical Logic, Fifth edition, 2010, Chapman & Hall. 2. Syntax ( grammar ). 1.1, p. 1. Given:
More informationLogic. Propositional Logic: Syntax
Logic Propositional Logic: Syntax Logic is a tool for formalizing reasoning. There are lots of different logics: probabilistic logic: for reasoning about probability temporal logic: for reasoning about
More informationNeighborhood Semantics for Modal Logic Lecture 5
Neighborhood Semantics for Modal Logic Lecture 5 Eric Pacuit ILLC, Universiteit van Amsterdam staff.science.uva.nl/ epacuit August 17, 2007 Eric Pacuit: Neighborhood Semantics, Lecture 5 1 Plan for the
More informationThe roots of computability theory. September 5, 2016
The roots of computability theory September 5, 2016 Algorithms An algorithm for a task or problem is a procedure that, if followed step by step and without any ingenuity, leads to the desired result/solution.
More informationMaximal Introspection of Agents
Electronic Notes in Theoretical Computer Science 70 No. 5 (2002) URL: http://www.elsevier.nl/locate/entcs/volume70.html 16 pages Maximal Introspection of Agents Thomas 1 Informatics and Mathematical Modelling
More informationUnderstanding the Brandenburger-Keisler Belief Paradox
Understanding the Brandenburger-Keisler Belief Paradox Eric Pacuit Institute of Logic, Language and Information University of Amsterdam epacuit@staff.science.uva.nl staff.science.uva.nl/ epacuit March
More informationThe Countable Henkin Principle
The Countable Henkin Principle Robert Goldblatt Abstract. This is a revised and extended version of an article which encapsulates a key aspect of the Henkin method in a general result about the existence
More information1. Propositional Calculus
1. Propositional Calculus Some notes for Math 601, Fall 2010 based on Elliott Mendelson, Introduction to Mathematical Logic, Fifth edition, 2010, Chapman & Hall. 2. Syntax ( grammar ). 1.1, p. 1. Given:
More informationBasic Probabilistic Reasoning SEG
Basic Probabilistic Reasoning SEG 7450 1 Introduction Reasoning under uncertainty using probability theory Dealing with uncertainty is one of the main advantages of an expert system over a simple decision
More informationPropositional Logic Arguments (5A) Young W. Lim 11/8/16
Propositional Logic (5A) Young W. Lim Copyright (c) 2016 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version
More information3. Only sequences that were formed by using finitely many applications of rules 1 and 2, are propositional formulas.
1 Chapter 1 Propositional Logic Mathematical logic studies correct thinking, correct deductions of statements from other statements. Let us make it more precise. A fundamental property of a statement is
More informationApproximations of Modal Logic K
WoLLIC 2005 Preliminary Version Approximations of Modal Logic K Guilherme de Souza Rabello 2 Department of Mathematics Institute of Mathematics and Statistics University of Sao Paulo, Brazil Marcelo Finger
More informationIntroduction to Logic and Axiomatic Set Theory
Introduction to Logic and Axiomatic Set Theory 1 Introduction In mathematics, we seek absolute rigor in our arguments, and a solid foundation for all of the structures we consider. Here, we will see some
More informationVictoria Gitman and Thomas Johnstone. New York City College of Technology, CUNY
Gödel s Proof Victoria Gitman and Thomas Johnstone New York City College of Technology, CUNY vgitman@nylogic.org http://websupport1.citytech.cuny.edu/faculty/vgitman tjohnstone@citytech.cuny.edu March
More informationCHAPTER 2 INTRODUCTION TO CLASSICAL PROPOSITIONAL LOGIC
CHAPTER 2 INTRODUCTION TO CLASSICAL PROPOSITIONAL LOGIC 1 Motivation and History The origins of the classical propositional logic, classical propositional calculus, as it was, and still often is called,
More informationChapter 2 Classical Probability Theories
Chapter 2 Classical Probability Theories In principle, those who are not interested in mathematical foundations of probability theory might jump directly to Part II. One should just know that, besides
More informationPropositional logic (revision) & semantic entailment. p. 1/34
Propositional logic (revision) & semantic entailment p. 1/34 Reading The background reading for propositional logic is Chapter 1 of Huth/Ryan. (This will cover approximately the first three lectures.)
More informationA consistent theory of truth for languages which conform to classical logic
Nonlinear Studies - www. nonlinearstudies.com MESA - www.journalmesa.com Preprint submitted to Nonlinear Studies / MESA A consistent theory of truth for languages which conform to classical logic S. Heikkilä
More informationDescription Logics. Foundations of Propositional Logic. franconi. Enrico Franconi
(1/27) Description Logics Foundations of Propositional Logic Enrico Franconi franconi@cs.man.ac.uk http://www.cs.man.ac.uk/ franconi Department of Computer Science, University of Manchester (2/27) Knowledge
More informationPřednáška 12. Důkazové kalkuly Kalkul Hilbertova typu. 11/29/2006 Hilbertův kalkul 1
Přednáška 12 Důkazové kalkuly Kalkul Hilbertova typu 11/29/2006 Hilbertův kalkul 1 Formal systems, Proof calculi A proof calculus (of a theory) is given by: A. a language B. a set of axioms C. a set of
More information03 Review of First-Order Logic
CAS 734 Winter 2014 03 Review of First-Order Logic William M. Farmer Department of Computing and Software McMaster University 18 January 2014 What is First-Order Logic? First-order logic is the study of
More informationChapter 4. Basic Set Theory. 4.1 The Language of Set Theory
Chapter 4 Basic Set Theory There are two good reasons for studying set theory. First, it s a indispensable tool for both logic and mathematics, and even for other fields including computer science, linguistics,
More informationIntroduction to Metalogic
Philosophy 135 Spring 2008 Tony Martin Introduction to Metalogic 1 The semantics of sentential logic. The language L of sentential logic. Symbols of L: Remarks: (i) sentence letters p 0, p 1, p 2,... (ii)
More informationAI Principles, Semester 2, Week 2, Lecture 5 Propositional Logic and Predicate Logic
AI Principles, Semester 2, Week 2, Lecture 5 Propositional Logic and Predicate Logic Propositional logic Logical connectives Rules for wffs Truth tables for the connectives Using Truth Tables to evaluate
More informationThe Legacy of Hilbert, Gödel, Gentzen and Turing
The Legacy of Hilbert, Gödel, Gentzen and Turing Amílcar Sernadas Departamento de Matemática - Instituto Superior Técnico Security and Quantum Information Group - Instituto de Telecomunicações TULisbon
More informationCOMP 2600: Formal Methods for Software Engineeing
COMP 2600: Formal Methods for Software Engineeing Dirk Pattinson Semester 2, 2013 What do we mean by FORMAL? Oxford Dictionary in accordance with convention or etiquette or denoting a style of writing
More informationTHE LANGUAGE OF FIRST-ORDER LOGIC (FOL) Sec2 Sec1(1-16)
THE LANGUAGE OF FIRST-ORDER LOGIC (FOL) Sec2 Sec1(1-16) FOL: A language to formulate knowledge Logic is the study of entailment relationslanguages, truth conditions and rules of inference. FOL or Predicate
More informationThe Limit of Humanly Knowable Mathematical Truth
The Limit of Humanly Knowable Mathematical Truth Gödel s Incompleteness Theorems, and Artificial Intelligence Santa Rosa Junior College December 12, 2015 Another title for this talk could be... An Argument
More informationCM10196 Topic 2: Sets, Predicates, Boolean algebras
CM10196 Topic 2: Sets, Predicates, oolean algebras Guy McCusker 1W2.1 Sets Most of the things mathematicians talk about are built out of sets. The idea of a set is a simple one: a set is just a collection
More informationNotes on Modal Logic
Notes on Modal Logic Notes for Philosophy 151 Eric Pacuit January 25, 2009 These short notes are intended to supplement the lectures and text ntroduce some of the basic concepts of Modal Logic. The primary
More informationIn a second part, we concentrate on interval models similar to the traditional ITL models presented in [, 5]. By making various assumptions about time
Complete Proof Systems for First Order Interval Temporal Logic Bruno Dutertre Department of Computer Science Royal Holloway, University of London Egham, Surrey TW0 0EX, United Kingdom Abstract Dierent
More informationInformal Statement Calculus
FOUNDATIONS OF MATHEMATICS Branches of Logic 1. Theory of Computations (i.e. Recursion Theory). 2. Proof Theory. 3. Model Theory. 4. Set Theory. Informal Statement Calculus STATEMENTS AND CONNECTIVES Example
More information02 Propositional Logic
SE 2F03 Fall 2005 02 Propositional Logic Instructor: W. M. Farmer Revised: 25 September 2005 1 What is Propositional Logic? Propositional logic is the study of the truth or falsehood of propositions or
More informationWojciech Penczek. Polish Academy of Sciences, Warsaw, Poland. and. Institute of Informatics, Siedlce, Poland.
A local approach to modal logic for multi-agent systems? Wojciech Penczek 1 Institute of Computer Science Polish Academy of Sciences, Warsaw, Poland and 2 Akademia Podlaska Institute of Informatics, Siedlce,
More informationWhat are the recursion theoretic properties of a set of axioms? Understanding a paper by William Craig Armando B. Matos
What are the recursion theoretic properties of a set of axioms? Understanding a paper by William Craig Armando B. Matos armandobcm@yahoo.com February 5, 2014 Abstract This note is for personal use. It
More informationcse541 LOGIC FOR COMPUTER SCIENCE
cse541 LOGIC FOR COMPUTER SCIENCE Professor Anita Wasilewska Spring 2015 LECTURE 2 Chapter 2 Introduction to Classical Propositional Logic PART 1: Classical Propositional Model Assumptions PART 2: Syntax
More informationFirst-Order Logic. 1 Syntax. Domain of Discourse. FO Vocabulary. Terms
First-Order Logic 1 Syntax Domain of Discourse The domain of discourse for first order logic is FO structures or models. A FO structure contains Relations Functions Constants (functions of arity 0) FO
More informationApplied Logics - A Review and Some New Results
Applied Logics - A Review and Some New Results ICLA 2009 Esko Turunen Tampere University of Technology Finland January 10, 2009 Google Maps Introduction http://maps.google.fi/maps?f=d&utm_campaign=fi&utm_source=fi-ha-...
More informationMathematics for Informatics 4a
Mathematics for Informatics 4a José Figueroa-O Farrill Lecture 1 18 January 2012 José Figueroa-O Farrill mi4a (Probability) Lecture 1 1 / 23 Introduction Topic: Probability and random processes Lectures:
More informationAn Inquisitive Formalization of Interrogative Inquiry
An Inquisitive Formalization of Interrogative Inquiry Yacin Hamami 1 Introduction and motivation The notion of interrogative inquiry refers to the process of knowledge-seeking by questioning [5, 6]. As
More information185.A09 Advanced Mathematical Logic
185.A09 Advanced Mathematical Logic www.volny.cz/behounek/logic/teaching/mathlog13 Libor Běhounek, behounek@cs.cas.cz Lecture #1, October 15, 2013 Organizational matters Study materials will be posted
More informationGenerative Techniques: Bayes Rule and the Axioms of Probability
Intelligent Systems: Reasoning and Recognition James L. Crowley ENSIMAG 2 / MoSIG M1 Second Semester 2016/2017 Lesson 8 3 March 2017 Generative Techniques: Bayes Rule and the Axioms of Probability Generative
More informationPREDICATE LOGIC. Schaum's outline chapter 4 Rosen chapter 1. September 11, ioc.pdf
PREDICATE LOGIC Schaum's outline chapter 4 Rosen chapter 1 September 11, 2018 margarita.spitsakova@ttu.ee ICY0001: Lecture 2 September 11, 2018 1 / 25 Contents 1 Predicates and quantiers 2 Logical equivalences
More informationTheory of Languages and Automata
Theory of Languages and Automata Chapter 0 - Introduction Sharif University of Technology References Main Reference M. Sipser, Introduction to the Theory of Computation, 3 nd Ed., Cengage Learning, 2013.
More informationCOMP9414: Artificial Intelligence Propositional Logic: Automated Reasoning
COMP9414, Monday 26 March, 2012 Propositional Logic 2 COMP9414: Artificial Intelligence Propositional Logic: Automated Reasoning Overview Proof systems (including soundness and completeness) Normal Forms
More informationKLEENE LOGIC AND INFERENCE
Bulletin of the Section of Logic Volume 4:1/2 (2014), pp. 4 2 Grzegorz Malinowski KLEENE LOGIC AND INFERENCE Abstract In the paper a distinguished three-valued construction by Kleene [2] is analyzed. The
More informationCSCI3390-Lecture 6: An Undecidable Problem
CSCI3390-Lecture 6: An Undecidable Problem September 21, 2018 1 Summary The language L T M recognized by the universal Turing machine is not decidable. Thus there is no algorithm that determines, yes or
More informationCISC-102 Fall 2018 Week 11
page! 1 of! 26 CISC-102 Fall 2018 Pascal s Triangle ( ) ( ) An easy ( ) ( way ) to calculate ( ) a table of binomial coefficients was recognized centuries ago by mathematicians in India, ) ( ) China, Iran
More informationLogic in Computer Science. Frank Wolter
Logic in Computer Science Frank Wolter Meta Information Slides, exercises, and other relevant information are available at: http://www.liv.ac.uk/~frank/teaching/comp118/comp118.html The module has 18 lectures.
More informationReasoning Under Uncertainty: Introduction to Probability
Reasoning Under Uncertainty: Introduction to Probability CPSC 322 Lecture 23 March 12, 2007 Textbook 9 Reasoning Under Uncertainty: Introduction to Probability CPSC 322 Lecture 23, Slide 1 Lecture Overview
More informationLINDSTRÖM S THEOREM SALMAN SIDDIQI
LINDSTRÖM S THEOREM SALMAN SIDDIQI Abstract. This paper attempts to serve as an introduction to abstract model theory. We introduce the notion of abstract logics, explore first-order logic as an instance
More informationModal logics: an introduction
Modal logics: an introduction Valentin Goranko DTU Informatics October 2010 Outline Non-classical logics in AI. Variety of modal logics. Brief historical remarks. Basic generic modal logic: syntax and
More informationFormal Epistemology: Lecture Notes. Horacio Arló-Costa Carnegie Mellon University
Formal Epistemology: Lecture Notes Horacio Arló-Costa Carnegie Mellon University hcosta@andrew.cmu.edu Bayesian Epistemology Radical probabilism doesn t insists that probabilities be based on certainties;
More informationLogic: The Big Picture
Logic: The Big Picture A typical logic is described in terms of syntax: what are the legitimate formulas semantics: under what circumstances is a formula true proof theory/ axiomatization: rules for proving
More informationLogic Part II: Intuitionistic Logic and Natural Deduction
Yesterday Remember yesterday? classical logic: reasoning about truth of formulas propositional logic: atomic sentences, composed by connectives validity and satisability can be decided by truth tables
More informationThe Converse of Deducibility: C.I. Lewis and the Origin of Modern AAL/ALC Modal 2011 Logic 1 / 26
The Converse of Deducibility: C.I. Lewis and the Origin of Modern Modal Logic Edwin Mares Victoria University of Wellington AAL/ALC 2011 The Converse of Deducibility: C.I. Lewis and the Origin of Modern
More informationThe semantics of propositional logic
The semantics of propositional logic Readings: Sections 1.3 and 1.4 of Huth and Ryan. In this module, we will nail down the formal definition of a logical formula, and describe the semantics of propositional
More informationLecture 11: Measuring the Complexity of Proofs
IAS/PCMI Summer Session 2000 Clay Mathematics Undergraduate Program Advanced Course on Computational Complexity Lecture 11: Measuring the Complexity of Proofs David Mix Barrington and Alexis Maciel July
More informationJUSTIFYING BOOLE S ALGEBRA of LOGIC for CLASSES
Outline The Paradigm The Starting Point Boole s Partial Algebras Boole s Translations Laws and Rules of Inference Characteristic Functions Signed Multisets NCR 1 R01 Horn Formulas Relativizing Quantifiers
More informationEncoding formulas with partially constrained weights in a possibilistic-like many-sorted propositional logic
Encoding formulas with partially constrained weights in a possibilistic-like many-sorted propositional logic Salem Benferhat CRIL-CNRS, Université d Artois rue Jean Souvraz 62307 Lens Cedex France benferhat@criluniv-artoisfr
More informationHandout on Logic, Axiomatic Methods, and Proofs MATH Spring David C. Royster UNC Charlotte
Handout on Logic, Axiomatic Methods, and Proofs MATH 3181 001 Spring 1999 David C. Royster UNC Charlotte January 18, 1999 Chapter 1 Logic and the Axiomatic Method 1.1 Introduction Mathematicians use a
More informationcis32-ai lecture # 18 mon-3-apr-2006
cis32-ai lecture # 18 mon-3-apr-2006 today s topics: propositional logic cis32-spring2006-sklar-lec18 1 Introduction Weak (search-based) problem-solving does not scale to real problems. To succeed, problem
More informationA Note on Graded Modal Logic
A Note on Graded Modal Logic Maarten de Rijke Studia Logica, vol. 64 (2000), pp. 271 283 Abstract We introduce a notion of bisimulation for graded modal logic. Using these bisimulations the model theory
More informationFrom Leibniz to Boole to Big Data
From Leibniz to Boole to Big Data John Hooker Carnegie Mellon University George Boole Bicentenary University College Cork August 2015 Far Ahead of His Time George Boole is best known for Boolean logic.
More informationMathematical Logic. Introduction to Reasoning and Automated Reasoning. Hilbert-style Propositional Reasoning. Chiara Ghidini. FBK-IRST, Trento, Italy
Introduction to Reasoning and Automated Reasoning. Hilbert-style Propositional Reasoning. FBK-IRST, Trento, Italy Deciding logical consequence Problem Is there an algorithm to determine whether a formula
More informationCOMP219: Artificial Intelligence. Lecture 19: Logic for KR
COMP219: Artificial Intelligence Lecture 19: Logic for KR 1 Overview Last time Expert Systems and Ontologies Today Logic as a knowledge representation scheme Propositional Logic Syntax Semantics Proof
More information