We discuss the interpolation property on some important families of non classical logics, such as intuitionistic, modal, fuzzy, and linear logics. A special paragraph is devoted to a generalization of the interpolation property, uniform interpolation.

In this paper we study iterated circular multisets in a coalgebraic framework. We will produce two essentially different universes of such sets. The unisets of the first universe will be shown to be precisely the sets of the Scott universe. The unisets of the second universe will be precisely the sets of the AFA-universe. We will have a closer look into the connection of the iterated circular multisets and arbitrary trees. RID=""ID="" Mathematics Subject Classification (2000): 03B45, 03E65, 03E70, 18A15, 18A22, (...) 18B05, 68Q85 RID=""ID="" Key words or phrases: Multiset – Non-wellfounded set – Scott-universe – AFA – Coalgebra – Modal logic – Graded modalities. (shrink)

This paper studies the topological duality between diagonalizable algebras and bi-topological spaces. In particular, the correspondence between algebraic properties of a diagonalizable algebra and topological properties of its dual space is investigated. Since the main example of a diagonalizable algebra is the Lindenbaum algebra of an r.e. theory extending Peano Arithmetic, endowed with an operator defined by means of the provability predicate of the theory, this duality gives the possibility to study arithmetical properties of theories from a topological point of (...) view. We find topological characterization of $\Sigma_1$-sound theories and of sentences that are $\Sigma_1$-conservative over such a theory. (shrink)

We consider the relation between the uniform interpolation property and the elimination of non-standard quantifiers (the bisimulation quantifiers) in the context of the ?-calculus. In particular, we isolate classes of frames where the correspondence between these two properties is nicely smooth.

We consider the problem of the existence of uniform interpolants in the modal logic K4. We first prove that all \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\square}$$\end{document}-free formulas have uniform interpolants in this logic. In the general case, we shall prove that given a modal formula \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\phi}$$\end{document} and a sublanguage L of the language of the formula, we can decide whether \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} (...) \setlength{\oddsidemargin}{-69pt} \begin{document}$${\phi}$$\end{document} has a uniform interpolant with respect to L in K4. The \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\square}$$\end{document}-free case is proved using a reduction to the Gödel Löb Logic GL, while in the general case we prove that the question of whether a modal formula has uniform interpolants over transitive frames can be reduced to a decidable expressivity problem on the μ-calculus. (shrink)

Using only propositional connectives and the provability predicate of a Σ1-sound theory T containing Peano Arithmetic we define recursively enumerable relations that are complete for specific natural classes of relations, as the class of all r. e. relations, and the class of all strict partial orders. We apply these results to give representations of these classes in T by means of formulas.

In this paper, we generalize the set-theoretic translation method for polymodal logic introduced in [11] to extended modal logics. Instead of devising an ad-hoc translation for each logic, we develop a general framework within which a number of extended modal logics can be dealt with. We first extend the basic set-theoretic translation method to weak monadic second-order logic through a suitable change in the underlying set theory that connects up in interesting ways with constructibility; then, we show how to tailor (...) such a translation to work with specific cases of extended modal logics. (shrink)

In Zwicker (1987) the hypergame paradox is introduced and studied. In this paper we continue this investigation, comparing the hypergame argument with the diagonal one, in order to find a proof schema. In particular, in Theorems 9 and 10 we discuss the complexity of the set of founded elements in a recursively enumerable relation on the set N of natural numbers, in the framework of reduction between relations. We also find an application in the theory of diagonalizable algebras and construct (...) an undecidable formula. (shrink)

In this paper, we generalize the set-theoretic translation method for poly-modal logic introduced in [11] to extended modal logics. Instead of devising an ad-hoc translation for each logic, we develop a general framework within which a number of extended modal logics can be dealt with. We first extend the basic set-theoretic translation method to weak monadic second-order logic through a suitable change in the underlying set theory that connects up in interesting ways with constructibility; then, we show how to tailor (...) such a translation to work with specific cases of extended modal logics. (shrink)

In identifying that the 'essential tension' is the balance between conservative and innovative approaches in the development of knowledge - tried-and tested or new directions - Kuhn pointed out that these two attitudes are both appropriate. This study adds to this picture the social and psychological dynamics that underpin any such balancing.

To understand the continuing importance of John Rawls’s work, we need to understand the background, the object and the method of his fifty-year quest as a political thinker. The background to Rawls’s investigation was a (carefully circumscribed) acknowledgement of a certain kind of evaluative pluralism. The object of Rawls’s work was to develop a method of commensuration that would enable us, the free and equal citizens of a democratic society, to identify a common basis for our dealings, in search of (...) mutual benefit, with one another. Finally, the method used by Rawls in his work was broadly, though tacitly rather than explicitly, pragmatist in character, especially in the sense that Rawls was aiming, now explicitly, to develop principles of political association that generate their own support in the attitudes and actions of those whose behavior they are intended to guide. (shrink)

Free Public Reason examines the idea of public justification, stressing its importance but also questioning the coherence of the concept itself. Although public justification is employed in the work of theorists such as John Rawls, Jeremy Waldron, Thomas Nagel, and others, it has received little attention on its own as a philosophical concept. In this book Fred D'Agostino shows that the concept is composed of various values, interests, and notions of the good, and that no ranking of these is possible. (...) The notion of public justification itself is thus shown to be contestable. In demonstrating this, D'Agostino undermines many current political theories that rely on this concept. Having broken down the foundations of public justification, D'Agostino then offers an alternative model of how a workable consensus on its meaning might be reached through the interactions of a community of interpreters or delegates at a constitutional convention. (shrink)

La pensée est un patrimoine discret et secret au point qu'elle n'est pas habituellement considérée comme un patrimoine au sens propre. Pourtant elle est à l'origine de tous les autres. Probablement sans l'exercice de cette faculté qui leur est propre, les êtres humains n'auraient jamais conçu leurs monuments extraordinaires ni leurs constructions admirables. Du plus petit phénomène jusqu'à la loi générale qui en coordonnerait les enchaînements, la recherche cultivée à l'intérieur de jardins divers et multiples tout le long de l'histoire (...) révèle un désir caché d'absolu. Comme si le jardinier dans l'aspiration d'élargir son horizon avait été amené à un certain moment à pousser les murs et à se retrouver chez le voisin, dans le monde et hors du monde par étapes successives. Un jeu de l'observation, de la mémoire et de l'imagination. En 2003, dans le cadre idéal de la Chartreuse de Valbonne, quelques représentants de disciplines diverses allaient reprendre ce jeu autour d'un thème aussi libre que contraignant tel que l'Espace Spirituel peut l'être. Quelques architectes, mathématiciens, musicologues, musiciens, et philosophes évoquent l'expression : Espace Spirituel chacun selon son angle de vue. L'idée d'Espace dans une cathédrale, dans le désert ou dans un chou fleur... Le Spirituel traverse les cultures du christianisme au judaïsme à l'indouisme. Le regard a l'écoulement du temps et les vignobles de la Chartreuse de Valbonne comme perspective. (shrink)

It has frequently been suggested that Rawls’s characteristic method of justification, a method crucially involving the notion of reflective equilibrium, is in some sense relativistic in its implications. No sustained development of this suggestion has been undertaken by those who advance it; likewise, no sustained attempt to refute this suggestion has been made by those who are otherwise sympathetic to Rawls’s account of justification. I here attempt to fill these gaps in the already extensive literature associated with the method of (...) reflective equilibrium. At below, I review claims that Rawls’s method has relativistic implications. I also attempt, for purposes of argument, to buttress these claims by citing remarks of Rawls which could be interpreted as relativistic in character. At below, I consider problems of political reasoning as these arise in societies which are ill- and well-ordered in Rawls’s sense. At below, I consider problems of political reasoning as these arise between the members of two or more well-ordered societies, each of which is regulated by a different conception of justice. I also there adapt Williams’s distinction between notional and real confrontations between incompatible systems of beliefs in order to distinguish two kinds of conflict with respect to fundamental political principles. Finally, I show how a notion of broad reflective equilibrium can be deployed in order to solve those problems of political adjudication which may arise between the members of societies which have distinct conceptions of justice. At this point it should be clear that Rawls’s method of justification is not, in intention at least, relativistic in its implications. (shrink)

ABSTRACT Ethical thinking about social science research is dominated by a biomedical model whose salient features are the assumption that only potential harms to subjects of research are relevant in the ethical evaluation of that research, and in the emphasis on securing informed consent in order to establish ethical probity. A number of counter‐examples are considered to the assumption, a number of defences against these counter‐examples are examined, and an alternative model is proposed for the ethical evaluation of social science (...) research: a model which can cope with the systemic harms which have been identified. This model is based on John Rawls's idea of original position reasoning and treats social science research as an institutional feature of the basic structure of society. (shrink)

Book Information Relativism. By Paul O'Grady. Acumen. Chesham. 2002. Pp. xi + 196. Paperback, £12.95.

Deductive inference is usually regarded as being “tautological” or “analytical”: the information conveyed by the conclusion is contained in the information conveyed by the premises. This idea, however, clashes with the undecidability of first-order logic and with the (likely) intractability of Boolean logic. In this article, we address the problem both from the semantic and the proof-theoretical point of view. We propose a hierarchy of propositional logics that are all tractable (i.e. decidable in polynomial time), although by means of growing (...) computational resources, and converge towards classical propositional logic. The underlying claim is that this hierarchy can be used to represent increasing levels of “depth” or “informativeness” of Boolean reasoning. Special attention is paid to the most basic logic in this hierarchy, the pure “intelim logic”, which satisfies all the requirements of a natural deduction system (allowing both introduction and elimination rules for each logical operator) while admitting of a feasible (quadratic) decision procedure. We argue that this logic is “analytic” in a particularly strict sense, in that it rules out any use of “virtual information”, which is chiefly responsible for the combinatorial explosion of standard classical systems. As a result, analyticity and tractability are reconciled and growing degrees of computational complexity are associated with the depth at which the use of virtual information is allowed. (shrink)

In our information societies, tasks and decisions are increasingly outsourced to automated systems, machines, and artificial agents that mediate human relationships, by taking decisions and acting on the basis of algorithms. This raises a critical issue: how are algorithmic procedures and applications to be appraised and governed? This question needs to be investigated, if one wishes to avoid the traps of ICTs ending up in isolating humans behind their screens and digital delegates, or harnessing them in a passive role, by (...) curtailing their freedom and autonomy. (shrink)

Decision-making assisted by algorithms developed by machine learning is increasingly determining our lives. Unfortunately, full opacity about the process is the norm. Would transparency contribute to restoring accountability for such systems as is often maintained? Several objections to full transparency are examined: the loss of privacy when datasets become public, the perverse effects of disclosure of the very algorithms themselves, the potential loss of companies’ competitive edge, and the limited gains in answerability to be expected since sophisticated algorithms usually are (...) inherently opaque. It is concluded that, at least presently, full transparency for oversight bodies alone is the only feasible option; extending it to the public at large is normally not advisable. Moreover, it is argued that algorithmic decisions preferably should become more understandable; to that effect, the models of machine learning to be employed should either be interpreted ex post or be interpretable by design ex ante. (shrink)

INTRODUCTION The editors of this volume - Jarvie and D'Agostino - encountered John Watkins at such different times in his career that they have never ...

This book was published in 2003.This volume presents a detailed examination of incommensurability in the value-theoretical sense. Exploring how choosers deal with problems and constraints of choice, the author draws on work in cognitive psychology, in sociology, in jurisprudence, in economics, and in the theory of value to show how choosers learn to make trade-offs when there is potential incommensurability among the options they are considering. The analysis is also informed by recent work in the tradition of Michel Foucault. With (...) so many modern devices and ideals of government dependent on the comparability of options, this book is timely and can inform public debate about de-regulation, user-pays, accountability, and the substitution of market mechanisms for government regulation and supply. (shrink)

In this paper we provide a detailed proof-theoretical analysis of a natural deduction system for classical propositional logic that represents classical proofs in a more natural way than standard Gentzen-style natural deduction, admits of a simple normalization procedure such that normal proofs enjoy the Weak Subformula Property, provides the means to prove a Non-contamination Property of normal proofs that is not satisfied by normal proofs in the Gentzen tradition and is useful for applications, especially in formal argumentation, naturally leads to (...) defining a notion of depth of a proof, to the effect that, for every fixed natural k, normal k-depth deducibility is a tractable problem and converges to classical deducibility as k tends to infinity. (shrink)

Recent years have been blessed with an abundance of logical systems, arising from a multitude of applications. A logic can be characterised in many different ways. Traditionally, a logic is presented via the following three components: 1. an intuitive non-formal motivation, perhaps tie it in to some application area 2. a semantical interpretation 3. a proof theoretical formulation. There are several types of proof theoretical methodologies, Hilbert style, Gentzen style, goal directed style, labelled deductive system style, and so on. The (...) tableau methodology, invented in the 1950s by Beth and Hintikka and later per fected by Smullyan and Fitting, is today one of the most popular, since it appears to bring together the proof-theoretical and the semantical approaches to the pre of a logical system and is also very intuitive. In many universities it is sentation the style first taught to students. Recently interest in tableaux has become more widespread and a community crystallised around the subject. An annual tableaux conference is being held and proceedings are published. The present volume is a Handbook a/Tableaux pre senting to the community a wide coverage of tableaux systems for a variety of logics. It is written by active members of the community and brings the reader up to frontline research. It will be of interest to any formal logician from any area. (shrink)

Critical notice of The Order of Public Reason by Gerald Gaus.