Bulletin of the Section of Logic 38 (1/2):1-9 (2009)

Abstract
We can think of functional completeness in systems of propositional logic as a form of expressive completeness: while every logical constant in such system expresses a truth-function of finitely many arguments, functional completeness garantees that every truth-function of finitely many arguments can be expressed with the constants in the system. From this point of view, a functionnaly complete system of propositionnal logic can thus be seen as one where no logical constant is missing. Can a similar question be formulated for quantified first-order logics ? How to make sense of the question whether, e.g., ordinary first-order logic is "functionaly" complete or have no logical constant missing ? In this note, we build on a suggestive proposal made by Bonnay(2006) and shows that it is equivalent to the criterion that a first-order logic L be functionaly complete if and only if every class of structures closed under L-elementary equivalence is L-elementary. Ordinary first-order logic is not complete in this sense. We raise the question whether any logic can be.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 59,775
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

The Bounds of Logic: A Generalized Viewpoint.Gila Sher - 1994 - British Journal for the Philosophy of Science 45 (4):1078-1083.
Elementary Logic.[author unknown] - 1966 - Philosophical Quarterly 16 (65):400-401.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Topological Completeness for Higher-Order Logic.S. Awodey & C. Butz - 2000 - Journal of Symbolic Logic 65 (3):1168-1182.
Completeness and Categoricity: Frege, Gödel and Model Theory.Stephen Read - 1997 - History and Philosophy of Logic 18 (2):79-93.
Undecidability and Intuitionistic Incompleteness.D. C. McCarty - 1996 - Journal of Philosophical Logic 25 (5):559 - 565.
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.
Pure Second-Order Logic with Second-Order Identity.Alexander Paseau - 2010 - Notre Dame Journal of Formal Logic 51 (3):351-360.

Analytics

Added to PP index
2010-03-02

Total views
44 ( #235,514 of 2,432,668 )

Recent downloads (6 months)
1 ( #464,745 of 2,432,668 )

How can I increase my downloads?

Downloads

My notes