Abstract
It is well known that negation can be defined by postulating a fixed proposition F and specifying thatwhere “≡” indicates identity by definition. I propose to discuss this way of introducing negation in relation to the inferential systems of my Notre Dame lectures of 1948. Acquaintance with these lectures is presupposed; they will be referred to as TFD. The definition (1) was used there, essentially, in connection with the T-systems; but it was not used in connection with the L-systems because of a certain difficulty which I was not able to overcome at that time. This paper contains proofs of results concerning L-systems which have been announced elsewhere.
Sign-in/Register to access full text options 
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 callSimilar Papers
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.
