Synthese 123 (2):247-261 (2000)
The purpose of this paper is threefold. First, I visit the Fogelin–Geach-dispute, criticizeMiller''s interpretation of the Geachian notationN(x:N(fx)) and conclude that Fogelin''s argumentagainst the expressive completeness of the Tractariansystem of logic is unacceptable and that the adoptionof the Geachian notation N(x:fx) would not violate TLP5.32. Second, I prove that a system of quantificationtheory with finite domains and with N as the solefundamental operation is expressively complete. Lastly, I argue that the Tractarian system is apredicate-eliminated many-sorted theory (withoutidentity) with finite domains and with N as the solefundamental operation, and thus is expressivelycomplete.
|Keywords||Philosophy Philosophy Epistemology Logic Metaphysics Philosophy of Language|
|Categories||categorize this paper)|
References found in this work BETA
No references found.
Citations of this work BETA
The Disenchantment of Nonsense: Understanding Wittgenstein's Tractatus.Leo K. C. Cheung - 2008 - Philosophical Investigations 31 (3):197–226.
The Unity of Language and Logic in Wittgenstein's Tractatus.Leo K. C. Cheung - 2006 - Philosophical Investigations 29 (1):22–50.
Similar books and articles
First Order Quantifiers in Monadic Second Order Logic.H. Jerome Keisler & Wafik Boulos Lotfallah - 2004 - Journal of Symbolic Logic 69 (1):118-136.
Tractarian Semantics for Predicate Logic.Hugh Miller - 1995 - History and Philosophy of Logic 16 (2):197-215.
Finite H-Dimension Does Not Imply Expressive Completeness.Ian Hodkinson - 1994 - Journal of Philosophical Logic 23 (5):535 - 573.
The Lattice of Strengthenings of a Strongly Finite Consequence Operation.Wiesław Dziobiak - 1981 - Studia Logica 40 (2):177 - 193.
On the Completeness of a Certain System of Arithmetic of Whole Numbers in Which Addition Occurs as the Only Operation.Mojżesz Presburger & Dale Jabcquette - 1991 - History and Philosophy of Logic 12 (2):225-233.
A Note on Generalized Functional Completeness in the Realm of Elementrary Logic.Henri Galinon - 2009 - Bulletin of the Section of Logic 38 (1):1-9.
Achieving Expressive Completeness and Computational Efficiency for Underspecified Scope Representations.Chris Fox & Shalom Lappin - unknown
Added to index2009-01-28
Total downloads52 ( #101,115 of 2,172,660 )
Recent downloads (6 months)2 ( #172,670 of 2,172,660 )
How can I increase my downloads?