소요의 철학 아카이브

2023-2 Ethics and Technology2024.05.10 - [Research/Publications] - Can AI become an Expert? Can AI become an Expert?김현균. (2024). Can AI become an Expert?. 인공지능인문학연구, 16, 113-136.georgia15.tistory.com  1. The Main QuestionsIn the final paper, I will delve into the question of whether artificial intelligence can become an expert. Throughout history, the emergence of new technologies has consistent..

2023-2 Modal Logic (Segment 2) Q) UG, MP. E! is primitive, ∼ , ∨ are primitive and we have the usual definitions. Sketch proofs of: ① ├FL (∀x)( E!x ≡ (∃y)(x = y)). ② ├FL (∀y) ((∀x) ϕx ⊃ ϕy). Now consider the system FL* which is just like the above except that (∀y) ((∀x) ϕx ⊃ ϕy) replaces axiom schemas 2 and 3, and E! is dropped as a primitive sign. Sketch proofs of: ③ ├FL* (∀x) (∃y)(x = y) ④ ├FL..

2023-2 Modal Logic (Segment 3) Q) Describe in some detail the different approaches to understanding possible worlds—e.g., out in Lycan’s discussion in “The Trouble with Possible Worlds”. What is the problem of how we know we are actual”? What are some main difficulties of and attempt at a combinatorial approach to possible worlds? What sense of “possible” seems more amenable to a combinatorial a..

2023-2 Modal Logic (Segment 2) Q) Evaluate the following wffs in the B-semantics + inclusion requirement and determine in what systems, K, T, S4, β, S5 (if any) they are valid. 1. (∃y)LM(ϕy ⊃ (∀x)ϕx) 2. L(∃x)(Lϕx ∨ ψy) ⊃ (∃x)L(Lϕx ∨ ψy) 3. L(M(∃x)ϕx ⊃ (∃x)Mϕx) 4. L(∃x)ϕx ⊃ (∃x)Lϕx

2023-2 Modal Logic (Segment 2) Q) Quantification theory may be formalized this way: Prove the following in the systems indicated. 1. ├ L(∀x)ϕx . ⊃. (∀x)Lϕx 2. ├ β (∀x)Lϕx . ⊃. L(∀x)ϕx (Recall that system β is T + p ⊃ LMp. ) 3. ├ M(∃x)ϕx . ⊃. (∃x)Mϕx (The system is QML + (∀x)Lϕx . ⊃. L(∀x)ϕx) 4. ├ (∀x)Lα ⊃ L(∀x)α (The system is QML+ (∀x)L(α ⊃ β) .⊃. L((∀x)α ⊃ (∀x)β)

2023-2 Modal Logic (Segment 2) Q) Use tableaux to show the difference between what we have called the A semantics and the B semantics (+ inclusion requirement) and the C-semantics for quantified modal logic. Be sure to explain by reference to the question of the validity of the Carnap-Barcan Formula (BF) and its converse. Be sure to explain the situation with Ax1 (∀x) (ϕx) ⊃ ϕy, where y is free ..

2023-2 Modal Logic (Segment 3) Q) Use the tableau method (which involves non-normal world idea) to determine whether the following are valid in Lewis’ systems S2, S3: 1. Lp ⊃ LLp 2. L( M(p ∧ q) ⊃ Mp) 3. L(L(p ⊃ q ) ⊃ L(Lp ⊃ Lq))

2023-2 Modal Logic (Segment 3) Q) Explain the system S1. In what sense is it the case that the “unrestricted” rules of Necessitation does not hold in S1. Does pc tautology necessitation hold in S1 ? What is the Cresswell argument (See my SS1 paper) that S1 has no theorems of the form LL(p⊃ p)? Explain the semantic system for S2 and S3 and S4 where one introduces odd vs normal worlds. Note that b..

2023-2 Modal Logic (Segment 3) Q) How might one use relevant logic to interpret C. I. Lewis’ strict implication as relevant entailment where we have: Give proofs of the wffs K and T in Lewis’s S1, i.e., prove: 1. L(p ⊃ q) : ⊃: Lp ⊃ Lq 2. Lp ⊃ p