Tarski's influence on computer science

The influence of Alfred Tarski on computer science was indirect but significant in a number of directions and was in certain respects fundamental. Here surveyed is the work of Tarski on the decision procedure for algebra and geometry, the method of elimination of quantifiers, the semantics of formal languages, modeltheoretic preservation theorems, and algebraic logic; various connections of each with computer science are taken up

A Paraconsistent Higher Order Logic

Classical logic predicts that everything (thus nothing useful at all) follows from inconsistency. A paraconsistent logic is a logic where an inconsistency does not lead to such an explosion, and since in practice consistency is difficult to achieve there are many potential applications of paraconsistent logics in knowledge-based systems, logical semantics of natural language, etc. Higher order logics have the advantages of being expressive and with several automated theorem provers available. Also the type system can be helpful. We present a concise description of a paraconsistent higher order logic with countable infinite indeterminacy, where each basic formula can get its own indeterminate truth value (or as we prefer: truth code). The meaning of the logical operators is new and rather different from traditional many-valued logics as well as from logics based on bilattices. The adequacy of the logic is examined by a case study in the domain of medicine. Thus we try to build a bridge between the HOL and MVL communities. A sequent calculus is proposed based on recent work by Muskens.Comment: Originally in the proceedings of PCL 2002, editors Hendrik Decker, Joergen Villadsen, Toshiharu Waragai (http://floc02.diku.dk/PCL/). Correcte

Willard Van Orman Quine's Philosophical Development in the 1930s and 1940s

As analytic philosophy is becoming increasingly aware of and interested in its own history, the study of that field is broadening to include, not just its earliest beginnings, but also the mid-twentieth century. One of the towering figures of this epoch is W.V. Quine (1908-2000), champion of naturalism in philosophy of science, pioneer of mathematical logic, trying to unite an austerely physicalist theory of the world with the truths of mathematics, psychology, and linguistics. Quine's posthumous papers, notes, and drafts revealing the development of his views in the forties have recently begun to be published, as well as careful philosophical studies of, for instance, the evolution of his key doctrine that mathematical and logical truth are continuous with, not divorced from, the truths of natural science. But one central text has remained unexplored: Quine's Portuguese-language book on logic, his 'farewell for now' to the discipline as he embarked on an assignment in the Navy in WWII. Anglophone philosophers have neglected this book because they could not read it. Jointly with colleagues, I have completed the first full English translation of this book. In this accompanying paper I draw out the main philosophical contributions Quine made in the book, placing them in their historical context and relating them to Quine's overall philosophical development during the period. Besides significant developments in the evolution of Quine's views on meaning and analyticity, I argue, this book is also driven by Quine's indebtedness to Russell and Whitehead, Tarski, and Frege, and contains crucial developments in his thinking on philosophy of logic and ontology. This includes early versions of some arguments from 'On What There Is', four-dimensionalism, and virtual set theory

"Revolution? What Revolution?" Successes and limits of computing technologies in philosophy and religion

Computing technologies like other technological innovations in the modern West are inevitably introduced with the rhetoric of "revolution". Especially during the 1980s (the PC revolution) and 1990s (the Internet and Web revolutions), enthusiasts insistently celebrated radical changes— changes ostensibly inevitable and certainly as radical as those brought about by the invention of the printing press, if not the discovery of fire.\ud These enthusiasms now seem very "1990s�—in part as the revolution stumbled with the dot.com failures and the devastating impacts of 9/11. Moreover, as I will sketch out below, the patterns of diffusion and impact in philosophy and religion show both tremendous success, as certain revolutionary promises are indeed kept—as well as (sometimes spectacular) failures. Perhaps we use revolutionary rhetoric less frequently because the revolution has indeed succeeded: computing technologies, and many of the powers and potentials they bring us as scholars and religionists have become so ubiquitous and normal that they no longer seem "revolutionary at all. At the same time, many of the early hopes and promises instantiated in such specific projects as Artificial Intelligence and anticipations of virtual religious communities only have been dashed against the apparently intractable limits of even these most remarkable technologies. While these failures are usually forgotten they leave in their wake a clearer sense of what these new technologies can, and cannot do

The Design of the Fifth Answer Set Programming Competition

Answer Set Programming (ASP) is a well-established paradigm of declarative programming that has been developed in the field of logic programming and nonmonotonic reasoning. Advances in ASP solving technology are customarily assessed in competition events, as it happens for other closely-related problem-solving technologies like SAT/SMT, QBF, Planning and Scheduling. ASP Competitions are (usually) biennial events; however, the Fifth ASP Competition departs from tradition, in order to join the FLoC Olympic Games at the Vienna Summer of Logic 2014, which is expected to be the largest event in the history of logic. This edition of the ASP Competition series is jointly organized by the University of Calabria (Italy), the Aalto University (Finland), and the University of Genova (Italy), and is affiliated with the 30th International Conference on Logic Programming (ICLP 2014). It features a completely re-designed setup, with novelties involving the design of tracks, the scoring schema, and the adherence to a fixed modeling language in order to push the adoption of the ASP-Core-2 standard. Benchmark domains are taken from past editions, and best system packages submitted in 2013 are compared with new versions and solvers. To appear in Theory and Practice of Logic Programming (TPLP).Comment: 10 page