In arithmetic, if only because many of its methods and concepts originated in India, it has been the tradition to reason less strictly than in geometry, ...

In this manuscript, published here for the first time, Tarski explores the concept of logical notion. He draws on Klein's Erlanger Programm to locate the logical notions of ordinary geometry as those invariant under all transformations of space. Generalizing, he explicates the concept of logical notion of an arbitrary discipline.

Quantification is a topic which brings together linguistics, logic, and philosophy. Quantifiers are the essential tools with which, in language or logic, we refer to quantity of things or amount of stuff. In English they include such expressions as no, some, all, both, many. Peters and Westerstahl present the definitive interdisciplinary exploration of how they work - their syntax, semantics, and inferential role.

The Bounds of Logic presents a new philosophical theory of the scope and nature of logic based on critical analysis of the principles underlying modern Tarskian logic and inspired by mathematical and linguistic development. Extracting central philosophical ideas from Tarski’s early work in semantics, Sher questions whether these are fully realized by the standard first-order system. The answer lays the foundation for a new, broader conception of logic. By generally characterizing logical terms, Sher establishes a fundamental result in semantics. Her (...) development of the notion of logicality for quantifiers and her work on branching are of great importance for linguistics. Sher outlines the boundaries of the new logic and points out some of the philosophical ramifications of the new view of logic for such issues as the logicist thesis, ontological commitment, the role of mathematics in logic, and the metaphysical underpinning of logic. She proposes a constructive definition of logical terms, reexamines and extends the notion of branching quantification, and discusses various linguistic issues and applications. (shrink)

Contents: Preface VII; Introduction 1; 1. The General Framework 5; 2. Some Standard Systems 61; 3. Systems in General 147; 4. Non-Standard Systems 177; Bibliography 210; General Index 215; Index of Symbols 219-220.

Kit Fine develops a Fregean theory of abstraction, and suggests that it may yield a new philosophical foundation for mathematics, one that can account for both our reference to various mathematical objects and our knowledge of various mathematical truths. The Limits ofion breaks new ground both technically and philosophically.

Two fundamental rules of reasoning are Universal Generalisation and Existential Instantiation. Applications of these rules involve stipulations such as ‘Let n be an arbitrary number’ or ‘Let John be an arbitrary Frenchman’. Yet the semantics underlying such stipulations are far from clear. What, for example, does ‘n’ refer to following the stipulation that n be an arbitrary number? In this paper, we argue that ‘n’ refers to a number—an ordinary, particular number such as 58 or 2,345,043. Which one? We do (...) not and cannot know, because the reference of ‘n’ is fixed arbitrarily. Underlying this proposal is a more general thesis: Arbitrary Reference : It is possible to fix the reference of an expression arbitrarily. When we do so, the expression receives its ordinary kind of semantic-value, though we do not and cannot know which value in particular it receives. Our aim in this paper is defend AR. In particular, we argue that AR can be used to provide an account of instantial reasoning, and we suggest that AR can also figure in offering new solutions to a range of difficult philosophical puzzles. (shrink)

Completed in 1983, this work culminates nearly half a century of the late Alfred Tarski's foundational studies in logic, mathematics, and the philosophy of science. Written in collaboration with Steven Givant, the book appeals to a very broad audience, and requires only a familiarity with first-order logic. It is of great interest to logicians and mathematicians interested in the foundations of mathematics, but also to philosophers interested in logic, semantics, algebraic logic, or the methodology of the deductive sciences, and to (...) computer scientists interested in developing very simple computer languages rich enough for mathematical and scientific applications. The authors show that set theory and number theory can be developed within the framework of a new, different, and simple equational formalism, closely related to the formalism of the theory of relation algebras. There are no variables, quantifiers, or sentential connectives. Predicates are constructed from two atomic binary predicates (which denote the relations of identity and set-theoretic membership) by repeated applications of four operators that are analogues of the well-known operations of relative product, conversion, Boolean addition, and complementation. All mathematical statements are expressed as equations between predicates. There are ten logical axiom schemata and just one rule of inference: the one of replacing equals by equals, familiar from high school algebra. Though such a simple formalism may appear limited in its powers of expression and proof, this book proves quite the opposite. The authors show that it provides a framework for the formalization of practically all known systems of set theory, and hence for the development of all classical mathematics. The book contains numerous applications of the main results to diverse areas of foundational research: propositional logic; semantics; first-order logics with finitely many variables; definability and axiomatizability questions in set theory, Peano arithmetic, and real number theory; representation and decision problems in the theory of relation algebras; and decision problems in equational logic. (shrink)

The formal semantics that we have proposed for definite and indefinite descriptions analyzes them both as variable-binding operators and as referring terms. It is the referential analysis which makes it possible to account for the facts outlined in Section 2, e.g. for the purely ‘instrumental’ role of the descriptive content; for the appearance of unusually wide scope readings relative to other quantifiers, higher predicates, and island boundaries; for the fact that the island-escaping readings are always equivalent to maximally wide scope (...) quantifiers; and for the appearance of violations of the identity conditions on variables in deleted constituents. We would emphasize that this is not a random collection of observations. They cohere naturally with each other, and with facts about other phrases that are unambigously referential.We conceded at the outset of this paper that the referential use of an indefinite noun phrase does not, by itself, motivate the postulation of a referential interpretation. Our argument has been that the behavior of indefinites in complex sentences cannot be economically described, and certainly cannot be explained, unless a referential interpretation is assumed. It could be accounted for in pragmatic terms only if the whole theory of scope relations and of conditions on deletion could be eliminated from the semantics and incorporated into a purely pragmatic theory. But this seems unlikely. (shrink)

What is a logical constant? The question is addressed in the tradition of Tarski's definition of logical operations as operations which are invariant under permutation. The paper introduces a general setting in which invariance criteria for logical operations can be compared and argues for invariance under potential isomorphism as the most natural characterization of logical operations.

Tarski and Mautner proposed to characterize the "logical" operations on a given domain as those invariant under arbitrary permutations. These operations are the ones that can be obtained as combinations of the operations on the following list: identity; substitution of variables; negation; finite or infinite disjunction; and existential quantification with respect to a finite or infinite block of variables. Inasmuch as every operation on this list is intuitively "logical", this lends support to the Tarski-Mautner proposal.

The paper investigates the scope properties of indefinites.

The paper starts with an examination and critique of Tarski’s wellknown proposed explication of the notion of logical operation in the type structure over a given domain of individuals as one which is invariant with respect to arbitrary permutations of the domain. The class of such operations has been characterized by McGee as exactly those definable in the language L∞,∞. Also characterized similarly is a natural generalization of Tarski’s thesis, due to Sher, in terms of bijections between domains. My main (...) objections are that on the one hand, the Tarski-Sher thesis thus assimilates logic to mathematics, and on the other hand fails to explain the notion of same logical operation across domains of different sizes. A new notion of homomorphism invariant operation over functional type structures (with domains M0 of individuals and {T, F} at their base) is introduced to accomplish the latter. The main result is that an operation is definable from.. (shrink)

In the first section, I consider what several logicians say informally about the notion of logical consequence. There is significant variation among these accounts, they are sometimes poorly explained, and some of them are clearly at odds with the usual technical definition. In the second section, I first argue that a certain kind of informal account—one that includes elements of necessity, generality, and apriority—is approximately correct. Next I refine this account and consider several important questions about it, including the appropriate (...) characterization of necessity, the criterion for selecting logical constants, and the exact role of apriority. I argue, among other things, that there is no need to recognize a special logical sense of necessity and that the selection of terms to serve as logical constants is ultimately a pragmatic matter. In the third section, I consider whether the informal account I have presented and defended is adequately represented by the usual technical definition. I show that it is, and provably so, for certain limited ways of selecting logical constants. In the general case, however, there seems to be no way to be sure that the technical and informal accounts coincide. (shrink)

A co-authored article with Roy T. Cook forthcoming in a special edition on the Caesar Problem of the journal Dialectica. We argue against the appeal to equivalence classes in resolving the Caesar Problem.

The logical status of abstraction principles, and especially Hume’s Principle, has been long debated, but the best currently availeble tool for explicating a notion’s logical character—permutation invariance—has not received a lot of attention in this debate. This paper aims to fill this gap. After characterizing abstraction principles as particular mappings from the subsets of a domain into that domain and exploring some of their properties, the paper introduces several distinct notions of permutation invariance for such principles, assessing the philosophical significance (...) of each. (shrink)

In this article I describe and evaluate the debate that surrounds the proper interpretation of Tarski’s account of logical consequence given in his classic 1936 article ‘On the concept of logical consequence’. In the late 1980s Etchemendy argued that the familiar model theoretic account of logical consequence is not to be found in Tarski’s original article. Whereas the contemporary account of logical consequence is a variable‐domain conception – in that it calls for a reinterpretation of the domain of variation of (...) the quantifiers when evaluating logical consequence –, no such reinterpretation is found in Tarski’s original account, which was rather based on a ‘fixed‐domain’ conception. Etchemendy’s claims have sparked a debate on Tarski’s conception of logical consequence with important contributions by, among others, Bach, Bays, Corcoran, Gómez‐Torrente, Mancosu, Ray, Sagüillo, and Sher. (shrink)

Chapin reviewed this 1972 ZEITSCHRIFT paper that proves the completeness theorem for the logic of variable-binding-term operators created by Corcoran and his student John Herring in the 1971 LOGIQUE ET ANALYSE paper in which the theorem was conjectured. This leveraging proof extends completeness of ordinary first-order logic to the extension with vbtos. Newton da Costa independently proved the same theorem about the same time using a Henkin-type proof. This 1972 paper builds on the 1971 “Notes on a Semantic Analysis of (...) Variable Binding Term Operators” (Co-author John Herring), Logique et Analyse 55, 646–57. MR0307874 (46 #6989). A variable binding term operator (vbto) is a non-logical constant, say v, which combines with a variable y and a formula F containing y free to form a term (vy:F) whose free variables are exact ly those of F, excluding y. Kalish-Montague 1964 proposed using vbtos to formalize definite descriptions “the x: x+x=2”, set abstracts {x: F}, minimization in recursive function theory “the least x: x+x>2”, etc. However, they gave no semantics for vbtos. Hatcher 1968 gave a semantics but one that has flaws described in the 1971 paper and admitted by Hatcher. In 1971 we give a correct semantic analysis of vbtos. We also give axioms for using them in deductions. And we conjecture strong completeness for the deductions with respect to the semantics. The conjecture, proved in this paper with Hatcher’s help, was proved independently about the same time by Newton da Costa. (shrink)

Logic is formal in the sense that all arguments of the same form as logically valid arguments are also logically valid and hence truth-preserving. However, it is not known whether all arguments that are valid in the usual model-theoretic sense are truthpreserving. Tarski claimed that it could be proved that all arguments that are valid (in the sense of validity he contemplated in his 1936 paper on logical consequence) are truthpreserving. But he did not offer the proof. The question arises (...) whether the usual modeltheoretic sense of validity and Tarski's 1936 sense are the same. I argue in this paper that they probably are not, and that the proof Tarski had in mind, although unusable to prove that model-theoretically valid arguments are truth-preserving, can be used to prove that arguments valid in Tarski's 1936 sense are truth-preserving. (shrink)