Abstract
Inspired by the grammar of natural language, the paper presents a variant of first-order logic, in which quantifiers are not sentential operators, but are used as subnectors (operators forming terms from formulas). A quantified term formed by a subnector is an argument of a predicate. The logic is defined by means of a meaning-conferring natural-deduction proof-system, according to the proof-theoretic semantics program. The harmony of the I/E-rules is shown. The paper then presents a translation, called the Frege translation, from the defined logic to standard first-order logic, and shows that the proof-theoretic meanings of both logics coincide. The paper criticizes Frege’s original regimentation of quantified sentences of natural language, and argues for advantages of the proposed variant.
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.
