The goal of this paper is to present a new reconstruction of Aristotle's assertoric logic as he develops it in Prior Analytics, A1-7. This reconstruction will be much closer to Aristotle's original...

I develop a formal logic in which quantified arguments occur in argument positions of predicates. This logic also incorporates negative predication, anaphora and converse relation terms, namely, additional syntactic features of natural language. In these and additional respects, it represents the logic of natural language more adequately than does any version of Frege’s Predicate Calculus. I first introduce the system’s main ideas and familiarize it by means of translations of natural language sentences. I then develop a formal system built on (...) these principles, the Quantified Argument Calculus or Quarc. I provide a truth-value assignment semantics and a proof system for the Quarc. I next demonstrate the system’s power by a variety of proofs; I prove its soundness; and I comment on its completeness. I then extend the system to modal logic, again providing a proof system and a truth-value assignment semantics. I proceed to show how the Quarc versions of the Barcan formulas, of their converses and of necessary existence come out straightforwardly invalid, which I argue is an advantage of the modal Quarc over modal Predicate Logic as a system intended to capture the logic of natural language. (shrink)

The formalisation of Natural Language arguments in a formal language close to it in syntax has been a central aim of Moss’s Natural Logic. I examine how the Quantified Argument Calculus (Quarc) can handle the inferences Moss has considered. I show that they can be incorporated in existing versions of Quarc or in straightforward extensions of it, all within sound and complete systems. Moreover, Quarc is closer in some respects to Natural Language than are Moss’s systems – for instance, is (...) does not use negative nouns. The process also sheds light on formal properties and presuppositions of some inferences it formalises. Directions for future work are outlined. (shrink)

In a series of publications I have claimed that by contrast to standard formal languages, quantifiers in natural language combine with a general term to form a quantified argument, in which the general term's role is to determine the domain or plurality over which the quantifier ranges. In a recent paper Zoltán Gendler Szabó tried to provide a counterexample to this analysis and derived from it various conclusions concerning quantification in natural language, claiming it is often ‘bare’. I show that (...) Szabó's example fails, and that even if it were successful his conclusions would not be supported by it. (shrink)

The currently standard philosophical conception of existence makes a connection between three things: certain ways of talking about existence and being in natural language; certain natural language idioms of quantification; and the formal representation of these in logical languages. Thus a claim like ‘Prime numbers exist’ is treated as equivalent to ‘There is at least one prime number’ and this is in turn equivalent to ‘Some thing is a prime number’. The verb ‘exist’, the verb phrase ‘there is’ and the (...) quantifier ‘some’ are treated as all playing similar roles, and these roles are made explicit in the standard common formalization of all three sentences by a single formula of first-order logic: ‘(∃ x )[P( x ) & N( x )]’, where ‘P( x )’ abbreviates ‘ x is prime’ and ‘N( x )’ abbreviates ‘ x is a number’. The logical quantifier ‘∃’ accordingly symbolizes in context the role played by the English words ‘exists’, ‘some’ and ‘there is’. (shrink)