This volume is devoted to the main areas of mathematical logic and applications to computer science. There are articles on weakly o-minimal theories, algorithmic complexity of relations, models within the computable model theory, hierarchies of randomness tests, computable numberings, and complexity problems of minimal unsatisfiable formulas. The problems of characterization of the deduction-detachment theorem, Δ1-induction, completeness of Leśniewski's systems, and reduction calculus for the satisfiability problem are also discussed.The coverage includes the answer to Kanovei's question about the upper bound for the complexity of equivalence relations by convergence at infinity for continuous functions. The volume also gives some applications to computer science such as solving the problems of inductive interference of languages from the full collection of positive examples and some negative data, the effects of random negative data, methods of formal specification and verification on the basis of model theory and multiple-valued logics, interval fuzzy algebraic systems, the problems of information exchange among agents on the base topological structures, and the predictions provided by inductive theories.
This volume is devoted to the main areas of mathematical logic and applications to computer science. There are articles on weakly o-minimal theories, algorithmic complexity of relations, models within the computable model theory, hierarchies of randomness tests, computable numberings, and complexity problems of minimal unsatisfiable formulas. The problems of characterization of the deduction-detachment theorem, o 1 -induction, completeness of Leoniewski''s systems, and reduction calculus for the satisfiability problem are also discussed. The coverage includes the answer to Kanovei''s question about the upper bound for the complexity of equivalence relations by convergence at infinity for continuous functions. The volume also gives some applications to computer science such as solving the problems of inductive interference of languages from the full collection of positive examples and some negative data, the effects of random negative data, methods of formal specification and verification on the basis of model theory and multiple-valued logics, interval fuzzy algebraic systems, the problems of information exchange among agents on the base topological structures, and the predictions provided by inductive theories. Sample Chapter(s). Chapter 1: Another Characterization of the Deduction-Detachment Theorem (535 KB). Contents: Another Characterization of the Deduction-Detachment Theorem (S V Babyonyshev); On Behavior of 2-Formulas in Weakly o-Minimal Theories (B S Baizhanov & B Sh Kulpeshov); Arithmetic Turing Degrees and Categorical Theories of Computable Models (E Fokina); Negative Data in Learning Languages (S Jain & E Kinber); Effective Cardinals in the Nonstandard Universe (V Kanovei & M Reeken); Model-Theoretic Methods of Analysis of Computer Arithmetic (S P Kovalyov); The Functional Completeness of Leoniewski''s Systems (F Lepage); Hierarchies of Randomness Tests (J Reimann & F Stephan); Intransitive Linear Temporal Logic Based on Integer Numbers, Decidability, Admissible Logical Consecutions (V V Rybakov); The Logic of Prediction (E Vityaev); Conceptual Semantic Systems Theory and Applications (K E Wolff); Complexity Results on Minimal Unsatisfiable Formulas (X Zhao); and other papers. Readership: Researchers in mathematical logic and algebra, computer scientists in artificial intelligence and fuzzy logic."
Patrick Suppes is a philosopher and scientist whose contributions range over probability and statistics, mathematical and experimental psychology, the foundations of physics, education theory, the philosophy of language, measurement theory, and the philosophy of science. He has also been a pioneer in the area of computer assisted instruction. In each of these areas, Suppes has provided seminal ideas that in some cases led to shaping the direction of research in the field. The papers contained in this collection were commissioned with the mandate of advancing research in their respective fields rather than retrospectively surveying the contributions that Suppes himself has made. The authors form an interesting mixture of researchers in both formal philosophy of science and science itself all of whom have been inspired by his ideas. To maintain the spirit of constructive dialogue that characterizes Suppes's intellectual style, he has written individual responses to each article. In Volume 1: Probability and Probabilistic Causality, nineteen distinguished philosophers and scientists focus their attention on probabilistic issues. In Part I the contributors explore axiomatic representations of probability theory including qualitative and interval valued probabilities as well as traditional point valued probabilities. Belief structures and the dynamics of belief are also treated in detail. In Part II the rapidly growing field of probabilistic causation is assessed from both formal and empirical viewpoints. For probability theorists, statisticians, economists, philosophers of science, psychologists and those interested in the foundations of mathematical social science. In Volume 2: Philosophy of Physics, Theory Structure, and Measurement Theory, fifteen distinguished philosophers and scientists cover a wide variety of topics. Part III covers issues in quantum theory, geometry, classical mechanics, and computational physics. Part IV explores Suppes's well known set-theoretic account of scientific theories which has served him well throughout his career. Suppes's contributions to measurement theory have been widely used in mathematical psychology and elsewhere, and this material is the subject of Part V. For physicists, logicians, workers in mathematical social sicence, and philosophers of science. In Volume 3: Philosophy of Language and Logic, Learning and Action Theory, fourteen distinguished philosophers and scientists explore issues in the philosophy of language, logic, and philosophical psychology. Suppes's suggestions that quantum theory requires a rethinking of classical logic form a particularly sharp account of that controversial thesis, and Part VI deals with this issue together with topics in the philosophy of language and logic, including relational grammars and anaphora. Part VII deals with issues in psychology, action theory, and robotics, while Part VIII concludes with a general survey of Suppes's views in the philosophy of science. A comprehensive chronological and topical bibliography of Suppes's writings is included in this volume. For philosophers of language, theoretical linguists, logicians, workers in mathematical social sciences, and philosophers of science.
This volume is the result of a conference held at the University of California, Irvine, on the topics that provide its title -- choice, decision, and measurement. The conference was planned, and the volume prepared, in honor of Professor R. Duncan Luce on his 70th birthday. Following a short autobiographical statement by Luce, the volume is organized into four topics, to each of which Luce has made significant contributions. The book provides an overview of current issues in each area and presents some of the best recent theoretical and empirical work. Personal reflections on Luce and his work begin each section. These reflections were written by outstanding senior researchers: Peter Fishburn (Preference and Decision Making), Patrick Suppes (Measurement Theory and Axiomatic Systems), William J. McGill (Psychophysics and Reaction Time), and W.K. Estes (Choice, Identification and Categorization). The first section presents recent theoretical and empirical work on descriptive models of decision making, and theoretical results on general probabilistic models of choice and ranking. Luce's recent theoretical and empirical work on rank- and sign-dependent utility theory is important in many of these contributions. The second section presents results from psychophysics, probabilistic measurement, aggregation of expert opinion, and test theory. The third section presents various process oriented models, with supportive data, for tasks such as redundant signal detection, forced choice, and absolute identification. The final section contains theory and data on categorization and attention, and general theoretical results for developing and testing models in these domains.
This volume presents the proceedings from the Eleventh Brazilian Logic Conference on Mathematical Logic held by the Brazilian Logic Society (co-sponsored by the Centre for Logic, Epistemology and the History of Science, State University of Campinas, São Paolo) in Salvador, Bahia, Brazil. The conference and the volume are dedicated to the memory of professor Mário Tourasse Teixeira, an educator and researcher who contributed to the formation of several generations of Brazilian logicians. Contributions were made from leading Brazilian logicians and their Latin-American and European colleagues. All papers were selected by a careful refereeing processs and were revised and updated by their authors for publication in this volume. There are three sections: Advances in Logic, Advances in Theoretical Computer Science, and Advances in Philosophical Logic. Well-known specialists present original research on several aspects of model theory, proof theory, algebraic logic, category theory, connections between logic and computer science, and topics of philosophical logic of current interest. Topics interweave proof-theoretical, semantical, foundational, and philosophical aspects with algorithmic and algebraic views, offering lively high-level research results.
The two internationally renowned authors elucidate the structure of "fast" parallel computation. Its complexity is emphasised through a variety of techniques ranging from finite combinatorics, probability theory and finite group theory to finite model theory and proof theory. Non-uniform computation models are studied in the form of Boolean circuits; uniform ones in a variety of forms. Steps in the investigation of non-deterministic polynomial time are surveyed as is the complexity of various proof systems. Providing a survey of research in the field, the book will benefit advanced undergraduates and graduate students as well as researchers.
Gert H. Muller The growth of the number of publications in almost all scientific areas, as in the area of (mathematical) logic, is taken as a sign of our scientifically minded culture, but it also has a terrifying aspect. In addition, given the rapidly growing sophistica tion, specialization and hence subdivision of logic, researchers, students and teachers may have a hard time getting an overview of the existing literature, partic ularly if they do not have an extensive library available in their neighbourhood: they simply do not even know what to ask for! More specifically, if someone vaguely knows that something vaguely connected with his interests exists some where in the literature, he may not be able to find it even by searching through the publications scattered in the review journals. Answering this challenge was and is the central motivation for compiling this Bibliography. The Bibliography comprises (presently) the following six volumes (listed with the corresponding Editors): I. Classical Logic W. Rautenberg II. Non-classical Logics W. Rautenberg III. Model Theory H. -D. Ebbinghaus IV. Recursion Theory P. G. Hinman V. Set Theory A. R. Blass VI. Proof Theory; Constructive Mathematics J. E. Kister; D. van Dalen & A. S. Troelstra.
This book constitutes the refereed proceedings of the 9th International Latin American Symposium on Theoretical Informatics, LATIN 2010, held in Oaxaca, Mexico; in April 2010. The 56 revised full papers presented together with the abstracts of 4 invited plenary talks were carefully reviewed and selected from 155 submissions. The papers address a variety of topics in theoretical computer science with a certain focus on algorithms, automata theory and formal languages, coding theory and data compression, algorithmic graph theory and combinatorics, complexity theory, computational algebra, computational biology, computational geometry, computational number theory, cryptography, theoretical aspects of databases and information retrieval, data structures, networks, logic in computer science, machine learning, mathematical programming, parallel and distributed computing, pattern matching, quantum computing and random structures.
