Jeffrey Welaish - Academia.edu (original) (raw)

Jeffrey Welaish

Uploads

Papers by Jeffrey Welaish

Research paper thumbnail of Garden-Lattice Constructions in S4: A Counter-Example for an Interpolation Theorem

Research paper thumbnail of Garden-Lattice Constructions in S4: A Counter-Example for an Interpolation Theorem

C is a countably infinite set of sentence letters. L is a sentential language over C, and L is th... more C is a countably infinite set of sentence letters. L is a sentential language over C, and L is the modal language extending L. For ϕ, a sentence in L , r(ϕ) is the modal rank of ϕ; C(ϕ) is the set of members of C occurring in ϕ. In [10] it was shown that there is a family of modal logics, including M , B, S 4 and S 5 , in which the interpolation theorem holds: if ϕ |= ψ, then there is Γ in L such that

Research paper thumbnail of Back and Forth Constructions in Modal Logic: An Interpolation Theorem for a Family of Modal Logics

Journal of Symbolic Logic, 1986

JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, a... more JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR, please contact support@jstor.org.

Research paper thumbnail of Garden-Lattice Constructions in S4: A Counter-Example for an Interpolation Theorem

Research paper thumbnail of Garden-Lattice Constructions in S4: A Counter-Example for an Interpolation Theorem

C is a countably infinite set of sentence letters. L is a sentential language over C, and L is th... more C is a countably infinite set of sentence letters. L is a sentential language over C, and L is the modal language extending L. For ϕ, a sentence in L , r(ϕ) is the modal rank of ϕ; C(ϕ) is the set of members of C occurring in ϕ. In [10] it was shown that there is a family of modal logics, including M , B, S 4 and S 5 , in which the interpolation theorem holds: if ϕ |= ψ, then there is Γ in L such that

Research paper thumbnail of Back and Forth Constructions in Modal Logic: An Interpolation Theorem for a Family of Modal Logics

Journal of Symbolic Logic, 1986

JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, a... more JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR, please contact support@jstor.org.

Log In