Learn More
The common form of a mathematical theorem consists in that "the truth of some properties for some objects is necessary andlor sufficient condition for other properties to hold for other objects". To formalize this, one happens to resort to Kripke modal logic K which, having in the syntax the notions of 'property' and 'necessity', appears to provide a(More)
We investigate an enrichment of the propositional modal language with a "universal" modality n having semantics x ~ iq~ iff Vy(y ~ ~0), and a countable set of "names"-a special kind of propositional variables ranging over singleton sets of worlds. The obtained language ~cq c proves to have a great expressive power. It is equivalent with respect to modal(More)
  • 1