Order:
Disambiguations
I. I. I. Sem [10]Geoffrey Sem [2]
See also
  1. The ethics of betel nut consumption in Taiwan.Joseph Tham, Geoffrey Sem, Eugene Sit & Michael Cheng-tek Tai - 2017 - Journal of Medical Ethics 43 (11):739-740.
    The ethics of betel nut use in Taiwan are examined in this article. It first presents scientific facts about the betel quid, its consumption and negative health consequences and then analyses the cultural background and economic factors contributing to its popularity in Asia. Governmental and institutional attempts to curb betel nut cultivation, distribution and sales are also described. Finally, the bioethical implications of this often ignored subject are considered.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
  2. A Scientific and Socioecononic Review of Betel Nut Use in Taiwan with Bioethical Reflections.Joseph Tham, Geoffrey Sem, Eugene Sit & Michael Cheng-tek Tai - 2017 - Asian Bioethics Review 9 (4):401-414.
    This article addresses the ethics of betel nut use in Taiwan. It first presents scientific facts about the betel quid and its consumption and the generally accepted negative health consequences associated with its use: oral and esophageal cancer, coronary artery disease, metabolic diseases, and adverse effects in pregnancy. It then analyzes the cultural background and economic factors contributing to its popularity in Asia. The governmental and institutional attempts to curb betel nut cultivation, distribution, and sales are also described. Finally, the (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  3. Degree constructions (schwarzschild 2008).I. I. I. Sem - unknown
    • A-not-A analysis basic idea: “the comparative introduces a threshold the subject […] meets or exceeds & the complement is a negative statement elaborating on that threshold.” (Schwarzschild 2008:6).
    No categories
     
    Export citation  
     
    Bookmark  
  4. Dynamic predicate logic.I. I. I. Sem - unknown
    • 1st try: Free variables in PL (Predicate Logic) (1) Jim1 came in. He1 sat down. (antecedent Jim1 … anaphoric he1) |=M, g cm ιx(x = z1  z1 = jim)  sit z1 iff g(z1) ∈ cm & g(z1) = jim & g(z1) ∈ sit.
     
    Export citation  
     
    Bookmark   1 citation  
  5. Existence and Maximization.I. I. I. Sem - unknown
    1. {0}εx  DxH1 =  2. K: {0}εxK =  & KDxH1 =  D3. 3. K: {0}(x) =  & {0} x K & K = H1 & K(x) ∈ D D3.εu, β 4. KA: {0}[x/A] = K & K = H1 & K(x) ∈ D D2.0, G u H 5. A: {0}[x/A] = H1 & H1(x) ∈ D elim. K 6. A: {0}[x/A] = H1 & A\{} ∈ D D2.G..
     
    Export citation  
     
    Bookmark  
  6. Pluralities.I. I. I. Sem - unknown
    (2) a. John and Mary are students. distributive VP b. John is a student. (2a) |= (2b).
     
    Export citation  
     
    Bookmark  
  7. • Paradigm examples.I. I. I. Sem - unknown
    (1) Adam and Beth lifted (a stack of) three crates (together). collective VP (2) Adam and Beth (each) lifted (the same stack of) three crates. dist. VP, wide obj (3) Adam and Beth (each) lifted (a different stack of) three crates. dist. VP, narrow obj..
     
    Export citation  
     
    Bookmark  
  8. Predicate Logic (with Anaphora).I. I. I. Sem - unknown
    D2.1 (PL models and assignments) i. A PL model is a pair M = 〈DM, ·M〉 such that (a) DM is a non-empty set, and (b) ·M maps each A ∈ Con to AM ∈ DM, and each B ∈ Prdn to BM  (DM)n. ii. GM = {g| g: Var  DM} is the set of M-assignments. For any g ∈ GM, u ∈ Var, d ∈ DM, g[u/d] := (g\{u, g(u)})  {u, d} is the u-to-d alternative to (...)
     
    Export citation  
     
    Bookmark  
  9. Quantified np's and donkey anaphora.I. I. I. Sem - unknown
    (1) Mostx menx who own ay donkey beat ity. e.g. |≠M, g (1) if man = {m0, …, m9} & m0 owns & beats donkey d0, …, d9 & m1 owns & beats donkeys d10, …, d19 & m2 owns donkey d20 (only) but doesn’t beat d20..
     
    Export citation  
     
    Bookmark  
  10. Top 2: Centering theory of mood.I. I. I. Sem - unknown
    D1.2 (UCω syntax) For any type a ∈ Θ, the set of a-terms, Trma, is defined as follows: b. A ∈ Trma a. BA ∈ Trmb..
     
    Export citation  
     
    Bookmark  
  11. Top 1: Update with Centering.I. I. I. Sem - unknown
    UPDATE WITH NOMINAL CENTERING (UCδ) D1.0 (UCδ types) The set of UCδ types Θ is the smallest set such that: i. t, δ, s ∈ Θ ii. (ab) ∈ Θ, if a, b ∈ Θ D1.1 (UCδ basic terms). For each a ∈ Θ, a set of a-constants Cona and a-variables Vara, incl.: Conδ = {a, b, c} Var(sδ) = {x, y, z}.
     
    Export citation  
     
    Bookmark  
  12. Ucδ with algebra (ucδ+).I. I. I. Sem - unknown
    D1.2 (UCδ+ syntax) Rules b, a, λ, =, ¬, , n, m, {}, , ; as for UCΔ. . (A  B) ∈ Trmδ if A, B ∈ Trmδ (A) ∈ Trmδ if A ∈ Trm(δt) o. (A), (A) ∈ Trmδ if A ∈ Trmδ A(A), N(A) ∈ Trmδt if A ∈ Trmδ r. A  B ∈ Trmt..
     
    Export citation  
     
    Bookmark