Skip to main content
×
Home
    • Aa
    • Aa

A THREE-VALUED QUANTIFIED ARGUMENT CALCULUS: DOMAIN-FREE MODEL-THEORY, COMPLETENESS, AND EMBEDDING OF FOL

  • RAN LANZET (a1)
Abstract
Abstract

This paper presents an extended version of the Quantified Argument Calculus (Quarc). Quarc is a logic comparable to the first-order predicate calculus. It employs several nonstandard syntactic and semantic devices, which bring it closer to natural language in several respects. Most notably, quantifiers in this logic are attached to one-place predicates; the resulting quantified constructions are then allowed to occupy the argument places of predicates. The version presented here is capable of straightforwardly translating natural-language sentences involving defining clauses. A three-valued, model-theoretic semantics for Quarc is presented. Interpretations in this semantics are not equipped with domains of quantification: they are just interpretation functions. This reflects the analysis of natural-language quantification on which Quarc is based. A proof system is presented, and a completeness result is obtained. The logic presented here is capable of straightforward translation of the classical first-order predicate calculus, the translation preserving truth values as well as entailment. The first-order predicate calculus and its devices of quantification can be seen as resulting from Quarc on certain semantic and syntactic restrictions, akin to simplifying assumptions. An analogous, straightforward translation of Quarc into the first-order predicate calculus is impossible.

Copyright
Corresponding author
*DEPARTMENT OF PHILOSOPHY TEL-AVIV UNIVERSITY P.O. BOX 39040 RAMAT AVIV, ISRAEL E-mail: lanzetr@gmail.com
Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

J. Barwise & R Cooper . (1981). Generalized quantifiers and natural language. Linguistics and Philosophy, 4(2), 159219.

H Ben-Yami . (2006). A critique of Frege on common nouns. Ratio, 19(2), 148155.

H Ben-Yami . (2014). The quantified argument calculus. The Review of Symbolic Logic, 7(01), 120146.

N Francez . (2014). A logic inspired by natural language quantifiers as subnectors. Journal of Philosophical Logic, 43(6), 11531172.

J. Groenendijk & M Stokhof . (1991). Dynamic predicate logic. Linguistics and Philosophy, 14(1), 39100.

J. T Kearns . (1979). The strong completeness of a system for Kleene’s three-valued logic. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 25(3–6), 6168.

L. S Moss . (2010). Logics for two fragments beyond the syllogistic boundary. In A. Blass , N. Dershowitz , and W. Reisig , editors. Fields of Logic and Computation: Essays Dedicated to Yuri Gurevich on the Occasion of his 70th Birthday. Berlin: Springer, pp. 538564.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

The Review of Symbolic Logic
  • ISSN: 1755-0203
  • EISSN: 1755-0211
  • URL: /core/journals/review-of-symbolic-logic
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Keywords:

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 16 *
Loading metrics...

Abstract views

Total abstract views: 172 *
Loading metrics...

* Views captured on Cambridge Core between 8th May 2017 - 23rd September 2017. This data will be updated every 24 hours.