A three-valued quantified argument calculus: Domain-free model-theory, completeness, and embedding of fol

Review of Symbolic Logic 10 (3):549-582 (2017)
  Copy   BIBTEX

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.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,322

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

An Axiomatisation of a Pure Calculus of Names.Piotr Kulicki - 2012 - Studia Logica 100 (5):921-946.
Syntax and Semantics of the Logic.Carsten Butz - 1997 - Notre Dame Journal of Formal Logic 38 (3):374-384.
Partial and paraconsistent three-valued logics.Vincent Degauquier - 2016 - Logic and Logical Philosophy 25 (2):143-171.
Model theory and validity.Yannis Stephanou - 2000 - Synthese 123 (2):165-193.
Tableaus for many-valued modal logic.Melvin Fitting - 1995 - Studia Logica 55 (1):63 - 87.
A unified completeness theorem for quantified modal logics.Giovanna Corsi - 2002 - Journal of Symbolic Logic 67 (4):1483-1510.
Syntax and Semantics of the Logic $\mathcal{L}^\lambda_{\omega\omega}$.Carsten Butz - 1997 - Notre Dame Journal of Formal Logic 38 (3):374-384.
On Minimal Models for Pure Calculi of Names.Piotr Kulicki - 2013 - Logic and Logical Philosophy 22 (4):429–443.

Analytics

Added to PP
2018-02-09

Downloads
28 (#553,203)

6 months
8 (#352,434)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Ran Lanzet
Hebrew University of Jerusalem

References found in this work

On referring.Peter F. Strawson - 1950 - Mind 59 (235):320-344.
Generalized quantifiers and natural language.John Barwise & Robin Cooper - 1981 - Linguistics and Philosophy 4 (2):159--219.
Dynamic predicate logic.Jeroen Groenendijk & Martin Stokhof - 1991 - Linguistics and Philosophy 14 (1):39-100.
Generalized Quantifiers and Natural Language.Jon Barwise - 1980 - Linguistics and Philosophy 4:159.
Logics for the relational syllogistic.Ian Pratt-Hartmann & Lawrence S. Moss - 2009 - Review of Symbolic Logic 2 (4):647-683.

View all 13 references / Add more references