Association for Symbolic Logic
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Volume 16, Number 1
2 International Journal "Information Theories & Applications" Vol.16 / 2009 International Journal INFORMATION THEORIES & APPLICATIONS Volume 16 / 2009, Number 1 Editor in chief: Krassimir Markov (Bulgaria) International Editorial Staff Chairman: Victor Gladun (Ukraine) Adil Timofeev (Russia) Ilia Mitov (Bulgaria) Aleksey Voloshin (Ukraine) Juan Castellanos (Spain) Alexander Eremeev (Russia) Koen Vanhoof (Belgium) Alexander Kleshchev (Russia) Levon Aslanyan (Armenia) Alexander Palagin (Ukraine) Luis F. de Mingo (Spain) Alfredo Milani (Italy) Nikolay Zagoruiko (Russia) Anatoliy Krissilov (Ukraine) Peter Stanchev (Bulgaria) Anatoliy Shevchenko (Ukraine) Rumyana Kirkova (Bulgaria) Arkadij Zakrevskij (Belarus) Stefan Dodunekov (Bulgaria) Avram Eskenazi (Bulgaria) Tatyana Gavrilova (Russia) Boris Fedunov (Russia) Vasil Sgurev (Bulgaria) Constantine Gaindric (Moldavia) Vitaliy Lozovskiy (Ukraine) Eugenia Velikova-Bandova (Bulgaria) Vitaliy Velichko (Ukraine) Galina Rybina (Russia) Vladimir Donchenko (Ukraine) Gennady Lbov (Russia) Vladimir Jotsov (Bulgaria) Georgi Gluhchev (Bulgaria) Vladimir Lovitskii (GB) IJ ITA is official publisher of the scientific papers of the members of the ITHEA® International Scientific Society IJ ITA welcomes scientific papers connected with any information theory or its application. IJ ITA rules for preparing the manuscripts are compulsory. The rules for the papers for IJ ITA as well as the subscription fees are given on www.ithea.org . The camera-ready copy of the paper should be received by http://ij.ithea.org. Responsibility for papers published in IJ ITA belongs to authors. General Sponsor of IJ ITA is the Consortium FOI Bulgaria (www.foibg.com). International Journal “INFORMATION THEORIES & APPLICATIONS” Vol.16, Number 1, 2009 Printed in Bulgaria Edited by the Institute of Information Theories and Applications FOI ITHEA®, Bulgaria, in collaboration with the V.M.Glushkov Institute of Cybernetics of NAS, Ukraine, and the Institute of Mathematics and Informatics, BAS, Bulgaria. -
Pdf Attachment
Association for Symbolic Logic Business Office: Box 742, Vassar College 124 Raymond Avenue, Poughkeepsie, New York 12604, USA Fax: 1-845-437-7830; email: [email protected] Web: http://www.aslonline.org ASL NEWSLETTER November 2013 In Memoriam: Mikhail A. Taitslin. Mikhail A. Taitslin passed away on July 20, 2013 in Tver, Russia, • where he had lived and worked for the last three decades of his life. He was a devoted husband and father, whose high-level research bridged areas of mathematics and computer science. He was a well-respected educator and mentor of students. Mikhail Taitslin was born into a family of medical research scientists on January 30, 1936 in Kiev, Ukraine. His father perished in WWII while serving as a doctor, and his mother raised their son alone. He received his undergraduate degree from the Lugansk Pedagogical Institute in 1957, and then started work as a school mathematics teacher while maintaining and developing an interest in higher mathematics. His continuing interest in higher mathematics led Taitslin to read a paper by Anatoly I. Maltsev, a leading Soviet algebraist and logician. The young mathematics teacher noticed an inaccuracy within the article of which he immediately wrote to the author. This started a correspondence between the young Taitslin and Maltsev which led to Taitslin’s move to the Ivanovo Pedagogical Institute, where Maltsev worked at the time. Later in 1960, he followed Maltsev to Akademgorodok, the newly opened scientific and educational centre in Novosibirsk. M.A. Taitslin earned his Ph.D in 1963, under the direction of Maltsev, and the Doctor of Sciences degree in 1968. -
New Computational Paradigmsnew Computational Paradigms
Lecture Notes in Computer Science 3526 Commenced Publication in 1973 Founding and Former Series Editors: Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen Editorial Board David Hutchison Lancaster University, UK Takeo Kanade Carnegie Mellon University, Pittsburgh, PA, USA Josef Kittler University of Surrey, Guildford, UK Jon M. Kleinberg Cornell University, Ithaca, NY, USA Friedemann Mattern ETH Zurich, Switzerland John C. Mitchell Stanford University, CA, USA Moni Naor Weizmann Institute of Science, Rehovot, Israel Oscar Nierstrasz University of Bern, Switzerland C. Pandu Rangan Indian Institute of Technology, Madras, India Bernhard Steffen University of Dortmund, Germany Madhu Sudan Massachusetts Institute of Technology, MA, USA Demetri Terzopoulos New York University, NY, USA Doug Tygar University of California, Berkeley, CA, USA Moshe Y. Vardi Rice University, Houston, TX, USA Gerhard Weikum Max-Planck Institute of Computer Science, Saarbruecken, Germany S. Barry Cooper Benedikt Löwe Leen Torenvliet (Eds.) New Computational Paradigms First Conference on Computability in Europe, CiE 2005 Amsterdam, The Netherlands, June 8-12, 2005 Proceedings 13 Volume Editors S. Barry Cooper University of Leeds School of Mathematics Leeds, LS2 9JT, UK E-mail: [email protected] Benedikt Löwe Leen Torenvliet Universiteit van Amsterdam Institute for Logic, Language and Computation Plantage Muidergracht 24, 1018 TV Amsterdam, NL E-mail: {bloewe,leen}@science.uva.nl Library of Congress Control Number: 2005926498 CR Subject Classification (1998): F.1.1-2, F.2.1-2, F.4.1, G.1.0, I.2.6, J.3 ISSN 0302-9743 ISBN-10 3-540-26179-6 Springer Berlin Heidelberg New York ISBN-13 978-3-540-26179-7 Springer Berlin Heidelberg New York This work is subject to copyright. -
Computability and Complexity in Analysis Schloß Dagstuhl, November 11–16, 2001
Dagstuhl-Seminar 01461 on Computability and Complexity in Analysis Schloß Dagstuhl, November 11–16, 2001 Organizers: Vasco Brattka (Hagen), Peter Hertling (Hagen), Mariko Yasugi (Kyoto), Ning Zhong (Cincinnati). Preface This meeting was the third Dagstuhl seminar which was concerned with the theory of computability and complexity over the real numbers. This theory, which is built on the Turing machine model, was initiated by Turing, Grzegorczyk, Lacombe, Banach and Mazur, and has seen a rapid growth in recent years. Recent monographs are by Pour- El/Richards, Ko, and Weihrauch. Computability theory and complexity theory are two central areas of research in the- oretical computer science. Until recently, most work in these areas concentrated on prob- lems over discrete structures. In the last years, though, there has been an enormous growth of computability theory and complexity theory over the real numbers and other continuous structures. One of the reasons for this phenomenon is that more and more practical computation problems over the real numbers are being dealt with by computer scientists, for example, in computational geometry, in the modelling of dynamical and hybrid systems, but also in classical problems from numerical mathematics. The scien- tists working on these questions come from different fields, such as theoretical computer science, domain theory, logic, constructive mathematics, computer arithmetic, numerical mathematics, analysis etc. This Dagstuhl seminar provided a unique opportunity for 46 participants from such diverse areas and 12 different countries to meet and exchange ideas and knowledge. One of the topics of interest was foundational work concerning the various models and approaches for defining or describing computability and complexity over the real numbers. -
Curriculum Vitae
Roussanka Loukanova Curriculum Vitae Roussanka Loukanova September 30, 2021 Contents I CV R´esum´e3 1 Education and Degrees3 2 Academic Qualification4 3 Pedagogic Training4 4 Employment and Association4 4.1 Present...........................................4 4.2 Former Positions......................................4 4.3 Visiting Positions and Fellowships............................5 II Scientific Profile6 5 Expertise 6 6 Experience with Software Packages7 III Pedagogic Profile7 7 Experience in Teaching7 7.1 Courses Taught and Developed..............................8 8 Experience as a Supervisor9 8.1 Supervision of Bachelor and Master's Theses......................9 8.2 Supervision of Ph.D. Students...............................9 8.3 Participation in Evaluation Committees of M.Sc. and Ph.D. Theses.........9 9 Training in Teaching and Learning in Higher Education9 10 Some Pedagogical Work and Teaching Materials 10 IV Grants 10 V Scholarly Activities 13 1 / 27 Roussanka Loukanova 11 Scientific Organizations, Committees 13 11.1 Organization Committees................................. 13 11.2 Reviewing and Member of Program Committees.................... 15 11.2.1 Area Supervisory Committee........................... 15 11.2.2 Program Committees............................... 15 12 Other International Engagements 16 12.1 Tutorials........................................... 16 12.2 Some Conference and Seminar Participation, Talks, Presentations........... 16 VI Scientific Works 18 13 Work in Progress 18 14 List of Publications 19 14.1 Publications -
Sponsorship Options Is Attached
WELCOME Vienna Summer of Logic (VSL 2014) is the largest conference in history of logic and computer science, to be held in Vienna, Austria, from July 9 until July 24, 2014. It consists of three major blocks of conferences and represents a landmark scientific event which will be held only once. It will bring together about 2,500 researchers and academics from all over the world gathering to present important findings and new trends and challenges in all disciplines related to logic. These are the three major blocks of the Vienna Summer of Logic: Logic and Computer Science (Federated Logic Conference/FLoC) Logic and Artificial Intelligence and Mathematical Logic The Federated Logic Conference (FLoC) FLoC is held only every four years and represents itself the largest re-occurring event in the field. It consists of the following sub-conferences: - Computer Aided Verification Conference (CAV) - The Computer Security Foundations Symposium (CSF) - International Conference on Logic Programming (ICLP) - International Joint Conference on Automated Reasoning (IJCAR) - International Conference on Interactive Theorem Proving (ITP) - Logic in Computer Science Conference (LICS) joint with - Computer Science Logic Conference (CSL) for the first time in history - Rewriting Techniques and Application conference (RTA) - The International Conference on Theory and Applications of Satisfiability Testing (SAT) and - Over one hundred workshops. Logic and Artificial Intelligence Principles of Knowledge Representation and Reasoning, Incorporated (KR, Inc.) is a Scientific Foundation incorporated in the state of Massachusetts of the United States of America concerned with fostering research and communication on knowledge representation and reasoning. Its primary activities include organizing a series of prestigious conferences, the Conferences on Principles of Knowledge Representation and Reasoning one of the most prominent conferences in AI. -
Association for Symbolic Logic
Association for Symbolic Logic Business Office: Box 742, Vassar College 124 Raymond Avenue, Poughkeepsie, New York 12604, USA Fax: 1-845-437-7830; email: [email protected] Web: http://www.aslonline.org ASL NEWSLETTER April 2014 • 2013 Karp Prize to be Awarded at Logic Colloquium 2014. The eighth Carol Karp Prize is to be jointly awarded to Moti Gitik for his work in set theory, especially applications of large-cardinal forcings to pcf-theory, and to Ya'acov Peterzil, Jonathan Pila, Sergei Starchenko and Alex Wilkie for their work in model theory, especially as applied to questions in number theory. The prizes will be awarded at the ASL European Summer Meeting (Logic Colloquium) in July. The Karp Prize, established in 1973 in memory of Professor Carol Karp, is awarded every five years. The award is made by the Association, on recommendation of the ASL Committee on Prizes and Awards, for a \connected body of research, most of which has been completed in the time since the previous prize was awarded." The winners will share a $5,000 cash award. Lectures on the prize-winning work will be delivered at the award ceremony. • 2014 Sacks Prize. The ASL invites nominations for the 2014 Sacks Prize for the most outstanding doctoral dissertation in mathematical logic. Nominations must be received by September 30, 2014. The Sacks Prize was established to honor Professor Gerald Sacks of MIT and Harvard for his unique contribution to mathematical logic, particularly as adviser to a large number of excellent Ph.D. students. The Prize was first awarded in 1994 and became an ASL Prize in 1999. -
CCA 2018 Abstract Booklet
Conference Programme The conference takes place at Georg-von-Vollmar Academy Schloss Aspenstein Am Aspensteinbichl 9-11 82431 Kochel am See Bavaria, Germany Phone: +49 8851 780 Fax: +49 8851 7823 Sunday, August the 5th 14:15 Opening 14:30 Florian Steinberg (Invited Talk) A simple universal machine of type two and a formal proof of its correctness 15:30 Coffee Break 16:00 Michal Konecný Verified exact real limit computation 16:30 Franz Brauße, Norbert Müller, and Robert Rettinger Intensionality and multi-valued limits 17:00 Eike Neumann On the computability of the Fréchet distance of surfaces in the bit-model of real computation 17:30 Chansu Park Tensor calculus in exact real computation - From recursive analysis to abstract data types: a case study 18:00 Dinner Monday, August the 6th 08:00 Breakfast 09:00 Daniel Graça (Invited Talk) Computing the asymptotic behavior of continuous-time dynamical systems 10:00 Coffee Break 10:30 Diogo Poças (Invited Talk) Analog computability with differential equations 11:30 Christoph Spandl Computable series expansions in celestial mechanics 12:00 Xiang Huang, Jack H. Lutz, and Andrei N. Migunov Algorithmic randomness in chemical reaction networks 12:30 Lunch 14:00 Pieter Collins (Invited Talk) Rigorous numerical computing with Ariadne 15:00 Florian Steinberg coqrep: A Coq library for representations 15:30 Coffee Break 16:00 Svetlana Selivanova and Victor Selivanov Bit complexity of computing solutions of boundary-value problems for some systems of PDEs with guaranteed precision 16:30 Ivan Koswara, Svetlana -
Characterization Theorem for the Conditionally Computable Real Functions
Logical Methods in Computer Science Vol. 13(3:3)2017, pp. 1–17 Submitted Mar. 14, 2016 www.lmcs-online.org Published Jul. 6, 2017 CHARACTERIZATION THEOREM FOR THE CONDITIONALLY COMPUTABLE REAL FUNCTIONS IVAN GEORGIEV Prof. D-r Asen Zlatarov University, bul. Prof. Yakimov 1, Burgas, Bulgaria e-mail address: [email protected] Abstract. The class of uniformly computable real functions with respect to a small subrecursive class of operators computes the elementary functions of calculus, restricted to compact subsets of their domains. The class of conditionally computable real functions with respect to the same class of operators is a proper extension of the class of uniformly computable real functions and it computes the elementary functions of calculus on their whole domains. The definition of both classes relies on certain transformations of infinitistic names of real numbers. In the present paper, the conditional computability of real functions is characterized in the spirit of Tent and Ziegler, avoiding the use of infinitistic names. Introduction This paper is in the field of computable analysis, where mathematical analysis meets classical computability theory. Some of the basic objects, which are studied in computable analysis are those real numbers and real functions, which can be computed using algorithms. Alan Turing gave in [12] the first definition for the notion of computable real number { this is a real number, whose decimal representation can be computed by a Turing machine. It is well-known that several other representations of real numbers lead to an equivalent notion, although the use of fast converging Cauchy sequences of rational numbers seems most natural when developing computable analysis. -
The Design of the Fifth Answer Set Programming Competition 3 the Main Goal of the Competition Series
Under consideration for publication in Theory and Practice of Logic Programming 1 The Design of the Fifth Answer Set Programming Competition Francesco Calimeri and Francesco Ricca Dipartimento di Matematica e Informatica, Universit`adella Calabria, Italy Martin Gebser∗ Helsinki Institute for Information Technology HIIT Department of Information and Computer Science, School of Science, Aalto University, Finland Marco Maratea Dipartimento di Informatica, Bioingegneria, Robotica e Ingegneria dei Sistemi, Universit`adi Genova, Italy submitted 1 January 2003; revised 1 January 2003; accepted 1 January 2003 Abstract 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 tech- nology 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) bien- nial 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. -
Curriculum Vitae
Roussanka Loukanova Curriculum Vitae Roussanka Loukanova July 18, 2021 Contents I CV R´esum´e3 1 Education and Degrees3 2 Academic Qualification4 3 Pedagogic Training4 4 Employment and Association4 4.1 Present...........................................4 4.2 Former Positions......................................4 4.3 Visiting Positions and Fellowships............................5 II Scientific Profile6 5 Expertise 6 6 Experience with Software Packages7 III Pedagogic Profile7 7 Experience in Teaching7 7.1 Courses Taught and Developed..............................8 8 Experience as a Supervisor9 8.1 Supervision of Bachelor and Master's Theses......................9 8.2 Supervision of Ph.D. Students...............................9 8.3 Participation in Evaluation Committees of M.Sc. and Ph.D. Theses.........9 9 Training in Teaching and Learning in Higher Education9 10 Some Pedagogical Work and Teaching Materials 10 IV Grants 10 V Scholarly Activities 13 1 / 27 Roussanka Loukanova 11 Scientific Organizations, Committees 13 11.1 Organization Committees................................. 13 11.2 Reviewing and Member of Program Committees.................... 15 11.2.1 Area Supervisory Committee........................... 15 11.2.2 Program Committees............................... 15 12 Other International Engagements 16 12.1 Tutorials........................................... 16 12.2 Some Conference and Seminar Participation, Talks, Presentations........... 16 VI Scientific Works 18 13 Work in Progress 18 14 List of Publications 19 14.1 Publications -
Theory and Applications of Computability
Theory and Applications of Computability In cooperation with the association Computability in Europe Series editors Laurent Bienvenu Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier (LIRMM) Montpellier France [email protected] Paola Bonizzoni Università degli Studi di Milano-Bicocca Dipartimento di Informatica Sistemistica e Comunicazione (DISCo) Milano Italy [email protected] Vasco Brattka Universität der Bundeswehr München Fakultät für Informatik Neubiberg Germany University of Cape Town Department of Mathematics & Applied Mathematics Rondebosch South Africa [email protected] Elvira Mayordomo Universidad de Zaragoza Departamento de Informática e Ingeniería de Sistemas Zaragoza Spain [email protected] Prakash Panangaden McGill University School of Computer Science Montreal Canada [email protected] Founding Editors: P. Bonizzoni, V. Brattka, S.B. Cooper, E. Mayordomo Books published in this series will be of interest to the research community and graduate students, with a unique focus on issues of computability. The perspective of the series is multidisciplinary, recapturing the spirit of Turing by linking theoretical and real-world concerns from computer science, mathematics, biology, physics, and the philosophy of science. The series includes research monographs, advanced and graduate texts, and books that offer an original and informative view of computability and computational paradigms. Series Advisory Board Samson Abramsky, University of Oxford Eric Allender, Rutgers,