epistemic logic with questions michal peli s http web ff
play

Epistemic Logic with Questions Michal Peli s - PDF document

Epistemic Logic with Questions Michal Peli s http://web.ff.cuni.cz/~pelis 1 Questions as a part of inferential structures Inferential Erotetic Logic (A. Wi sniewski, based on classical logic) Evocation , Q Erotetic


  1. Epistemic Logic with Questions Michal Peliˇ s http://web.ff.cuni.cz/~pelis 1

  2. Questions as a part of inferential structures Inferential Erotetic Logic (A. Wi´ sniewski, based on classical logic) Evocation � Γ , Q � Erotetic implication �� Q 1 , Γ � , Q 2 � 2

  3. Example of e-implication Q 1 : What is Peter graduate of: faculty of law or faculty of economy? I can be satisfied by the answer He is a lawyer. even if I did not ask Q 2 : What is Peter: lawyer or economist? The connection between Q 1 and Q 2 could be done by the following knowledge base Γ: Someone is graduate of a faculty of law iff he/she is a lawyer. Someone is graduate of a faculty of economy iff he/she is an economist. 3

  4. One-agent propositional epistemic logic propositional language with modality K (knowl- edge as “necessity”) and M ( Mϕ ≡ ¬ K ¬ ϕ ) semantics • Kripke frame F = � S, R � with a set of states (points, indices, possible worlds) S and an accessibility relation R ⊆ S 2 . • Kripke model M = �F , | = � where | = is a satisfaction relation between states and formulas. 4

  5. The satisfaction relation | = is defined by a standard way: 1. For each ϕ ∈ A and ( M , s ): either ( M , s ) | = ϕ or ( M , s ) �| = ϕ . 2. ( M , s ) | = ¬ ϕ iff ( M , s ) �| = ϕ 3. ( M , s ) | = ψ 1 ∨ ψ 2 iff ( M , s ) | = ψ 1 or ( M , s ) | = ψ 2 4. ( M , s ) | = ψ 1 ∧ ψ 2 iff ( M , s ) | = ψ 1 and ( M , s ) | = ψ 2 5. ( M , s ) | = ψ 1 → ψ 2 iff ( M , s ) | = ψ 1 implies ( M , s ) | = ψ 2 6. ( M , s ) | = Kϕ iff ( M , s 1 ) | = ϕ , for each s 1 such that sRs 1 5

  6. Incorporating questions extend epistemic language by ? and appropri- ate brackets Q =? { α 1 , . . . , α n } � �� � dQ Q requires one of the following answers: It is the case that α 1 . . . . It is the case that α n . A questioner presupposes at least ( α 1 ∨ . . . ∨ α n ) and maybe more. 6

  7. Presuppositions presupposition of a question Q ϕ ∈ Pres Q iff ( ∀ M )( ∀ s )( ∀ α ∈ dQ )(( M , s ) | = α → ϕ ) prospective presupposition of a question Q ϕ ∈ PPres Q iff ϕ ∈ Pres Q and ( ∀ M )( ∀ s ) ( M , s ) | = ϕ implies ( ∃ α ∈ dQ )(( M , s ) | = α ) • Each prospective presupposition is a max- imal presupposition. • If ϕ, ψ ∈ PPres Q , then ϕ ≡ ψ . 7

  8. Q is sound at ( M , s ) ( M , s ) | = Q iff 1. ( ∀ α ∈ dQ ) (a) ( M , s ) | = Mα (b) ( M , s ) �| = Kα 2. ( ∀ ϕ ∈ Pres Q )(( M , s ) | = Kϕ ) A question sound at ( M , s ) forms a partitioning on the afterset. 8

  9. Examples 1 • ( M , s ) | = ? α means α ր s ց ¬ α The same is for ( M , s ) | = ? ¬ α . • ( M , s ) | = ?( α ∧ β ) α, β ր s ց ¬ ( α ∧ β ) Analogously for ?( α ∨ β ). 9

  10. Examples 2 • ? | α, β | is equal to ? { ( α ∧ β ) , ( ¬ α ∧ β ) , ( α ∧ ¬ β ) , ( ¬ α ∧ ¬ β ) } . α, β ր − → α, ¬ β s ↓ ց ¬ α, ¬ β ¬ α, β • ( M , s ) | = ? { α, β } , then ( M , s ) | = K ( α ∨ β ) α, ¬ β ,( α ∨ β ) ր s ց ¬ α, β ,( α ∨ β ) 10

  11. Evocation i ( M , s ) | = Γ → Q iff ( M , s ) | = K Γ and ( M , s ) | = Q coincides with question in an information set (J. Groenendijk, M. Stokhof) 11

  12. E-implication ( M , s ) | = (Γ , Q 1 ) ⇒ Q 2 iff (( M , s ) | = K Γ and ( M , s ) | = Q 1 ) implies ( M , s ) | = Q 2 Pure e-implication (Γ = ∅ ) ( M , s ) | = Q 1 → Q 2 iff ( M , s ) | = Q 1 implies ( M , s ) | = Q 2 12

  13. Examples of pure e-implication • | = ? α → ? ¬ α as well as | = ? α ← ? ¬ α • | = ?( α ∧ β ) ← ? | α, β | , the same for ∨ instead of ∧ • | = ? | α, β | → ? α and | = ? | α, β | → ? β • | = ? | α, β | → ?( α | β ) • | = ? | α, β | → ? { α, β, ( ¬ α ∧ ¬ β ) } • | = ? { ( α ∨ β ) , α } → ? { α, β } • | = ? { α, β, γ } → ? α (as well as ? β and ? γ ) 13

  14. Example of e-implication Γ = { ( α 1 ↔ β 1 ) , ( α 2 ↔ β 2 ) } | = (Γ , ? { β 1 , β 2 } ) ⇒ ? { α 1 , α 2 } as well as | = (Γ , ? { α 1 , α 2 } ) ⇒ ? { β 1 , β 2 } both questions are equal with respect to Γ 14

  15. Answerhood An agent gets a complete answer ϕ to a question Q at ( M , s ) iff ( M , s ) | = Kϕ such that ϕ | = α for some α ∈ dQ . An agent gets a partial answer to a question Q at ( M , s ) iff she gets a complete answer to a question ? ϕ at ( M , s ) such that Q → ? ϕ . α is a partial answer to ? | α, β | α, β ր − → α, ¬ β s ↓ ց ¬ α, ¬ β ¬ α, β 15

  16. Basic references D. Harrah. The logic of questions. In D. Gabbay and F. Guenthner (eds.), Handbook of Philosophical Logic . Kluwer, 2002. Volume 8, pages 1–60. A. Wi´ sniewski. The Posing of Questions . Kluwer, 1995. J. Groenendijk and M. Stokhof. Questions. In J. van Benthem and A. ter Meulen (eds.), Handbook of Logic and Language . Elsevier, 1997. Pages 1055–1125. 16

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend