Abstract
The nonmonotonic deduction relation in default reasoning is defined with fixed point style, which has the many-extension property that classical logic is not possessed of. These two kinds of deductions both have boolean definability property, that is, their extensions or deductive closures can be defined by boolean formulas. A generalized form of fixed point method is employed to define a class of deduction relations, which all have the above property. Theorems on definability and atomless boolean algebras in model theory are essential in dealing with this assertion.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
