This note is to show that a well-known point about David Lewis’s (1986) modal realism applies to Timothy Williamson’s (1998; 2002) theory of necessary existents as well.1 Each theory, together with certain “recombination” principles, generates individuals too numerous to form a set. The simplest version of the argument comes from Daniel Nolan (1996).2 Assume the following recombination principle: for each cardinal number, ν, it’s possible that there exist ν nonsets. Then given Lewis’s modal realism it follows that there can be (...) no set of all (that is, Absolutely All) the nonsets. For suppose for reductio that there were such a set, A; let ν be A’s cardinality; and let µ be any cardinal number larger than ν. By the recombination principle, it’s possible that there exist µ nonsets; by modal realism, there exists a possible world containing, as parts, µ nonsets; each of these nonsets is a member of A. (shrink)

I propose an account of possible worlds. According to the account, possible worlds are pluralities of sentences in an extremely large language. This account avoids a problem, relating to the total number of possible worlds, that other accounts face. And it has several additional benefits.

In this paper I discuss Ernst Zermelo’s ideas concerning the possibility of developing a system of infinitary logic that, in his opinion, should be suitable for mathematical inferences. The presentation of Zermelo’s ideas is accompanied with some remarks concerning the development of infinitary logic. I also stress the fact that the second axiomatization of set theory provided by Zermelo in 1930 involved the use of extremal axioms of a very specific sort.1.

An influential theory has it that metaphysical indeterminacy occurs just when reality can be made completely precise in multiple ways. That characterization is formulated by employing the modal apparatus of ersatz possible worlds. As quantum physics taught us, reality cannot be made completely precise. I meet the challenge by providing an alternative theory which preserves the use of ersatz worlds but rejects the precisificational view of metaphysical indeterminacy. The upshot of the proposed theory is that it is metaphysically indeterminate whether (...) p just in case it is neither true nor false that p, and no terms in ‘p’ are semantically defective. In other words, metaphysical indeterminacy arises when the world cannot be adequately described by a complete set of sentences defined in a semantically nondefective language. Moreover, the present theory provides a reductive analysis of metaphysical indeterminacy, unlike its influential predecessor. Finally, I argue that any adequate logic of a language with an indeterminate subject matter is neither compositional nor bivalent. (shrink)

Esta enciclopédia abrange, de uma forma introdutória mas desejavelmente rigorosa, uma diversidade de conceitos, temas, problemas, argumentos e teorias localizados numa área relativamente recente de estudos, os quais tem sido habitual qualificar como «estudos lógico-filosóficos». De uma forma apropriadamente genérica, e apesar de o território teórico abrangido ser extenso e de contornos por vezes difusos, podemos dizer que na área se investiga um conjunto de questões fundamentais acerca da natureza da linguagem, da mente, da cognição e do raciocínio humanos, bem (...) como questões acerca das conexões destes com a realidade não mental e extralinguística. A razão daquela qualificação é a seguinte: por um lado, a investigação em questão é qualificada como filosófica em virtude do elevado grau de generalidade e abstracção das questões examinadas (entre outras coisas); por outro, a investigação é qualificada como lógica em virtude de ser uma investigação logicamente disciplinada, no sentido de nela se fazer um uso intenso de conceitos, técnicas e métodos provenientes da disciplina de lógica. O agregado de tópicos que constitui a área de estudos lógico-filosóficos é já visível, pelo menos em parte, no Tractatus Logico-Philosophicus de Ludwig Wittgenstein, uma obra publicada em 1921. E uma boa maneira de ter uma ideia sinóptica do território disciplinar abrangido por esta enciclopédia, ou pelo menos de uma porção substancial dele, é extrair do Tractatus uma lista dos tópicos mais salientes aí discutidos; a lista incluirá certamente tópicos do seguinte género, muitos dos quais se podem encontrar ao longo desta enciclopédia: factos e estados de coisas; objectos; representação; crenças e estados mentais; pensamentos; a proposição; nomes próprios; valores de verdade e bivalência; quantificação; funções de verdade; verdade lógica; identidade; tautologia; o raciocínio matemático; a natureza da inferência; o cepticismo e o solipsismo; a indução; as constantes lógicas; a negação; a forma lógica; as leis da ciência; o número. (shrink)

Alan Turing devised his famous test (TT) through a slight modificationof the parlor game in which a judge tries to ascertain the gender of twopeople who are only linguistically accessible. Stevan Harnad hasintroduced the Total TT, in which the judge can look at thecontestants in an attempt to determine which is a robot and which aperson. But what if we confront the judge with an animal, and arobot striving to pass for one, and then challenge him to peg which iswhich? (...) Now we can index TTT to a particular animal and its syntheticcorrelate. We might therefore have TTTrat, TTTcat,TTTdog, and so on. These tests, as we explain herein, are abetter barometer of artificial intelligence (AI) than Turing's originalTT, because AI seems to have ammunition sufficient only to reach thelevel of artificial animal, not artificial person. (shrink)

We define a subhierarchy of the infinitely deep languagesN described by Jaakko Hintikka and Veikko Rantala. We shall show that some model theoretic results well-known in the model theory of the ordinary infinitary languages can be generalized for these new languages. Among these are the downward Löwenheim-Skolem and o's theorems as well as some compactness properties.

The most commonly heard proposals for reducing possible worlds to language succumb to a simple cardinality argument: it can be shown that there are more possible worlds than there are linguistic entities provided by the proposal. In this paper, I show how the standard proposals can be generalized in a natural way so as to make better use of the resources available to them, and thereby circumvent the cardinality argument. Once it is seen just what the limitations are on these (...) more general proposals, it can be clearly seen where the real difficulty lies with any attempt to reduce possible worlds to language. Roughly, the difficulty is this: no actual language could have the descriptive resources needed to represent all the ways things might have been. I conclude by arguing that this same difficulty spells doom for any nominalist or conceptualist proposal for reducing possible worlds. (shrink)

What''s computation? The received answer is that computation is a computer at work, and a computer at work is that which can be modelled as a Turing machine at work. Unfortunately, as John Searle has recently argued, and as others have agreed, the received answer appears to imply that AI and Cog Sci are a royal waste of time. The argument here is alarmingly simple: AI and Cog Sci (of the Strong sort, anyway) are committed to the view that cognition (...) is computation (or brains are computers); butall processes are computations (orall physical things are computers); so AI and Cog Sci are positively silly.I refute this argument herein, in part by defining the locutions x is a computer and c is a computation in a way that blocks Searle''s argument but exploits the hard-to-deny link between What''s Computation? and the theory of computation. However, I also provide, at the end of this essay, an argument which, it seems to me, implies not that AI and Cog Sci are silly, but that they''re based on a form of computation that is well beneath human persons. (shrink)

We introduce a new device in the study of abstract elementary classes : Galois Morleyization, which consists in expanding the models of the class with a relation for every Galois type of length less than a fixed cardinal κ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\kappa $$\end{document}. We show:Theorem 0.1 An AEC K is fully \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\kappa = \beth _{\kappa } > \text {LS}$$\end{document}. If K is Galois stable, then the (...) class of κ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\kappa $$\end{document}-Galois saturated models of K admits an independence notion \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$$$\end{document}-coheir) which, except perhaps for extension, has the properties of forking in a first-order stable theory. (shrink)

Steven Pinker's How the mind works (HTMW) marks in my opinion an historic point in the history of humankind's attempt to understand itself. Socrates delivered his "know thyself" imperative rather long ago, and now, finally, in this behemoth of a book, published at the dawn of a new millennium, Pinker steps up to have psychology tell us what we are: computers crafted by evolution - end of story; mystery solved; and the poor philosophers, having never managed to obey Socrates' command, (...) are left alone to wander in the labyrinth of their benighted speculation forever. Unfortunately, though HTMW is to this point the crowning attempt of psychology to make systematic sense of persons by integrating everything relevant science knows, the book fails - and it fails so fundamentally and irremediably that we would do well to wonder anew whether we should supplant the basic view it promotes with what I call the super-mind hypothesis: the view that though mere animals are evolved computers, persons are more. (shrink)

Analogues of Scott's isomorphism theorem, Karp's theorem as well as results on lack of compactness and strong completeness are established for infinitary propositional relevant logics. An "interpolation theorem" for the infinitary quantificational boolean logic L-infinity omega. holds. This yields a preservation result characterizing the expressive power of infinitary relevant languages with absurdity using the model-theoretic relation of relevant directed bisimulation as well as a Beth definability property.

In this paper we address our efforts to extend the well-known connection in equational logic between equational theories and fully invariant congruences to other–possibly infinitary–logics. In the special case of algebras, this problem has been formerly treated by H. J. Hoehnke [10] and R. W. Quackenbush [14]. Here we show that the connection extends at least up to the universal fragment of logic. Namely, we establish that the concept of universal theory matches the abstract notion of fully invariant system. We (...) also prove that, inside this wide group of theories, the ones which are strict universal Horn correspond to fully invariant closure systems, whereas those which are universal atomic can be characterized as principal fully invariant systems. (shrink)

In his recent _The Rediscovery of the Mind_ John Searle tries to destroy cognitive science _and_ preserve a future in which a ``perfect science of the brain'' (1992, p. 235) arrives. I show that Searle can't accomplish both objectives. The ammunition he uses to realise the first stirs up a maelstrom of consciousness so wild it precludes securing the second.

The Craig Interpolation Theorem is intimately connected with the emergence of abstract logic and continues to be the driving force of the field. I will argue in this paper that the interpolation property is an important litmus test in abstract model theory for identifying “natural,” robust extensions of first order logic. My argument is supported by the observation that logics which satisfy the interpolation property usually also satisfy a Lindström type maximality theorem. Admittedly, the range of such logics is small.

We introduce and explore the notion of duality for entailment relations induced by preference orderings on states. We discuss the relationship between these preferential entailment relations from the perspectives of Boolean algebra, inference rules, and modal axiomatisation. Interpreting the preference relations as accessibility relations establishes modular Gödel-Löb logic as a suitable modal framework for rational preferential reasoning.