A completeness theorem for unrestricted first- order languages

In Jc Beall (ed.), Liars and Heaps: New Essays on Paradox. Oxford: Clarendon Press. pp. 331-356 (2003)
  Copy   BIBTEX

Abstract

Here is an account of logical consequence inspired by Bolzano and Tarski. Logical validity is a property of arguments. An argument is a pair of a set of interpreted sentences (the premises) and an interpreted sentence (the conclusion). Whether an argument is logically valid depends only on its logical form. The logical form of an argument is fixed by the syntax of its constituent sentences, the meanings of their logical constituents and the syntactic differences between their non-logical constituents, treated as variables. A constituent of a sentence is logical just if it is formal in meaning, in the sense roughly that its application is invariant under permutations of individuals.1 Thus ‘=’ is a logical constant because no permutation maps two individuals to one or one to two; ‘∈’ is not a logical constant because some permutations interchange the null set and its singleton. Truth functions, the usual quantifiers and bound variables also count as logical constants. An argument is logically valid if and only if the conclusion is true under every assignment of semantic values to variables (including all non-logical expressions) under which all its premises are true. A sentence is logically true if and only if the argument with no premises of which it is the conclusion is logically valid, that is, if and only if the sentence is true under every assignment of semantic values to variables. An interpretation assigns values to all variables.

Links

PhilArchive



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

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

Meaning theory for absolutely general languages.Eric Guindon - 2019 - Logique Et Analyse 248:379-414.
Two applications of Boolean models.Thierry Coquand - 1998 - Archive for Mathematical Logic 37 (3):143-147.
Infinitary propositional relevant languages with absurdity.Guillermo Badia - 2017 - Review of Symbolic Logic 10 (4):663-681.
A completeness theorem for continuous predicate modal logic.Stefano Baratella - 2019 - Archive for Mathematical Logic 58 (1-2):183-201.
First-order logic, second-order logic, and completeness.Marcus Rossberg - 2004 - In Vincent Hendricks, Fabian Neuhaus, Stig Andur Pedersen, Uwe Scheffler & Heinrich Wansing (eds.), First-Order Logic Revisited. Logos. pp. 303-321.

Analytics

Added to PP
2009-01-28

Downloads
128 (#142,338)

6 months
21 (#126,360)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Agustin Rayo
Massachusetts Institute of Technology

Citations of this work

Nominalist Realism.Nicholas K. Jones - 2018 - Noûs 52 (4):808-835.
Logic, Metalogic and Neutrality.Timothy Williamson - 2013 - Erkenntnis 79 (Suppl 2):211-231.
Unrestricted Quantification and the Structure of Type Theory.Salvatore Florio & Nicholas K. Jones - 2021 - Philosophy and Phenomenological Research 102 (1):44-64.
Beyond Plurals.Agust\’in Rayo - 2006 - In Agust\’in Rayo & Gabriel Uzquiano (eds.), Absolute Generality. Oxford University Press. pp. 220--54.
Engineering Existence?Lukas Skiba - forthcoming - Inquiry: An Interdisciplinary Journal of Philosophy.

View all 19 citations / Add more citations

References found in this work

No references found.

Add more references