Bulletin of the Section of Logic 38 (1/2):1-9 (2009)
AbstractWe 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.
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.
Fibring Non-Truth-Functional Logics: Completeness Preservation.C. Caleiro, W. A. Carnielli, M. E. Coniglio, A. Sernadas & C. Sernadas - 2003 - Journal of Logic, Language and Information 12 (2):183-211.
On Canonicity and Strong Completeness Conditions in Intermediate Propositional Logics.Silvio Ghilardi & Pierangelo Miglioli - 1999 - Studia Logica 63 (3):353-385.
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.
A Note on the Completeness of Kozen's Axiomatisation of the Propositional Μ-Calculus.Igor Walukiewicz - 1996 - Bulletin of Symbolic Logic 2 (3):349-366.
Pure Second-Order Logic with Second-Order Identity.Alexander Paseau - 2010 - Notre Dame Journal of Formal Logic 51 (3):351-360.
Added to PP
Historical graph of downloads
Citations of this work
No citations found.
References found in this work
The Bounds of Logic: A Generalized Viewpoint.Gila Sher - 1994 - British Journal for the Philosophy of Science 45 (4):1078-1083.