Normal Modal Logic

In logic, normal modal logic is a set L of modal formulas such that L contains
  • all propositional tautologies,
  • Kripke's schema: \Box(A\to B)\to(\Box A\to\Box B),
and L is closed under
  • substitution,
  • detachment rule: from A and AB infer B,
  • necessitation rule: from A infer \Box A.
The minimal normal modal logic is known as K.

 

<< PreviousWord BrowserNext >>
crying (album)
maurice laur
mary post
grassroots (album)
humbucking
enfield, nova scotia
british medical association
distinctive media
snake's revenge
ulf tostesson
utsunomiya line
bernard hislaire
focusing
omiya station
quadriceps
burlington coat factory
lca
eric s. nylund
ms saint louis
xiangtan
rule of 70
vga planets
omc (band)
shen nung
bismarck sea
anatoly guzhvin
sound system (dj)
thea astley
graphene
johnny griffin
don bachardy
pramoedya ananta toer
oracle rdb
annoyance
sidney bradford
wendy orlean williams
wang dulu
edward griffith
trouw
madaline lee
how to marry a millionaire
comedy of manners
metaballs
brandendamm