Introduction to Languages, Machines and Logic

Computable Languages, Abstract Machines and Formal Logic

  • Alan P. Parkes

Table of contents

  1. Front Matter
    Pages i-xi
  2. Introduction

    1. Alan P. Parkes
      Pages 1-7
  3. Languages and Machines

    1. Front Matter
      Pages 9-9
    2. Alan P. Parkes
      Pages 11-36
    3. Alan P. Parkes
      Pages 37-47
    4. Alan P. Parkes
      Pages 133-159
  4. Machines and Computation

    1. Front Matter
      Pages 161-161
    2. Alan P. Parkes
      Pages 163-178
    3. Alan P. Parkes
      Pages 179-201
    4. Alan P. Parkes
      Pages 249-272
  5. Computation and Logic

    1. Front Matter
      Pages 273-273
    2. Alan P. Parkes
      Pages 275-290
    3. Alan P. Parkes
      Pages 291-306
    4. Alan P. Parkes
      Pages 307-326
  6. Back Matter
    Pages 327-351

About this book


1.1 Overview This chapter briefly describes: • what this book is about • what this book tries to do • what this book tries not to do • a useful feature of the book: the exercises. 1.2 What This Book Is About This book is about three key topics of computer science, namely computable lan­ guages, abstract machines, and logic. Computable languages are related to what are usually known as "formal lan­ guages". I avoid using the latter phrase here because later on in the book I distin­ guish between formal languages and computable languages. In fact, computable languages are a special type of formal languages that can be processed, in ways considered in this book, by computers, or rather abstract machines that represent computers. Abstract machines are formal computing devices that we use to investigate prop­ erties of real computing devices. The term that is sometimes used to describe abstract machines is automata, but that sounds too much like real machines, in particular the type of machines we call robots. The logic part of the book considers using different types of formal logic to represent things and reason about them. The logics we consider all play a very important role in computing. They are Boolean logic, propositional logic, and first order predicate logic (FOPL).


Automat algorithms automata complexity formal language formal logic logic predicate logic

Authors and affiliations

  • Alan P. Parkes
    • 1
  1. 1.Distributed Multimedia Research Group, Computing DepartmentLancaster UniversityLancaster

Bibliographic information