Advertisement

Forcing and Model Completions

  • Kenneth A. Bowen
Chapter
  • 116 Downloads
Part of the Synthese Library book series (SYLI, volume 127)

Abstract

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.

Keywords

Generic Structure Modal Logic Force Condition Finite Subset Atomic Formula 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media Dordrecht 1979

Authors and Affiliations

  • Kenneth A. Bowen
    • 1
  1. 1.Syracuse UniversityUSA

Personalised recommendations