Formal Languages and Formal Logic

  • Howard Straubing
Part of the Progress in Theoretical Computer Science book series (PTCS)


Throughout this book we use sentences of formal logic to describe properties of words over a finite alphabet A. A sentence will thus define a language \(L \subseteq A^{*}\); L is the set of all words that have the property described by the sentence.


Formal Language Free Variable Atomic Formula Predicate Symbol Numerical Relation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 1994

Authors and Affiliations

  • Howard Straubing
    • 1
  1. 1.Computer Science DepartmentBoston CollegeChestnut HillUSA

Personalised recommendations