The syntax of Frege's scientific language is commonly taken to be characterized by two oddities: the representation of the intended illocutionary role of sentences by a special sign, the judgement-stroke, and the treatment of sentences as a species of singular terms. In this paper, an alternative view is defended. The main theses are: the syntax of Frege's scientific language aims at an explication of the logical form of judgements; the judgement-stroke is, therefore, a truth-operator, not a pragmatic operator; in Frege's (...) first system, '⊦ Δ' expresses that the circumstance Δ is a fact, and in his second system that the truth-value - Δ is the True; in both systems, the judgement-stroke is construed as a sign sui generis, not as a genuine predicate; its counterpart in natural language is the syntactic "form of assertoric sentences", not the truth-predicate; neither in Frege's first nor in his second system sentences are treated as singular terms. (shrink)

Four progressively ambitious systems of modal propositional logic are set forth, together with decision procedures. The simultaneous employment of parenthesis notation and parenthesis-free notation, the dual use of symbols as primitive and defined, and the introduction of a new modal operator (the truth operator) are the principal devices used to effect the development of these logics. The first two logics turn out to be "the same" as two of von Wright's systems.

§1. Introduction. This paper deals with aspects of my doctoral dissertation which contributed to the early development of model theory. What was of use to later workers was less the results of my thesis, than the method by which I proved the completeness of first-order logic—a result established by Kurt Gödel in his doctoral thesis 18 years before.The ideas that fed my discovery of this proof were mostly those I found in the teachings and writings of Alonzo Church. This may (...) seem curious, as his work in logic, and his teaching, gave great emphasis to the constructive character of mathematical logic, while the model theory to which I contributed is filled with theorems about very large classes of mathematical structures, whose proofs often by-pass constructive methods.Another curious thing about my discovery of a new proof of Gödel's completeness theorem, is that it arrived in the midst of my efforts to prove an entirely different result. Such “accidental” discoveries arise in many parts of scientific work. Perhaps there are regularities in the conditions under which such “accidents” occur which would interest some historians, so I shall try to describe in some detail the accident which befell me.A mathematical discovery is an idea, or a complex of ideas, which have been found and set forth under certain circumstances. The process of discovery consists in selecting certain input ideas and somehow combining and transforming them to produce the new output ideas. The process that produces a particular discovery may thus be represented by a diagram such as one sees in many parts of science; a “black box” with lines coming in from the left to represent the input ideas, and lines going out to the right representing the output. To describe that discovery one must explain what occurs inside the box, i.e., how the outputs were obtained from the inputs. (shrink)

Mathematicians and physical scientists depend heavily on the formal symbolism of mathematics in order to express and develop their theories. For this and other reasons the last hundred years has seen a growing interest in the nature of formal language and the way it expresses meaning; particularly the objective, shared aspect of meaning as opposed to subjective, personal aspects. This dichotomy suggests the question: do the objective philosophical theories of meaning offer concepts which can be applied in psychological theories of (...) meaning? In recent years cognitive scientists such as Chomsky [1980], Fodor [1981] and MacNamara [1982] have used philosophical approaches to the meaning of formal language expressions as the basis for their psychological theories. Following this lead it seems appropriate to review some of the main treatments of meaning with a view to their transferability. (shrink)

Languages involving modalities and languages involving vagueness have each been thoroughly studied. On the other hand, virtually nothing has been said about the interaction of modality and vagueness. This paper aims to start filling that gap. Section 1 is a discussion of various possible sources of vague modality. Section 2 puts forward a model theory for a quantified language with operators for modality and vagueness. The model theory is followed by a discussion of the resulting logic. In Section 3, the (...) framework will permit us to address a puzzle raised by Elizabeth Barnes and Robert Williams. (shrink)

This article develops a critical investigation of the epistemological core of Hilbert's foundational project, the so-called the finitary attitude. The investigation proceeds by distinguishing different senses of 'number' and 'finitude' that have been used in the philosophical arguments. The usual notion of modern pure mathematics, i.e. the sense of number which is implicit in the notion of an arbitrary finite sequence and iteration is one sense of number and finitude. Another sense, of older origin, is connected with practices of counting (...) concrete things, and a third sense is linked up with the immediate intuitive experience of multitudes of concrete things. Hilbert's fìnitism is examined with respect to these differences, and it will be shown that there is a tendency to conflate the different senses of number and fìnitude, a tendency which has been a source of problems in the discussion of the foundations of mathematics and in the philosophy of logic and language. (shrink)

In this essay I will consider two theses that are associated with Frege,and will investigate the extent to which Frege really believed them.Much of what I have to say will come as no surprise to scholars of thehistorical Frege. But Frege is not only a historical figure; he alsooccupies a site on the philosophical landscape that has allowed hisdoctrines to seep into the subconscious water table. And scholars in a widevariety of different scholarly establishments then sip from thesedoctrines. I believe (...) that some Frege-interested philosophers at various ofthese establishments might find my conclusions surprising.Some of these philosophical establishments have arisen from an educationalmilieu in which Frege is associated with some specific doctrine at theexpense of not even being aware of other milieux where other specificdoctrines are given sole prominence. The two theses which I will discussillustrate this point. Each of them is called Frege''s Principle, but byphilosophers from different milieux. By calling them milieux I do not want to convey the idea that they are each located at some specificsocio-politico-geographico-temporal location. Rather, it is a matter oftheir each being located at different places on the intellectuallandscape. For this reason one might (and I sometimes will) call them(interpretative) traditions. (shrink)

The “somewhat vague, intuitive” notion from computability theory of an effective procedure (method) or algorithm can be fairly precisely defined even if it is not sufficiently formal and precise to belong to mathematics proper (in a narrow sense)—and even if (as many have asserted) for that reason the Church–Turing thesis is unprovable. It is proved logically that the class of effective procedures is not decidable, i.e., that no effective procedure is possible for ascertaining whether a given procedure is effective. This (...) undecidability result is proved directly from the notion itself of an effective procedure, without reliance on any (partly) mathematical lemma, conjecture, or thesis invoking recursiveness or Turing-computability. In fact, there is no reliance on anything very mathematical. The proof does not even appeal to a precise definition of ‘effective procedure’. Instead, it relies solely and entirely on a basic grasp of the intuitive notion of an effective procedure. Though the result that effectiveness is undecidable is not surprising, it is also not without significance. It has the consequence, for example, that the solution to a decision problem, if it is to be complete, must be accompanied by a separate argument that the proposed ascertainment procedure invariably terminates with the correct verdict. (shrink)

This is a non-technical version of "The Decision Problem for Effective Procedures." The “somewhat vague, intuitive” notion from computability theory of an effective procedure (method) or algorithm can be fairly precisely defined, even if it does not have a purely mathematical definition—and even if (as many have asserted) for that reason, the Church–Turing thesis (that the effectively calculable functions on natural numbers are exactly the general recursive functions), cannot be proved. However, it is logically provable from the notion of an (...) effective procedure--without reliance on any (partially) mathematical thesis or conjecture concerning effective procedures, such as the Church–Turing thesis--that the class of effective procedures is undecidable, i.e., that no effective procedure is possible for ascertaining whether a given procedure is effective. The proof does not appeal to a precise definition of ‘effective procedure’. Instead, it relies solely and entirely on a basic grasp of the intuitive notion of such a procedure. Though this undecidability result itself is not surprising, it is also not without significance. It has the consequence, for example, that the solution to a decision problem, if it is to be complete, must be accompanied by a separate argument that the proposed ascertainment procedure is, in fact, a decision procedure, i.e., effective—for example, that it invariably terminates with the correct verdict. (shrink)

Since Peirce defined the first operators for three-valued logic, it is usually assumed that he rejected the principle of bivalence. However, I argue that, because bivalence is a principle, the strategy used by Peirce to defend logical principles can be used to defend bivalence. Construing logic as the study of substitutions of equivalent representations, Peirce showed that some patterns of substitution get realized in the very act of questioning them. While I recognize that we can devise non-classical notations, I argue (...) that, when we make claims about those notations, we inevitably get saddled with bivalent commitments. I present several simple inferences to show this. The argument that results from those examples is ‘pragmatic’, because the inevitability of the principle is revealed in use (not mention); and it is ‘semiotic’, because this revelation happens in the use of signs. (shrink)

We present a plural logic that is as expressively strong as it can be without sacrificing axiomatisability, axiomatise it, and use it to chart the expressive limits set by axiomatisability. To the standard apparatus of quantification using singular variables our object-language adds plural variables, a predicate expressing inclusion (is/are/is one of/are among), and a plural definite description operator. Axiomatisability demands that plural variables only occur free, but they have a surprisingly important role. Plural description is not eliminable in favour of (...) quantification; on the contrary, quantification is definable in terms of it. Predicates and functors (function signs) can take plural as well as singular terms as arguments, and both many-valued and single-valued functions are expressible. The system accommodates collective as well as distributive predicates, and the condition for a predicate to be distributive is definable within it; similarly for functors. An essential part of the project is to demonstrate the soundness and completeness of the calculus with respect to a semantics that does without set-theoretic domains and in which the use of settheoretic extensions of predicates and functors is replaced by the sui generis relations and functions for which the extensions were at best artificial surrogates. Our metalanguage is designed to solve the difficulties involved in talking plurally about individuals and about the semantic values of plural items. (shrink)

This book provides a detailed exposition of one of the most practical and popular methods of proving theorems in logic, called Natural Deduction. It is presented both historically and systematically. Also some combinations with other known proof methods are explored. The initial part of the book deals with Classical Logic, whereas the rest is concerned with systems for several forms of Modal Logics, one of the most important branches of modern logic, which has wide applicability.

Is it possible for an argument to have either zero premises or an infinite number of premises? I shall argue that regardless of how you conceive of arguments you should accept that an argument could have an infinite number of premises. The zero case is more complicated since the matter seems to depend not only on the metaphysics of arguments, but also the nature and function of arguing. I shall argue that at least a plausible case can be made for (...) the possibility of zero premise arguments. (shrink)

The paper has two parts: First, I describe a relatively popular thesis in the philosophy of propositional attitudes, worthy of the name ‘taking tense seriously’; and I distinguish it from a family of views in the metaphysics of time, namely, the A-theories (or what are sometimes called ‘tensed theories of time’). Once the distinction is in focus, a skeptical worry arises. Some A-theorists maintain that the difference between past, present, and future, is to be drawn in terms of what exists: (...) growing-block theorists eschew ontological commitment to future entities; presentists, to future and past entities. Others think of themselves as A-theorists but exclude no past or future things from their ontology. The metaphysical skeptic suspects that their attempt to articulate an ‘eternalist’ version of the A-theory collapses into merely ‘taking tense seriously’– a thesis that does not imply the A-theory. The second half of the paper is the search for a stable eternalist A-theory. It includes discussion of temporary intrinsics, temporal parts, and truth. (shrink)

A partial solution to Ono’s problem P54 is given. Here Ono’s problem P54 is whether Harrop disjunction property is equivalent to disjunction property or not in intermediate predicate logics. As an application of this result it is shown that some intermediate predicate logics satisfy Harrop disjunction property.