Processing math: 100%
Google
 
Web unafbapune.blogspot.com

Saturday, November 16, 2013

 

Domain Closure

Induction for finite languages is trivial. We simply use the Domain Closure rule of inference. For a language with object constants σ1,,σn,
  ϕ[σ1]ϕ[σn]ν.ϕ[ν]
If we believe a schema is true for every instance, then we can infer a universally quantified version of that schema.

More at Introduction to Logic.


Comments: Post a Comment

<< Home

This page is powered by Blogger. Isn't yours?