Abstract

The logical structures studied in this paper are generalizations of the propositional calculus. The classical propositional calculus is essentially Boolean algebra or, alternatively, the theory of functions on an arbitrary set S with values in a two-element set. The generalization consists in allowing partial functions on the set S, i.e., functions defined on certain subsets of S, and defining an equivalence relation among these functions such that any two constant functions with the same constant value belong to the same equivalence class. The generalization is equally natural for functions with values in the field of real numbers and we shall consider this case first.

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

Disclaimer: 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.