Sten Lindström

(1945 - 2022)

The so called Ramsey test is a semantic recipe for determining whether a conditional proposition is acceptable in a given state of belief. Informally, it can be formulated as follows: (RT) Accept a proposition of the form "if A, then C" in a state of belief K, if and only if the minimal change of K needed to accept A also requires accepting C. In Gärdenfors (1986) it was shown that the Ramsey test is, in the context of some other weak conditions, on pain of triviality incompatible with the following principle, which was there called the preservation criterion: (P) If a proposition B is accepted in a given state of belief K and the proposition A is consistent with the beliefs in K, then B is still accepted in the minimal change of K needed to accept A. (RT) provides a necessary and sufficient criterion for when a 'positive' conditional should be included in a belief state, but it does not say anything about when the negation of a conditional sentence should be accepted. A very natural candidate for this purpose is the following negative Ramsey test: (NRT) Accept the negation of a proposition of the form "if A, then C" in a consistent state of belief K, if and only if the minimal change of K needed to accept A does not require accepting C. This note shows that (NRT) leads to triviality results even in the absence of additional conditions like (P).

This is a short version of Lindström & Rabinowicz 1991.In earlier papers, we proposed a generalization of the AGM approach to belief revision. The proposal was to view belief revision as a relation rather than as a function on theories (or belief sets). Going relational means that one allows for several equally reasonable revisions of a theory with a given proposition. In the present paper, we show that the relational approach is the natural result of generalizing in a certain way an approach to belief revision due to Adam Grove. In his (1988) paper, Grove presented two closely related modelings of functional belief revision, one in terms of a family of "spheres" around the agent's theory G and the other in terms of an epistemic entrenchment ordering of propositions. The "sphere"-terminology is natural when one looks upon theories and propositions as sets of possible worlds. Grove's spheres may be thought of as possible "fallback" theories relative to the agent's original theory: theories that he may reach by deleting propositions that are not "sufficiently" entrenched (according to standards of sufficient entrenchment of varying stringency). The entrenchment ordering can be recovered from the family of fallbacks by the definition: A is at least as entrenched as B iff A belongs to every fallback to which B belongs. To revise a theory T with a proposition A, we go to the smallest sphere that contain A-worlds and intersect it with A. The relational notion of belief revision that we are interested in, results if one allows that some propositions may be incomparable with respect to epistemic entrenchment. As a result, the family of fallbacks around a given theory will no longer have to be nested. This change opens up the possibility for several different ways of revising a theory with a given proposition.

Vann McGee has proposed a counterexample to the Ramsey Test. In the counterexample, a seemingly trustworthy source has testified that p and that if not-p, then q. If one subsequently learns not-p, then one has reason to doubt the trustworthiness of the source and so, the argument goes, one has reason to doubt the conditional asserted by the source. Since what one learns is that the antecedent of the conditional holds, these doubts are contrary to the Ramsey Test. We argue that the counterexample fails. It rests on a principle of testimonial dependence that is not applicable when a source hedges his or her claims.

Stig Kanger (1924--1988) made important contributions to logic and formal philosophy. Kanger's most original achievements were in the areas of general proof theory, the semantics of modal and deontic logic, and the logical analysis of the concept of rights. But he contributed significantly to action theory, preference logic and the theory of measurement as well. The first volume is a complete collection of Kanger's philosophical papers. The second volume contains critical essays on the various aspects of Kanger's work as well as some biographical sketches.

This book brings together philosophers, mathematicians and logicians to penetrate important problems in the philosophy and foundations of mathematics. In philosophy, one has been concerned with the opposition between constructivism and classical mathematics and the different ontological and epistemological views that are reflected in this opposition. The dominant foundational framework for current mathematics is classical logic and set theory with the axiom of choice (ZFC). This framework is, however, laden with philosophical difficulties. One important alternative foundational programme that is actively pursued today is predicativistic constructivism based on Martin-Löf type theory. Associated philosophical foundations are meaning theories in the tradition of Wittgenstein, Dummett, Prawitz and Martin-Löf. What is the relation between proof-theoretical semantics in the tradition of Gentzen, Prawitz, and Martin-Löf and Wittgensteinian or other accounts of meaning-as-use? What can proof-theoretical analyses tell us about the scope and limits of constructive and predicative mathematics?

Artificiell intelligens (AI) är ett ungt forskningsområde där många av de grundläggande problemen förefaller att vara av filosofisk art.1 Ämnet har sina filosofiska rötter dels i traditionen från Leibniz, Frege, Russell och Hilbert, som strävar efter att formalisera principerna för exakt tänkande, dels i den klassiska mekanismen: idén att människan är en maskin och att det mänskliga tänkandet är en mekanisk process. Som en första approximation kan vi säga att AI är det vetenskapliga studiet av hur man konstruerar och bygger maskiner (datorer) som är intelligenta (eller uppvisar intelligent beteende). Det är lätt att se att denna forskning aktualiserar frågor av filosofiskt slag. Hit hör problem som rör tänkandets natur samt förhållandet mellan medvetandet och kroppen. Inom AI ses ofta datorns arbetssätt som en modell för människans kognitiva processer och man föreställer sig kanske att hjärnan är ett slags dator. Eftersom hjärnan liknas vid en dator och en dator tänks arbeta rent mekaniskt i enlighet med ett givet program (en given algoritm), så föreställer man sig att samma sak bör gälla för hjärnan. Analogin hjärna-dator leder till föreställningen att tänkande inte är något annat än en dators mekaniska manipulerande av symboler i enlighet med givna formella regler. Denna uppfattning om tänkandets natur förefaller samtidigt problematisk: mekanisk manipulation av symboler förutsätter ingen förståelse av symbolernas innebörd; genuint tänkande, å andra sidan, tycks förutsätta sådan förståelse. Ibland verkar också analogin hjärna-dator i den motsatta riktningen. Eftersom hjärnan liknas vid en dator och hjärnan har en mental dimension, så föreställer man sig kanske att samma sak måste gälla för vissa datorer: synen på hjärnan som en dator leder till tanken att det borde vara möjligt att konstruera datorer som bokstavligen tänker, känner och förnimmer. Man föreställer sig kanske att man skall kunna konstruera ett artificiellt medvetande. Vi är alla förtrogna med datorer som (i en viss mening) kan lösa förelagda uppgifter på ett intelligent sätt, men följer det därav att dessa datorer kan tänka? Inte tänker väl en schackspelande dator på schack? Hur intelligent dagens datorer än beter sig, så verkar det ändå inte rimligt att säga att de har tankar, känslor eller upplevelser. Men kan man utesluta att vi någon gång i framtiden kommer att kunna konstruera datorer som verkligen förstår, är medvetna, och tänker? Dessa frågor rymmer många begreppsliga oklarheter. Vad är intelligens, tänkande, förståelse, medvetande? Hur förhåller sig intelligens och tänkande till medvetandets fenomenella sida: upplevelser och känslor? Om vad slags ting är det meningsfullt att säga att de har intelligens, medvetande, mentala tillstånd, etc.? Är det meningsfullt att säga detta om en hjärna, en maskin, en dator? Vad menas med en maskin (dator)? Hur kan vi veta (avgöra) om ett ting har intelligens, tankar, känslor eller upplevelser? I denna uppsats avser vi att närmare belysa sambandet mellan filosofi och AI samt kritiskt granska några av AI-forskningens förutsättningar inom filosofi och logik.

This is a thesis in formal semantics. It consists of two parts corresponding to the distinction, due to Richard Montague, between universal grammar and specific semantic theories. The first part concerns universal grammar and is intended to provide a precise and unified conceptual framework within which different theories of formal semantics can be represented and compared. ;The second part of the thesis is concerned with intensional logic, i.e., with the logical analysis of discourse involving so called oblique contexts. These contexts are characterized by the apparent failure of certain classically valid principles of substitutivity. Two kinds of reactions among logicians to the appearance of oblique contexts in natural languages are distinguished: (1) the intensional point of view, according to which oblique contexts are seen as genuine counterexamples to classical logic and to the related semantical principle of extensionality: the principle that the denotation of an expression is a function of the denotations of its parts; and (2) the extensional point of view, according to which the conflict between oblique contexts and classical logic is only apparent. The extensional point of view therefore calls for analyses of oblique contexts that preserve the laws of classical logic and the principle of extensionality. In this thesis, we are concerned with the precise formulation of and comparison between different programs for the formal semantic representation of oblique contexts. In Chapter 5, we are concerned with Church's program of representing oblique contexts within a formal language whose semantics is fully extensional and based on Frege's distinction between sense and denotation. The ambiguity between the "direct" and "indirect" denotation of an expression A is avoided by letting A be replaced in oblique contexts by an expression which denotes A's ordinary sense. We provide a possible-worlds semantics for a version of Church's formal language with the following features: (i) Objectual quantification into oblique constructions is accounted for. The treatment of quantification requires for each entity x an essence of x, by which we mean a sense which determines x in those worlds in which x exists and is undefined in all other worlds. (ii) The variables range over actually existing entities only. It is allowed that entities of certain types are contingent, i.e., the same entity may exist in one world and fail to exist in other worlds. (iii) In order to combine a proper treatment of the cross-world identification of functions with varying domains, partial functions are allowed. (iv) Senses are allowed to be partially defined. For example, the sense of a proper name is undefined in a world in which the denotation of the name does not exist. (v) Senses of functions from objects of type a to objects of type b are identified with functions from senses of objects of type a to senses of objects of type b. In Chapters 6 and 7, we pursue the Russellian Alternative in intensional semantics, where a sense/denotation distinction is avoided. Apparent failures of substitutivity principles for singular terms are explained along the lines of Russell's theory of definite descriptions. Failures of substitutivity of coextensional sentences and predicates are explained by Russell's doctrine that sentences and predicate denote propositions and propositional functions , respectively. Russellian semantics is fully extensional in the sense that the Russellian denotation of a designator is a function of the Russellian denotations of its parts. In Chapter 6, a theory of Russellian propositions is developed within set theory. This theory is then applied in Chapter 7 to the task of providing a set-theoretic semantics for Russellian type theory.