Abstract
The rules of inductive inference are formalized using a transition rules. The rejection of a consequence obtained by inductive inference is formalized by a revision rule. An inductive process is defined as a sequence of versions of a theory generated by alternatively applying the inductive inference rules and the revision rule. An inductive procedure scheme is constructed. It takes a sequence ƐM of instances of a given model M and a given formal theory Γ as its inputs, and generates the inductive processes. It is proved that if ƐM contains all instances of the model M, then every inductive sequence generated by the procedure scheme is convergent. Its limit is the set of all true statements of the model M.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
