Logical Methods in Computer Science

Logical Methods in Computer Science is a fully refereed, open access, free, electronic journal. It welcomes papers on theoretical and practical areas in computer science involving logical methods, taken in a broad sense; some particular areas within its scope are listed below. Papers are refereed in the traditional way, with two or more referees per paper. Copyright is retained by the author.Topics of Logical Methods in Computer Science:Algebraic methodsAutomata and logicAutomated deductionCategorical models and logicCoalgebraic methodsComputability and LogicComputer-aided verificationConcurrency theoryConstraint programmingCyber-physical systemsDatabase theoryDefeasible reasoningDomain theoryEmerging topics: Computational systems in biologyEmerging topics: Quantum computation and logicFinite model theoryFormalized mathematicsFunctional programming and lambda calculusInductive logic and learningInteractive proof checkingLogic and algorithmsLogic and complexityLogic and gamesLogic and probabilityLogic for knowledge representationLogic programmingLogics of programsModal and temporal logicsProgram analysis and type checkingProgram development and specificationProof complexityReal time and hybrid systemsReasoning about actions and planningSatisfiabilitySecuritySemantics of programming languagesTerm rewriting and equational logicType theory and constructive mathematics.