Online research in philosophy

Illative combinatory logic consists of the theory of combinators or lambda calculus extended by extra constants (and corresponding axioms and rules) intended to capture inference. The paper considers systems of illative combinatory logic that are sound for first-order propositional and predicate calculus. The interpretation from ordinary logic into the illative systems can be done in two ways: following the propositions-as-types paradigm, in which derivations become combinators or, in a more direct way, in which derivations are not translated. (...) Both translations are closely related in a canonical way. The two direct translations turn out to be complete. The paper fulfills the program of Church [1932], [1933] and Curry [1930] to base logic on a consistent system of λ-terms or combinators. Hitherto this program had failed because systems of ICL were either too weak (to provide a sound interpretation) or too strong (sometimes even inconsistent). (shrink)

Two subject-predicate calculi with equality,SP = and its extensionUSP =, are presented as systems of natural deduction. Both the calculi are systems of free logic. Their presentation is preceded by an intuitive motivation.It is shown that Aristotle's syllogistics without the laws of identitySaP andSiP is definable withinSP =, and that the first-order predicate logic is definable withinUSP =.

The syllogism and the predicate calculus cannot account for an ontological argument in Descartes' Fifth Meditation and related texts. Descartes' notion of god relies on the analytic-synthetic distinction, which Descartes had identified before Leibniz and Kant did. I describe how the syllogism and the predicate calculus cannot explain Descartes' ontological argument; then I apply the analytic-synthetic distinction to Descartes’ idea of god.

We introduce a substructural propositional calculus of Sequential Dynamic Logic that subsumes a propositional part of dynamic predicate logic, and is shown to be expressively equivalent to propositional dynamic logic. Completeness of the calculus with respect to the intended relational semantics is established.

Combinatory logic and lambda-conversion were originally devised in the 1920s for investigating the foundations of mathematics using the basic concept of 'operation' instead of 'set'. They have now developed into linguistic tools, useful in several branches of logic and computer science, especially in the study of programming languages. These notes form a simple introduction to the two topics, suitable for a reader who has no previous knowledge of combinatory logic, but has taken an undergraduate course in predicate calculus (...) and recursive functions. The key ideas and basic results are presented, as well as a number of more specialised topics, and man), exercises are included to provide manipulative practice. (shrink)

This book asks not only how the study of white-collar crime can enrich our understanding of crime and justice more generally, but also how criminological ...

This text is a short introduction to logic that was primarily used for accompanying an introductory course in Logic for Linguists held at the New University of Lisbon (UNL) in fall 2010. The main idea of this course was to give students the formal background and skills in order to later assess literature in logic, semantics, and related fields and perhaps even use logic on their own for the purpose of doing truth-conditional semantics. This course in logic does not replace (...) a proper introduction to semantics and is not intended as such, although parts of Chapter 1 and 4 could be used to supplement an introductory course in semantics. In contrast to other introductions it has a certain focus on ‘writing things down correctly.’ Proofs of metatheorems are omitted, though. -/- This is work in progress. Please send suggestions and corrigenda to erich@snafu.de. Have fun! (shrink)

This is part two of a complete exposition of Logic, in which there is a radically new synthesis of Aristotelian-Scholastic Logic with modern Logic. Part II is the presentation of the theory of propositions. Simple, composite, atomic, compound, modal, and tensed propositions are all examined. Valid consequences and propositional logical identities are rigorously proven. Modal logic is rigorously defined and proven. This is the first work of Logic known to unite Aristotelian logic and modern logic using scholastic logic as the (...) instrument. (shrink)

This paper presents a sound and complete proof system for the first order fragment of Discourse Representation Theory. Since the inferences that human language users draw from the verbal input they receive for the most transcend the capacities of such a system, it can be no more than a basis on which more powerful systems, which are capable of producing those inferences, may then be built. Nevertheless, even within the general setting of first order logic the structure of the (...) formulas of DRS-languages, i.e. of the Discourse Representation Structures suggest for the components of such a system inference rules that differ somewhat from those usually found in proof systems for the first order predicate calculus and which are, we believe, more in keeping with inference patterns that are actually employed in common sense reasoning.This is why we have decided to publish the present exercise, in spite of the fact that it is not one for which a great deal of originality could be claimed. In fact, it could be argued that the problem addressed in this paper was solved when Gödel first established the completeness of the system of Principia Mathematica for first order logic. For the DRS-languages we consider here are straightforwardly intertranslatable with standard formulations of the predicate calculus; in fact the translations are so straightforward that any sound and complete proof system for first order logic can be used as a sound and complete proof system for DRSs: simply translate the DRSs into formulas of predicate logic and then proceed as usual. As a matter of fact, this is how one has chosen to proceed in some implementations of DRT, which involve inferencing as well as semantic representation; an example is the Lex system developed jointly by IBM and the University of Tübingen (see in particular (Guenthner et al. 1986)). (shrink)

The modal object calculus is the system of logic which houses the (proper) axiomatic theory of abstract objects. The calculus has some rather interesting features in and of itself, independent of the proper theory. The most sophisticated, type-theoretic incarnation of the calculus can be used to analyze the intensional contexts of natural language and so constitutes an intensional logic. However, the simpler second-order version of the calculus couches a theory of fine-grained properties, relations and propositions and (...) serves as a framework for defining situations, possible worlds, stories, and fictional characters, among other things. In the present paper, we focus on the second-order calculus. The second-order modal object calculus is so-called to distinguish it from the second-order modal predicate calculus. Though the differences are slight, the extra expressive power of the object calculus significantly enhances its ability to resolve logical and philosophical concepts and problems. (shrink)

It is a little understood fact that the system of formal logic presented in Wittgenstein?s Tractatusprovides the basis for an alternative general semantics for a predicate calculus that is consistent and coherent, essentially independent of the metaphysics of logical atomism, and philosophically illuminating in its own right. The purpose of this paper is threefold: to describe the general characteristics of a Tractarian-style semantics, to defend the Tractatus system against the charge of expressive incompleteness as levelled by Robert Fogelin, (...) and to give a semantics for a formal language that is the Tractarian equivalent of a first-order predicate calculus. Of note in regard to the latter is the fact that a Tractatusstyle truth-definition makes no appeal to the technical trick of defining truth in terms of the satisfaction of predicates by infinite sequences of objects, yet is materially equivalent to the usual Tarski-style truth-definitions. (shrink)

Theabstract variable binding calculus (VB-calculus) provides a formal frame-work encompassing such diverse variable-binding phenomena as lambda abstraction, Riemann integration, existential and universal quantification (in both classical and nonclassical logic), and various notions of generalized quantification that have been studied in abstract model theory. All axioms of the VB-calculus are in the form of equations, but like the lambda calculus it is not a true equational theory since substitution of terms for variables is restricted. A similar problem (...) with the standard formalism of the first-order predicate logic led to the development of the theory of cylindric and polyadic Boolean algebras. We take the same course here and introduce the variety of polyadic VB-algebras as a pure equational form of the VB-calculus. In one of the main results of the paper we show that every locally finite polyadic VB-algebra of infinite dimension is isomorphic to a functional polyadic VB-algebra that is obtained from a model of the VB-calculus by a natural coordinatization process. This theorem is a generalization of the functional representation theorem for polyadic Boolean algebras given by P. Halmos. As an application of this theorem we present a strong completeness theorem for the VB-calculus. More precisely, we prove that, for every VB-theory T that is obtained by adjoining new equations to the axioms of the VB-calculus, there exists a model D such that T s=t iff D s=t. This result specializes to a completeness theorem for a number of familiar systems that can be formalized as VB-calculi. For example, the lambda calculus, the classical first-order predicate calculus, the theory of the generalized quantifierexists uncountably many and a fragment of Riemann integration. (shrink)

LetEO be the elementary ontology of Leniewski formalized as in Iwanu [1], and letLS be the monadic second-order calculus of predicates. In this paper we give an example of a recursive function , defined on the formulas of the language ofEO with values in the set of formulas of the language of LS, such that EO A iff LS (A) for each formulaA.

The Kripke-completeness and incompleteness of some intermediate predicate logics is established. In particular, we obtain a Kripke-incomplete logic (H* +A+D+K) where H* is the intuitionistic predicate calculus, A is a disjunction-free propositional formula, D = x(P(x) V Q) xP(x) V Q, K = ¬¬x(P(x) V ¬P(x)) (the negative answer to a question of T. Shimura).

A new reduction class is presented for the satisfiability problem for well-formed formulas of the first-order predicate calculus. The members of this class are closed prenex formulas of the form ∀ x∀ yC. The matrix C is in conjunctive normal form and has no disjuncts with more than three literals, in fact all but one conjunct is unary. Furthermore C contains but one predicate symbol, that being unary, and one function symbol which symbol is binary.

There is given the proof of strict embedding of Leniewski's elementary ontology into monadic second-order calculus of predicates providing a formalization of the class of all formulas valid in all domains (including the empty one). The elementary ontology with the axiom S (S S) is strictly embeddable into monadic second-order calculus of predicates which provides a formalization of the classes of all formulas valid in all non-empty domains.

The Fluent Calculus belongs to the established predicate calculus formalisms for reasoning about actions. Its underlying concept of state update axioms provides a solution to the basic representational and inferential Frame Problems in pure first-order logic. Extending a recent research result, we present a Fluent Calculus to reason about domains involving continuous change and where actions occur concurrently.

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.

We introduce Gentzen calculi for intuitionistic logic extended with an existence predicate. Such a logic was first introduced by Dana Scott, who provided a proof system for it in Hilbert style. We prove that the Gentzen calculus has cut elimination in so far that all cuts can be restricted to very simple ones. Applications of this logic to Skolemization, truth value logics and linear frames are also discussed.

Hilbert's ε-calculus is based on an extension of the language of predicate logic by a term-forming operator ex. Two fundamental results about the ε-calculus, the first and second epsilon theorem, play a rôle similar to that which the cut-elimination theorem plays in sequent calculus. In particular, Herbrand's Theorem is a consequence of the epsilon theorems. The paper investigates the epsilon theorems and the complexity of the elimination procedure underlying their proof, as well as the length of (...) Herbrand disjunctions of existential theorems obtained by this elimination procedure. (shrink)

The epsilon calculus is a logical formalism developed by David Hilbert in the service of his program in the foundations of mathematics. The epsilon operator is a term-forming operator which replaces quantifiers in ordinary predicate logic. Specifically, in the calculus, a term..

Deep inference is a natural generalisation of the one-sided sequent calculus where rules are allowed to apply deeply inside formulas, much like rewrite rules in term rewriting. This freedom in applying inference rules allows to express logical systems that are difficult or impossible to express in the cut-free sequent calculus and it also allows for a more fine-grained analysis of derivations than the sequent calculus. However, the same freedom also makes it harder to carry out this analysis, (...) in particular it is harder to design cut elimination procedures. In this paper we see a cut elimination procedure for a deep inference system for classical predicate logic. As a consequence we derive Herbrand's Theorem, which we express as a factorisation of derivations. (shrink)

This paper treats a kind of a modal logic based on the intuitionistic propositional logic which arose from the provability predicate in the first order arithmetic. The semantics of this calculus is presented in both a relational and an algebraic way.Completeness theorems, existence of a characteristic model and of a characteristic frame, properties of FMP and FFP and decidability are proved.

We develop a predicate logical extension of a subintuitionistic propositional logic. Therefore a Hilbert type calculus and a Kripke type model are given. The propositional logic is formulated to axiomatize the idea of strategic weakening of Kripke''s semantic for intuitionistic logic: dropping the semantical condition of heredity or persistence leads to a nonmonotonic model. On the syntactic side this leads to a certain restriction imposed on the deduction theorem. By means of a Henkin argument strong completeness is proved (...) making use of predicate logical principles, which are only classically acceptable. (shrink)

We consider substitutions in order sensitive situations, having in the back of our minds the case of dynamic predicate logic (DPL) with a stack semantics. We start from the semantic intuition that substitutions are move instructions on stacks: the syntactic operation [y/x] is matched by the instruction to move the value of the y-stack to the x-stack. We can describe these actions in the positive fragment of DPLE. Hence this fragment counts as a logic for DPL-substitutions. We give a (...) calculus for the fragment and prove soundness and completeness. (shrink)

The notion of a minimal form is defined as an extension of the notion of a normal form in λ-β-calculus and its meaning is discussed in a computational environment. The features of the Knuth-Gross reduction strategy are used to prove that to possess a minimal form, for a generic term, is a semidecidable predicate.

This article identifies and formalizes the logical features of analogous terms that justify their use in deduction. After a survey of doctrines in Aristotle, Aquinas, and Cajetan, the criteria of “analogy of proper proportionality” are symbolized in first-order predicate logic. A common genus justifies use of a common term, but does not provide the inferential link required for deduction. Rather, the respective differentiae foster this link through their identical proportion. A natural-language argument by analogy is formalized so as to (...) exhibit these criteria, thereby showing the validity of analogical deduction. (shrink)

The paper presents and applies Hilbert's Epsilon Calculus, first describing its standard proof theory, and giving it an intensional semantics. These are contrasted with the proof theory of Fregean Predicate Logic, and the traditional (extensional) choice function semantics for the calculus. The semantics provided show that epsilon terms are referring terms in Donnellan's sense, enabling the symbolisation and validation of argument forms involving E-type pronouns, both in extensional and intensional contexts. By providing for transparency in intensional constructions (...) they support a Model Conceptualism to contrast with traditional intensional logic's Modal Realism. But epsilon-terms also symbolise fictions, and through their difference from iota terms enable the solution of a number of outstanding puzzles about Direct Reference and de re beliefs. (shrink)

Building on the work of Peter Hinst and Geo Siegwart, we develop a pragmatised natural deduction calculus, i.e. a natural deduction calculus that incorporates illocutionary operators at the formal level, and prove its adequacy. In contrast to other linear calculi of natural deduction, derivations in this calculus are sequences of object-language sentences which do not require graphical or other means of commentary in order to keep track of assumptions or to indicate subproofs. (Translation of our German paper (...) "Ein Redehandlungskalkül. Ein pragmatisierter Kalkül des natürlichen Schließens nebst Metatheorie"; online available at http://philpapers.org/rec/CORERE.). (shrink)

In a number of publications A.N. Prior considered the use of what he called ‘metric tense logic’. This is a tense logic in which the past and future operators P and F have an index representing a temporal distance, so that Pnα means that α was true n -much ago, and Fn α means that α will be true n -much hence. The paper investigates the use of metric predicate tense logic in formalising phenomena ormally treated by such devices (...) as multiple indexing or quantification over times. (shrink)

We show that the relational semantics of the Lambek calculus, both nonassociative and associative, is also sound and complete for its extension with classical propositional logic. Then, using filtrations, we obtain the finite model property for the nonassociative Lambek calculus extended with classical propositional logic.

The revised edition contains a new chapter which provides an elegant description of the semantics. The various classes of lambda calculus models are described in a uniform manner. Some didactical improvements have been made to this edition. An example of a simple model is given and then the general theory (of categorical models) is developed. Indications are given of those parts of the book which can be used to form a coherent course.

In this paper, we present valuation semantics for the Propositional Intuitionistic Calculus (also called Heyting Calculus) and three important subcalculi: the Implicative, the Positive and the Minimal Calculus (also known as Kolmogoroff or Johansson Calculus). Algorithms based in our definitions yields decision methods for these calculi. DOI:10.5007/1808-1711.2010v14n1p125.

Textual evidence normally quoted to justify the claim that F. H. Bradley rejects subject - predicate judgements has other functions: namely to reject concrete interpretations of subject - predicate judgements. Bradley has his own view of subject - predicate judgement: in a judgement subject and predicate forma an adjetive which is predicated of the whole reality.

Fodor advocates a view of cognitive processes as computations defined over the language of thought (or Mentalese). Even among those who endorse Mentalese, considerable controversy surrounds its representational format. What semantically relevant structure should scientific psychology attribute to Mentalese symbols? Researchers commonly emphasize logical structure, akin to that displayed by predicate calculus sentences. To counteract this tendency, I discuss computational models of navigation drawn from probabilistic robotics. These models involve computations defined over cognitive maps, which have geometric rather (...) than logical structure. They thereby demonstrate the possibility of rational cognitive processes in an exclusively non-logical representational medium. Furthermore, they offer much promise for the empirical study of animal navigation. (shrink)

particular alternative logic could be relevant to another one? The most important part of a response to this question is to remind the reader of the fact that independence friendly (IF) logic is not an alternative or “nonclassical” logic. (See here especially Hintikka, “There is only one logic”, forthcoming.) It is not calculated to capture some particular kind of reasoning that cannot be handled in the “classical” logic that should rather be called the received or conventional logic. No particular epithet (...) should be applied to it. IF logic is not an alternative to our generally used basic logic, the received first-order logic, aka quantification theory or predicate calculus. It replaces this basic logic in that it is identical with this “classical” first-order logic except that certain important flaws of the received first-order logic have been corrected. But what are those flaws and how can they be corrected? To answer these questions is to explain the basic ideas of IF logic. Since this logic is not as well known as it should be, such explanation is needed in any case. I will provide three different but not unrelated motivations for IF logic. (shrink)

The aim of this paper is two-fold: (1) To contribute to a better knowledge of the method of the Argentinean mathematicians Lia Oubifia and Jorge Bosch to formulate category theory independently of set theory. This method suggests a new ontology of mathematical objects, and has a profound philosophical significance (the underlying logic of the resulting category theory is classical iirst—order predicate calculus with equality). (2) To show in outline how the Oubina-Bosch theory can be modified to give rise (...) to a strong paraconsistent category theory; strong enough to be taken as the basis for a paraconsistent mathematics which encompasses all classical mathematical results. (shrink)

[Ian Rumfitt] Frege's logicism in the philosophy of arithmetic consisted, au fond, in the claim that in justifying basic arithmetical axioms a thinker need appeal only to methods and principles which he already needs to appeal in order to justify paradigmatically logical truths and paradigmatically logical forms of inference. Using ideas of Gentzen to spell out what these methods and principles might include, I sketch a strategy for vindicating this logicist claim for the special case of the arithmetic of the (...) finite cardinals. /// [Timothy Williamson]The paper defends the intelligibility of unrestricted quantification. For any natural number n, 'There are at least n individuals' is logically true, when the quantifier is unrestricted. In response to the objection that such sentences should not count as logically true because existence is contingent, it is argued by consideration of cross-world counting principles that in the relevant sense of 'exist' existence is not contingent. A tentative extension of the upward Löwenheim-Skolem theorem to proper classes is used to argue that a sound and complete axiomatization of the logic of unrestricted universal quantification results from adding all sentences of the form 'There are at least n individuals' as axioms to a standard axiomatization of the first-order predicate calculus. (shrink)

Thus far the logic out of which mathematics has developed has been First-order Predicate Calculus with Identity, that is the logic of the sentential functors, ¬, →, ∧, ∨, etc., together with identity and the existential and universal quotifiers restricted to quotify- ing only over individuals, and not anything else, such as qualities or quotities themselves. Some philosophers—among them Quine— have held that this, First-order Logic, as it is often called, con- stitutes the whole of logic. But that (...) is a mistake. It leaves out Second-order Logic, which we need if we are to characterize the natural numbers precisely, and pays scant attention to the logic of relations, especially transitive relations, which is the key to much of modern mathematics. Quine’s argument for restricting logic to First-order Logice was based on the grounds that only First- order logical theories display “Law and Order” and himself regards modal logic as belonging with witchcraft and superstition.1 Pred- icates are ontologically more suspect than individuals, and have a different logic, which is liable to give rise to paradox and inconsis- tency. Moreover, Second-order Logic lacks the completeness that First-order Logice has, which provides a pleasing parallel between syntactic and semantic notions, and argues for the analyticity of deductive logic. (shrink)

[Ian Rumfitt] Frege's logicism in the philosophy of arithmetic consisted, au fond, in the claim that in justifying basic arithmetical axioms a thinker need appeal only to methods and principles which he already needs to appeal in order to justify paradigmatically logical truths and paradigmatically logical forms of inference. Using ideas of Gentzen to spell out what these methods and principles might include, I sketch a strategy for vindicating this logicist claim for the special case of the arithmetic of the (...) finite cardinals. /// [Timothy Williamson]The paper defends the intelligibility of unrestricted quantification. For any natural number n, 'There are at least n individuals' is logically true, when the quantifier is unrestricted. In response to the objection that such sentences should not count as logically true because existence is contingent, it is argued by consideration of cross-world counting principles that in the relevant sense of 'exist' existence is not contingent. A tentative extension of the upward Löwenheim-Skolem theorem to proper classes is used to argue that a sound and complete axiomatization of the logic of unrestricted universal quantification results from adding all sentences of the form 'There are at least n individuals' as axioms to a standard axiomatization of the first-order predicate calculus. (shrink)

IPC, the intuitionistic predicate calculus, has the property(i) Vc(A c /x) xA.Furthermore, for certain important , IPC has the converse property (ii) xA Vc(A c /x). (i) may be given up in various ways, corresponding to different philosophic intuitions and yielding different systems of intuitionistic free logic. The present paper proves the strong completeness of several of these with respect to Kripke style semantics. It also shows that giving up (i) need not force us to abandon the analogue (...) of (ii). (shrink)

The central aim of this paper is to present a Boolean algebraic approach to the classical Aristotelian Relations of Opposition, namely Contradiction and (Sub)contrariety, and to provide a 3D visualisation of those relations based on the geometrical properties of Platonic and Archimedean solids. In the first part we start from the standard Generalized Quantifier analysis of expressions for comparative quantification to build the Comparative Quantifier Algebra CQA. The underlying scalar structure allows us to define the Aristotelian relations in Boolean terms (...) and to propose a 3D visualisation by transforming a cube into an octahedron. In part two, the architecture of the CQA is shown to carry over, both to the classical quantifiers of Predicate Calculus and to the modal operators—which are given a Generalized Quantifier style re-interpretation. In this way we provide an algebraic foundation for Blanché’s Aristotelian hexagon as well as a 3D alternative to his 2D star-like visualisation. In a final part, a richer scalar structure is argued to underly the realm of Modality, thus generalizing the 3D algebra with eight (2 3 ) operators to a 4D algebra with sixteen (2 4 ) operators. The visual representation of the latter structure involves a transformation of the hypercube to a rhombic dodecahedron. The resulting 3D visualisation allows a straightforward embedding, not only of the classical Blanché star of Aristotelian relations or the paracomplete and paraconsistent stars of Béziau (Log Investig 10, 218–232, 2003) but also of three additional isomorphic Aristotelian constellations. (shrink)

P.F. Strawson's essay traces some formal characteristics of logic and grammar to their roots in general features of thought and experience.

The Ontological Square is a categorial scheme that combines two metaphysical distinctions: that between types (or universals ) and tokens (or particulars ) on the one hand, and that between characters (or features ) and their substrates (or bearers ) on the other hand. The resulting four-fold classification of things comprises particular substrates, called substances , universal substrates, called kinds , particular characters, called modes or moments , and universal characters, called attributes . Things are joined together in facts by (...) primitive ontological ties or nexus . This article describes a logic that is meant to capture the basic intuitions behind the Ontological Square. Given a minimal correspondence between atomic logical form and ontological structure, the commitment to nexus as a distinct ontological category entails a rehabilitation of copulae as ties of predication. Thus, the Logic of the Ontological Square is a copula calculus rather than a predicate calculus; its soundness and completeness can be established with respect to a model akin to a so-called first-order semantics for standard second-order logic. (shrink)

This lively introduction to mathematical logic, easily accessible to non-mathematicians, offers an historical survey, coverage of predicate calculus, model theory, Godel’s theorems, computability and recursivefunctions, consistency and independence in axiomatic set theory, and much more. Suggestions for Further Reading. Diagrams.

Accelerating Turing machines are Turing machines of a sort able to perform tasks that are commonly regarded as impossible for Turing machines. For example, they can determine whether or not the decimal representation of contains n consecutive 7s, for any n; solve the Turing-machine halting problem; and decide the predicate calculus. Are accelerating Turing machines, then, logically impossible devices? I argue that they are not. There are implications concerning the nature of effective procedures and the theoretical limits of (...) computability. Contrary to a recent paper by Bringsjord, Bello and Ferrucci, however, the concept of an accelerating Turing machine cannot be used to shove up Searle's Chinese room argument. (shrink)

Comprehensive account of constructive theory of first-order predicate calculus. Covers formal methods including algorithms and epi-theory, brief treatment of Markov’s approach to algorithms, elementary facts about lattices and similar algebraic systems, more. Philosophical and reflective as well as mathematical. Graduate-level course. 1963 ed. Exercises.

Take a formula of first-order logic which is a logical consequence of some other formulae according to model theory, and in all those formulae replace schematic letters with English expressions. Is the argument resulting from the replacement valid in the sense that the premisses could not have been true without the conclusion also being true? Can we reason from the model-theoretic concept of logical consequence to the modal concept of validity? Yes, if the model theory is the standard one for (...) sentential logic; no, if it is the standard one for the predicate calculus; and yes, if it is a certain model theory for free logic. These conclusions rely inter alia on some assumptions about possible worlds, which are mapped into the models of model theory. Plural quantification is used in the last section, while part of the reasoning is relegated to an appendix that includes a proof of completeness for a version of free logic. (shrink)