This paper is dedicated to Alonzo Church, who died in August 1995 after a long life devoted to logic. To Church we owe lambda calculus, the thesis bearing his name and the solution to the Entscheidungsproblem.His well-known book Introduction to Mathematical LogicI, defined the subject matter of mathematical logic, the approach to be taken and the basic topics addressed. Church was the creator of the Journal of Symbolic Logicthe best-known journal of the area, which he edited for several decades This (...) paper is in three sections. The first is written in journalistic style:the story of the life of AlonzoChurch is told, including some of the many anecdotes I have collected from different sources. The secondpart is devoted to his work, but is far from being exhaustive. The last part is more original; in it I attempto show that Church’s great discovery was lambda calculus and that his remaining contributions weremainly inspired afterthoughts in the sense that most of his contributions as well as some of his pupils derivefrom that initial achievement. Included are Kleene’s Recursion Theory and the completeness proof ofHenkin. I have added an appendix in which is presented the typed lambda calculus and a proof of theundecidability of first-order logic. (shrink)

Frege’s project has been characterized as an attempt to formulate a complete system of logic adequate to characterize mathematical theories such as arithmetic and set theory. As such, it was seen to fail by Gödel’s incompleteness theorem of 1931. It is argued, however, that this is to impose a later interpretation on the word ‘complete’ it is clear from Dedekind’s writings that at least as good as interpretation of completeness is categoricity. Whereas few interesting first-order mathematical theories are categorical or (...) complete, there are logical extensions of these theories into second-order and by the addition of generalized quantifiers which are categorical. Frege’s project really found success through Gödel’s completeness theorem of 1930 and the subsequent development of first- and higher-order model theory. (shrink)

In a previous paper I described a range of nonmonotonic conditionals that behave like conditional probability functions at various levels of probabilistic support. These conditionals were defined as semantic relations on an object language for sentential logic. In this paper I extend the most prominent family of these conditionals to a language for predicate logic. My approach to quantifiers is closely related to Hartry Field's probabilistic semantics. Along the way I will show how Field's semantics differs from a substitutional interpretation (...) of quantifiers in crucial ways, and show that Field's approach is closely related to the usual objectual semantics. One of Field's quantifier rules, however, must be significantly modified to be adapted to nonmonotonic conditional semantics. And this modification suggests, in turn, an alternative quantifier rule for probabilistic semantics. (shrink)

It is well known that Tarski proved a result which can be stated roughly as: no sufficiently rich, consistent, classical language can contain its own truth definition. Tarski's way around this problem is to deal with two languages at a time, an object language for which we are defining truth and a metalanguage in which the definition occurs. An obvious question then is: under what conditions can we construct a definition of truth for a given object language. Tarski claims that (...) it is necessary and sufficient that the metalanguage be "essentially richer". Our contention, put bluntly, is that this claim deserves more scrutiny from philosophers than it usually gets and in fact is false unless "essentially richer" means nothing else than "sufficient to contain a truth definition for the object language.". (shrink)

We show how to obtain a probabilistic semantics and calculus for a logic presented by a valuation specification. By identifying general forms of valuation constraints we are able to accommodate a wide class of propositional based logics encompassing multi-valued logics like Łukasiewicz 3-valued logic and the Belnap–Dunn four-valued logic as well as paraconsistent logics like $${\textsf{mbC}}$$ and $${\textsf{LFI1}}$$. The probabilistic calculus is automatically generated from the valuation specification. Although not having explicit probability constructors in the language, the rules of the (...) calculus reflect the valuation constraints in a probabilistic way. Indeed the probability of the premises of each rule coincides with the probability of the conclusions. Moreover, a failed exhaustive attempt of proving a formula in this calculus means non-derivability. Nevertheless when the non-derived formula is consistent then it is possible to extract a satisfying valuation from the failed exhaustive attempt. Soundness and completeness of the calculi are established with respect to the probabilistic semantics consisting of probability spaces also induced by the valuation specification. Furthermore we prove the equivalence between the probabilistic and the valuation semantics. (shrink)

RésuméOn défend ici l'idée que la définition des notions sémantiques à l'aide des fonctions de probabilité devrait être vue non pas comme une généralisation de la sémantique standard en termes d'assignations de valeurs de vérité, mais plutôt comme une généralisation aux degrés de conséquence logique, de la caractérisation de la relation de conséquence que l'on retrouve dans le calcul des séquents de Gentzen.

John Corcoran’s natural deduction system for Aristotle’s syllogistic is reconsidered.Though Corcoran is no doubt right in interpreting Aristotle as viewing syllogisms as arguments and in rejecting Lukasiewicz’s treatment in terms of conditional sentences, it is argued that Corcoran is wrong in thinking that the only alternative is to construe Barbara and Celarent as deduction rules in a natural deduction system.An alternative is presented that is technically more elegant and equally compatible with the texts.The abstract role assigned by tradition and Lukasiewicz (...) to Barbara and Celarent is retained.The two ‘ perfect syllogisms’ serve as ‘basic elements’ in the construction of an inductively defined set of valid syllogisms.The proposal departs from Lukasiewicz, and follows Corcoran, however, in construing the construction as one in natural deduction.The result is a sequent system with fewer rules and in which Barbara and Celarent serve as basic deductions.To compare the theory to Corcoran’s, his original is reformulated in current terms and generalized.It is shown to be equivalent to the proposed sequent system, and several variations are discussed.For all systems mentioned, a method of Henkin‐style completeness proofs is given that is more direct and intuitive than Corcoran’s original. (shrink)

The language of the propositional calculus is extended by two families of propositional probability operators, inductively applicable to the formulae, and the set of all formulae provable in an arbitrary superintuitionistic propositional logic is extended by the probability measure axioms concerning those probability operators. A logical system obtained in such a way, similar to a kind of polymodal logic, makes possible to express a probability measure of truthfulness of any formula. The paper contains a description of the Kripke-type possible worlds (...) semantics covering the considered logical systems, being followed by the corresponding completeness results. (shrink)

Pensons aux divers énoncés qui peuvent être composés à partir d'un ensemble fini ou dénombrable d'énoncés atomiques à l'aide de, disons, ‘˜’ et ‘&’; soit A n'importe lequel de ces énoncés; et soit l'ensemble SA des composantes atomiques de A. La valeur de vérité de A dépend évidemment des valeurs de vérité de certains membres de SA. En effet, si aux valeurs de vérité Vrai et Faux sont substitués les entiers 1 et 0, respectivement; la valeur de vérité VVV d'une (...) négation ˜A est 1–VV; et la valeur de vérité VV d'une conjonction A & B est min, VV), alors la valeur de vérité de A s'avère être une fonction numérique des valeurs de vérité de certains membres de SA. Et les fonctions de valeurs de vérité sont dites, à titre de résultat, récursivement définissables. (shrink)

The logical independence of two statements is tantamount to their probabilistic independence, the latter understood in a sense that derives from stochastic independence. And analogous logical and probabilistic senses of having the same factual content similarly coincide. These results are extended to notions of non-symmetrical independence and independence among more than two statements.

A comparison is given between two conditions used to define logical constants: Belnap's uniqueness and Hacking's deducibility of identicals. It is shown that, in spite of some surface similarities, there is a deep difference between them. On the one hand, deducibility of identicals turns out to be a weaker and less demanding condition than uniqueness. On the other hand, deducibility of identicals is shown to be more faithful to the inferentialist perspective, permitting definition of genuinely proof-theoretical concepts. This kind of (...) analysis is driven by exploiting the Curry–Howard correspondence. In particular, deducibility of identicals is shown to correspond to the computational property of eta expansion, which is essential in the characterization of propositional identity. (shrink)

This paper is concerned with the use of logic to solve philosophical problems. Such use of logic goes counter to the prevailing empiricist tradition in analytic circles. Specifically, model-theoretic tools are applied to three fundamental issues in the philosophy of logic and mathematics, namely, to the issue of the existence of mathematical entities, to the dispute between first- and second-order logic and to the definition of analyticity.

Developing some suggestions of Ramsey (1925), elementary logic is formulated with respect to an arbitrary categorial system rather than the categorial system of Logical Atomism which is retained in standard elementary logic. Among the many types of non-standard categorial systems allowed by this formalism, it is argued that elementary logic with predicates of variable degree occupies a distinguished position, both for formal reasons and because of its potential value for application of formal logic to natural language and natural science. This (...) is illustrated by use of such a logic to construct a theory of quantity which is argued to be scientifically superior to existing theories of quantity based on standard categorial systems, since it yields real-valued scales without the need for unrealistic existence assumptions. This provides empirical evidence for the hypothesis that the categorial structure of the physical world itself is non-standard in this sense. (shrink)

This paper uses the framework of Popper and Miller's work on axiom systems for conditional probabilities to explore Adams' thesis concerning the probabilities of conditionals. It is shown that even very weak axiom systems have only a very restricted set of models satisfying a natural generalisation of Adams' thesis, thereby casting severe doubt on the possibility of developing a non-Boolean semantics for conditionals consistent with it.