Advertisement

Formal Inference Systems

Part of the Progress in Computer Science and Applied Logic (PCS) book series (PCS, volume 25)

Abstract

In Chapter 2, we introduced the concept of logical consequence. We call a formula A a logical consequence of a formula set Γ if, in every model that satisfies Γ, A is also satisfied. The definition of logical consequence refers to the logical semantics of formulas. Essentially, it means that, however we interpret the terms in the formulas, the truth of A always follows the truth of Γ. This is consistent with our normal understanding of the concept of logical consequence.

Keywords

Inference System Logical Consequence Inference Rule Formal Proof Inference Tree 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Birkhäuser Verlag AG 2010

Authors and Affiliations

  • Wei Li
    • 1
  1. 1.State Key Laboratory of Software Development EnvironmentBeihang UniversityBeijingChina

Personalised recommendations