| Record ID | marc_columbia/Columbia-extract-20221130-006.mrc:311329321:1945 |
| Source | marc_columbia |
| Download Link | /show-records/marc_columbia/Columbia-extract-20221130-006.mrc:311329321:1945?format=raw |
LEADER: 01945mam a22003614a 4500
001 2773301
005 20221013010119.0
008 000412s2000 maua b 001 0 eng
010 $a 00030380
020 $a0262082896 (alk. hc)
035 $a(OCoLC)ocm43894182
035 $9ARP0257CU
035 $a(NNC)2773301
035 $a2773301
040 $aDLC$cDLC$dOrLoB-B
042 $apcc
050 00 $aQA76.9.L63$bH37 2000
082 00 $a004/.01/5113$221
100 1 $aHarel, David,$d1950-$0http://id.loc.gov/authorities/names/n79038969
245 10 $aDynamic logic /$cDavid Harel, Dexter Kozen, Jerzy Tiuryn.
260 $aCambridge, Mass. :$bMIT Press,$c2000.
300 $axv, 459 pages :$billustrations ;$c23 cm.
336 $atext$btxt$2rdacontent
337 $aunmediated$bn$2rdamedia
490 1 $aFoundations of computing
504 $aIncludes bibliographical references and index.
505 00 $gI.$tFundamental Concepts.$g1.$tMathematical Preliminaries.$g2.$tComputability and Complexity.$g3.$tLogic.$g4.$tReasoning About Programs --$gII.$tPropositional Dynamic Logic.$g5.$tPropositional Dynamic Logic.$g6.$tFiltration and Decidability.$g7.$tDeductive Completeness.$g8.$tComplexity of PDL.$g9.$tNonregular PDL.$g10.$tOther Variants of PDL --$gIII.$tFirst-Order Dynamic Logic.$g11.$tFirst-Order Dynamic Logic.$g12.$tRelationships with Static Logics.$g13.$tComplexity.$g14.$tAxiomatization.$g15.$tExpressive Power.$g16.$tVariants of DL.$g17.$tOther Approaches.
650 0 $aComputer logic.$0http://id.loc.gov/authorities/subjects/sh97004631
650 0 $aFormal methods (Computer science)$0http://id.loc.gov/authorities/subjects/sh99003622
700 1 $aKozen, Dexter,$d1951-$0http://id.loc.gov/authorities/names/n82026953
700 1 $aTiuryn, Jerzy.$0http://id.loc.gov/authorities/names/n95052565
830 0 $aFoundations of computing.$0http://id.loc.gov/authorities/names/n83731477
852 00 $boff,eng$hQA76.9.L63$iH37 2000