In this paper, I defend the thesis that alleffects of extra-linguistic context on thetruth-conditions of an assertion are traceable toelements in the actual syntactic structure of thesentence uttered. In the first section, I develop thethesis in detail, and discuss its implications for therelation between semantics and pragmatics. The nexttwo sections are devoted to apparent counterexamples.In the second section, I argue that there are noconvincing examples of true non-sentential assertions.In the third section, I argue that there are noconvincing examples of what (...) John Perry has called`unarticulated constituents''. I conclude by drawingsome consequences of my arguments for appeals tocontext-dependence in the resolution of problems inepistemology and philosophical logic. (shrink)

This comprehensive monograph is a cornerstone in the area of mathematical logic and related fields. Focusing on Gentzen-type proof theory, the book presents a detailed overview of creative works by the author and other 20th-century logicians that includes applications of proof theory to logic as well as other areas of mathematics. 1975 edition.

We investigate a rst-order predicate logic based on Wittgenstein's suggestion to express identity of object by identity of sign, and difference of objects by difference of signs. Hintikka has shown that predicate logic can indeed be set up in such a way; we show that it can be done nicely. More specically, we provide a perspicuous cut-free sequent calculus, as well as a Hilbert-type calculus, for Wittgensteinian predicate logic and prove soundness and completeness theorems.

Urn models were developed by Veikko Rantala to provide a non-standard semantics for first-order logic in which the domains, over which the quantifiers range, are allowed to vary. Rantala uses game-theoretical semantics in his presentation, and the present paper is a study of urn models from a more classical, truth-conditional point of view. An axiomatic system for urn logic is set out and completeness is proved by the method of maximal consistent sets.