models. Studies in Logic and the Foundations of Ma

[RS23]M.RyanandM.Sadler.Valuationsystemsandconsequencerela-tions.InD.Gabbayandal.,editors,HandbookofLogicinCom-puterScience.OxfordUniversityPress,1992/3.[She84]J.C.Shepherdson.Negationasfailure:AcomparisonofClark’scompleteddatabaseandReiter’sclosedworldassumption.JournalofLogicProgramming,1:51{81,1984.[She85]J.C.Shepherdson.NegationasfailureII.JournalofLogicPro-gramming,3:185{202,1985.[She88]J.C.Shepherdson.Negationinlogicprogramming.InJ.Minker,editor,Foundationsofdeductivedatabasesandlogicprogramming,chapter1.MorganKaufmannPublishers,1988.[She90]S.Shelah.ClassicationTheoryandthenumberofnon{isomorphicmodels.StudiesinLogicandtheFoundationsofMathematics.NorthHolland,2edition,1990.[SSH87]J.T.Schwartz,M.Sharir,andJ.Hopcroft,editors.Planning,Ge-ometry,andComplexityofRobotMotion.AblexSeriesinArticialIntelligence.AblexPublishingCorporation,1987.[TS88]R.W.ToporandE.A.Sonenberg.Ondomainindependentdatabases.InJ.Minker,editor,Foundationsofdeductivedatabasesandlogicprogramming,chapter6.MorganKaufmannPub-lishers,1988.[Ull82]J.D.Ullman.PrinciplesofDatabaseSystems.PrinciplesofCom-puterScienceSeries.ComputerSciencePress,2edition,1982.[Var88]M.Vardi.Fundamentalsofdependencytheory.InE.Borger,edi-tor,TrendsinTheoreticalComputerScience,chapter5.ComputerSciencePress,1988.[Wil81]R.L.Wilder.MathematicsasaCulturalSystem.PergamonPress,1981.25[Mak85]J.A.Makowsky.Compactness,embeddingsanddenability.InModel-TheoreticLogics,PerspectivesinMathematicalLogic,chap-ter18.SpringerVerlag,1985.[Mak87]J.A.Makowsky.WhyHornformulasmatterforcomputerscience:Initialstructuresandgenericexamples.JournalofComputerandSystemSciences,34.2/3:266{292,1987.[Mak88]J.A.Makowsky.Mentalimagesandthearchitectureofconcepts.InR.Herken,editor,TheUniversalTuringMachine.AHalf{CenturySurvey.OxfordUniversityPress,1988.[Mak92a]J.A.Makowsky.Databasetheory.InS.Abramsky,D.Gabbay,andT.Maibaum,editors,HandbookofLogicinComputerScience,volume5.OxfordUniversityPress,1992.[Mak92b]J.A.Makowsky.Modeltheoryandcomputerscience:Anappetizer.InS.Abramsky,D.Gabbay,andT.Maibaum,editors,HandbookofLogicinComputerScience,volume1,chapterI.6.OxfordUni-versityPress,1992.[MM84]B.MahrandJ.A.Makowsky.Characterizingspecicationlan-guageswhichadmitinitialsemantics.TheoreticalComputerSci-ence,31:49{60,1984.[MM85]J.A.MakowskyandD.Mundici.Abstractequivalencerelations.InModel-TheoreticLogics,PerspectivesinMathematicalLogic,chap-ter19.SpringerVerlag,1985.[Mos74]Y.Moschovakis.ElementaryInductiononAbstractStructures.StudiesinLogic,vol77.North{Holland,1974.[MS89]J.A.MakowskyandI.Sain.Weaksecondordercharacterizationsofvariousprogramvericationsystems.TheoreticalComputerSci-ence,66:299{321,1989.[MS92]T.MaibaumandM.Sadler.Axiomatizingspecicationtheory.InS.Abramsky,D.Gabbay,andT.Maibaum,editors,HandbookofLogicinComputerScience,volume2.OxfordUniversityPress,1992.[MV86]J.A.MakowskyandM.Vardi.Ontheexpressivepowerofdatadependencies.ActaInformatica,23.3:231{244,1986.[Pas90]A.Pasztor.Recursiveprogramsanddenotationalsemanticsinab-solutlogicsofprograms.TheoreticalComputerScience,70:127{150,1990.24[Gur91]Y.Gurevich.Averagecasecompleteness.JournalofComputerandSystemSciences,42:346{398,1991.[Har84]D.Harel.Dynamiclogic.InD.GabbayandF.Gunthner,editors,HandbookofPhilosophicalLogic,volume2,chapter10.D.ReidelPublishingCompany,1984.[HMSS85]L.A.Harrington,M.D.Morley,A.Scedrov,andS.G.Simpson,ed-itors.HarveyFriedman’sResearchintheFoundationsofMath-ematics,volume117ofStudiesinLogicandtheFoundationsofMathematics.NorthHolland,1985.[Hod92]W.Hodges.Logicalfeaturesofhornclauses.InD.Gabbayandal.,editors,HandbookofLogicinArticialIntelligenceandLogicProgramming.OxfordUniversityPress,1992.[Imm87]N.Immerman.Languagesthatcapturecomplexityclasses.SIAMJournalonComputing,16(4):760{778,Aug1987.AlsoappearedasapreliminaryreportinProceedingsofthe15thAnnualACMSymposiumontheTheoryofComputing.[Kan90]P.C.Kannelakis.Elementsofrelationaldatabasetheory.InJ.vanLeeuwen,editor,HandbookofTheoreticalComputerScience,vol-ume2,chapter17.ElsevierSciencePublishers,1990.[KK82]S.KochenandS.Kripke.Non{standardmodelsofPeanoarith-metic.InV.StrassenE.Engeler,H.Lauchli,editor,LogicandAlgorithmic,AninternationalSymposiumheldinhonourofE.Specker,pages275{296.L’enseignementmathematique,1982.[KM87]A.KanamoriandK.McAloon.OnGodelincompletenessandnitecombinatorics.AnnalsofPureandAppliedLogic,33:23{41,1987.[Kol90]P.G.Kolaitis.Implicitdenabilityonnitestructuresandunam-biguouscomputations.InFOCS’90,pages168{180.IEEE,1990.[KP82]L.KirbyandJ.Paris.AccessibleindependenceresultsforPeanoarithmetic.BulletinoftheLondonMathematicalSociety,14:285{293,1982.[Mak81]J.A.Makowsky.Characterizingdatabasedependencies.InICALP’81,volume115ofLectureNotesinComputerScience,pages86{97.SpringerVerlag,1981.[Mak84]J.A.Makowsky.Modeltheoreticissuesintheoreticalcomputerscience,partI:Relationaldatabasesandabstractdatatypes.InG.Lolliandal.,editors,LogicColloquium’82,StudiesinLogic,pages303{343.NorthHolland,1984.23[Cou90b]B.Courcelle.Themonadicsecond{ordertheoryofgraphsI:Recog-nizablesetsofnitegraphs