Forcing and Model Completions
- 116 Downloads
Let L be a language of fixed similarity type and let M be a fixed class of S-modal structures for ML. Let Φ be a fixed set of formulas of MLA which contains all atomic formulas and is closed under subformulas. The S-forcing property P(M,Φ) is described as follows. Let 4>(C) be the set of all sentences of MKA of the form Ax1…xn[c1,…,cn] where A∈Φ and c 1 …, c n∈C = ∪ u∈U C.
KeywordsGeneric Structure Modal Logic Force Condition Finite Subset Atomic Formula
Unable to display preview. Download preview PDF.