- Table View
- List View
Log-Linear Models (Springer Texts in Statistics)
by Ronald ChristensenThis book examines log-linear models for contingency tables. Logistic re gression and logistic discrimination are treated as special cases and gener alized linear models (in the GLIM sense) are also discussed. The book is designed to fill a niche between basic introductory books such as Fienberg (1980) and Everitt (1977) and advanced books such as Bishop, Fienberg, and Holland (1975), Haberman (1974), and Santner and Duffy (1989). lt is primarily directed at advanced Masters degree students in Statistics but it can be used at both higher and lower levels. The primary theme of the book is using previous knowledge of analysis of variance and regression to motivate and explicate the use of log-linear models. Of course, both the analogies and the distinctions between the different methods must be kept in mind. The book is written at several levels. A basic introductory course would take material from Chapters I, II (deemphasizing Section II. 4), III, Sec tions IV. 1 through IV. 5 (eliminating the material on graphical models), Section IV. lü, Chapter VII, and Chapter IX. The advanced modeling ma terial at the end of Sections VII. 1, VII. 2, and possibly the material in Section IX. 2 should be deleted in a basic introductory course. For Mas ters degree students in Statistics, all the material in Chapters I through V, VII, IX, and X should be accessible. For an applied Ph. D.
Log-Linear Models and Logistic Regression (Springer Texts in Statistics)
by Ronald ChristensenThe primary focus here is on log-linear models for contingency tables, but in this second edition, greater emphasis has been placed on logistic regression. The book explores topics such as logistic discrimination and generalised linear models, and builds upon the relationships between these basic models for continuous data and the analogous log-linear and logistic regression models for discrete data. It also carefully examines the differences in model interpretations and evaluations that occur due to the discrete nature of the data. Sample commands are given for analyses in SAS, BMFP, and GLIM, while numerous data sets from fields as diverse as engineering, education, sociology, and medicine are used to illustrate procedures and provide exercises. Throughoutthe book, the treatment is designed for students with prior knowledge of analysis of variance and regression.
Logarithmic Potentials with External Fields (Grundlehren der mathematischen Wissenschaften #316)
by Edward B. Saff Vilmos TotikIn recent years approximation theory and the theory of orthogonal polynomials have witnessed a dramatic increase in the number of solutions of difficult and previously untouchable problems. This is due to the interaction of approximation theoretical techniques with classical potential theory (more precisely, the theory of logarithmic potentials, which is directly related to polynomials and to problems in the plane or on the real line). Most of the applications are based on an exten sion of classical logarithmic potential theory to the case when there is a weight (external field) present. The list of recent developments is quite impressive and includes: creation of the theory of non-classical orthogonal polynomials with re spect to exponential weights; the theory of orthogonal polynomials with respect to general measures with compact support; the theory of incomplete polynomials and their widespread generalizations, and the theory of multipoint Pade approximation. The new approach has produced long sought solutions for many problems; most notably, the Freud problems on the asymptotics of orthogonal polynomials with a respect to weights of the form exp(-Ixl ); the "l/9-th" conjecture on rational approximation of exp(x); and the problem of the exact asymptotic constant in the rational approximation of Ixl. One aim of the present book is to provide a self-contained introduction to the aforementioned "weighted" potential theory as well as to its numerous applications. As a side-product we shall also fully develop the classical theory of logarithmic potentials.
Logarithmic Potentials with External Fields (Grundlehren der mathematischen Wissenschaften #316)
by Edward B. Saff Vilmos TotikThis is the second edition of an influential monograph on logarithmic potentials with external fields, incorporating some of the numerous advancements made since the initial publication. As the title implies, the book expands the classical theory of logarithmic potentials to encompass scenarios involving an external field. This external field manifests as a weight function in problems dealing with energy minimization and its associated equilibria. These weighted energies arise in diverse applications such as the study of electrostatics problems, orthogonal polynomials, approximation by polynomials and rational functions, as well as tools for analyzing the asymptotic behavior of eigenvalues for random matrices, all of which are explored in the book. The theory delves into diverse properties of the extremal measure and its logarithmic potentials, paving the way for various numerical methods. This new, updated edition has been thoroughly revised and is reorganized into three parts, Fundamentals, Applications and Generalizations, followed by the Appendices. Additions to the new edition include: new material on the following topics: analytic and C² weights, differential and integral formulae for equilibrium measures, constrained energy problems, vector equilibrium problems, and a probabilistic approach to balayage and harmonic measures; a new chapter entitled Classical Logarithmic Potential Theory, which conveniently summarizes the main results for logarithmic potentials without external fields; several new proofs and sharpened forms of some main theorems; expanded bibliographic and historical notes with dozens of additional references. Aimed at researchers and students studying extremal problems and their applications, particularly those arising from minimizing specific integrals in the presence of an external field, this book assumes a firm grasp of fundamental real and complex analysis. It meticulously develops classical logarithmic potential theory alongside the more comprehensive weighted theory.
Logarithms and Antilogarithms: An Algebraic Analysis Approach (Mathematics and Its Applications #437)
by D. Przeworska-Rolewicz
Logic: From Foundations To Applications - European Logic Colloquium (A\pelican Original Ser. #No. 3)
by Wilfrid HodgesIf a man supports Arsenal one day and Spurs the next then he is fickle but not necessarily illogical. From this starting point, and assuming no previous knowledge of logic, Wilfrid Hodges takes the reader through the whole gamut of logical expressions in a simple and lively way. Readers who are more mathematically adventurous will find optional sections introducing rather more challenging material. 'A lively and stimulating book' Philosophy
Logic: a Brief Course (UNITEXT)
by Daniele MundiciThis short book, geared towards undergraduate students of computer science and mathematics, is specifically designed for a first course in mathematical logic. A proof of Gödel's completeness theorem and its main consequences is given using Robinson's completeness theorem and Gödel's compactness theorem for propositional logic. The reader will familiarize himself with many basic ideas and artifacts of mathematical logic: a non-ambiguous syntax, logical equivalence and consequence relation, the Davis-Putnam procedure, Tarski semantics, Herbrand models, the axioms of identity, Skolem normal forms, nonstandard models and, interestingly enough, proofs and refutations viewed as graphic objects. The mathematical prerequisites are minimal: the book is accessible to anybody having some familiarity with proofs by induction. Many exercises on the relationship between natural language and formal proofs make the book also interesting to a wide range of students of philosophy and linguistics.
Logic, Algebra, and Computation: International Summer School (NATO ASI Subseries F: #79)
by F. L. Bauer W. Brauer G. Huet J. A. Robinson H. SchwichtenbergThe Marktoberdorf Summer Schools on Informatics were started in 1970, with the intention to convene every second or third year a group of top researchers in computing, devoted to preach their most recent results to an elite of advanced students - young and most promising people - and prepared to stand their questions, criticism and suggestions. The themes of these Advanced Study In stitutes under the sponsorship of the NATO Scientific Affairs Division varied slightly over the years, oscillating more or less around Programming Methodo logy, as the following list shows: 1970 Data Structures and Computer Systems 1971 Program Structures and Fundamental Concepts of Programming 1973 Structured Programming and Programmed Structures 1975 Language Hierarchies and Interfaces 1978 Program Construction 1981 Theoretical Foundations of Programming Methodology 1984 Control Flow and Data Flow: Concepts of Distributed Programming 1986 Logic of Programming and Calculi of Discrete Design 1988 Constructive Methods in Computing Science 1989 Logic, Algebra, and Computation Logic, Algebra, and Computation is the theme of the summer school to which this volume is devoted. It is the tenth in succession, but it is also the first in a new series (the "blue" series) that is intended to alternate in future with the traditional (the "red" series) arrangement; in fact the tenth summer school in the "red" series with the title "Programming and Mathematical Method" , held in 1990, was the subject of celebrating both its serial number and the twenty years of Marktoberdorf Summer Schools altogether.
Logic and Algebra (Lecture Notes In Pure And Applied Mathematics Ser.)
by Aldo Ursini and Paolo Aglianò""Attempts to unite the fields of mathematical logic and general algebra. Presents a collection of refereed papers inspired by the International Conference on Logic and Algebra held in Siena, Italy, in honor of the late Italian mathematician Roberto Magari, a leading force in the blossoming of research in mathematical logic in Italy since the 1960s.
Logic and Algebra (Lecture Notes In Pure And Applied Mathematics Ser.)
by Aldo Ursini""Attempts to unite the fields of mathematical logic and general algebra. Presents a collection of refereed papers inspired by the International Conference on Logic and Algebra held in Siena, Italy, in honor of the late Italian mathematician Roberto Magari, a leading force in the blossoming of research in mathematical logic in Italy since the 1960s.
Logic and Algebra of Specification (NATO ASI Subseries F: #94)
by Friedrich L. Bauer Wilfried Brauer Helmut SchwichtenbergFor some years, specification of software and hardware systems has been influenced not only by algebraic methods but also by new developments in logic. These new developments in logic are partly based on the use of algorithmic techniques in deduction and proving methods, but are alsodue to new theoretical advances, to a great extent stimulated by computer science, which have led to new types of logic and new logical calculi. The new techniques, methods and tools from logic, combined with algebra-based ones, offer very powerful and useful tools for the computer scientist, which may soon become practical for commercial use, where, in particular, more powerful specification tools are needed for concurrent and distributed systems. This volume contains papers based on lectures by leading researchers which were originally given at an international summer school held in Marktoberdorf in 1991. The papers aim to give a foundation for combining logic and algebra for the purposes of specification under the aspects of automated deduction, proving techniques, concurrency and logic, abstract data types and operational semantics, and constructive methods.
Logic and Argumentation: 4th International Conference, CLAR 2021, Hangzhou, China, October 20–22, 2021, Proceedings (Lecture Notes in Computer Science #13040)
by Christoph Benzmüller Yì N. Wáng Pietro BaroniThis book constitutes the refereed proceedings of the 4th International Conference on Logic and Argumentation, CLAR 2021, held in Hangzhou, China, in October 2021. The 20 full and 10 short papers presented together with 5 invited papers were carefully reviewed and selected from 58 submissions. The topics of accepted papers cover the focus of the CLAR series, including formal models of argumentation, a variety of logic formalisms, nonmonotonic reasoning, dispute and dialogue systems, formal treatment of preference and support, and well as applications in areas like vaccine information and processing of legal texts.
Logic and Argumentation: 5th International Conference, CLAR 2023, Hangzhou, China, September 10-12, 2023, Proceedings (Lecture Notes in Computer Science #14156)
by Andreas Herzig Jieting Luo Pere PardoThis book constitutes the refereed proceedings of the 5th International Conference on Logic and Argumentation, CLAR 2023, held in Hangzhou, China, during September 10-12, 2023. The 11 full papers, one short paper and one invited paper presented in this book were carefully reviewed and selected from 20 submissions. The papers focus on topics such as: logic and automated deduction; abstract and structured argumentation; dialogues, games and practical reasoning; and quantitative argumentation.
Logic and Complexity (Discrete Mathematics and Theoretical Computer Science)
by Richard Lassaigne Michel de RougemontLogic and Complexity looks at basic logic as it is used in Computer Science, and provides students with a logical approach to Complexity theory. With plenty of exercises, this book presents classical notions of mathematical logic, such as decidability, completeness and incompleteness, as well as new ideas brought by complexity theory such as NP-completeness, randomness and approximations, providing a better understanding for efficient algorithmic solutions to problems. Divided into three parts, it covers: - Model Theory and Recursive Functions - introducing the basic model theory of propositional, 1st order, inductive definitions and 2nd order logic. Recursive functions, Turing computability and decidability are also examined. - Descriptive Complexity - looking at the relationship between definitions of problems, queries, properties of programs and their computational complexity. - Approximation - explaining how some optimization problems and counting problems can be approximated according to their logical form. Logic is important in Computer Science, particularly for verification problems and database query languages such as SQL. Students and researchers in this field will find this book of great interest.
Logic and Computer Science: Lectures given at the 1st Session of the Centro Internazionale Matematico Estivo (C.I.M.E.) held at Montecatini Terme, Italy, June 20-28, 1988 (Lecture Notes in Mathematics #1429)
by Steven Homer Anil Nerode Richard A. Platek Gerald E. Sacks Andre ScedrovThe courses given at the 1st C.I.M.E. Summer School of 1988 dealt with the main areas on the borderline between applied logic and theoretical computer science. These courses are recorded here in five expository papers: S. Homer: The Isomorphism Conjecture and its Generalization.- A. Nerode: Some Lectures on Intuitionistic Logic.- R.A. Platek: Making Computers Safe for the World. An Introduction to Proofs of Programs. Part I. - G.E. Sacks: Prolog Programming.- A. Scedrov: A Guide to Polymorphic Types.
Logic and Discrete Mathematics: A Concise Introduction
by Willem Conradie Valentin GorankoA concise yet rigorous introduction to logic and discrete mathematics. This book features a unique combination of comprehensive coverage of logic with a solid exposition of the most important fields of discrete mathematics, presenting material that has been tested and refined by the authors in university courses taught over more than a decade. The chapters on logic - propositional and first-order - provide a robust toolkit for logical reasoning, emphasizing the conceptual understanding of the language and the semantics of classical logic as well as practical applications through the easy to understand and use deductive systems of Semantic Tableaux and Resolution. The chapters on set theory, number theory, combinatorics and graph theory combine the necessary minimum of theory with numerous examples and selected applications. Written in a clear and reader-friendly style, each section ends with an extensive set of exercises, most of them provided with complete solutions which are available in the accompanying solutions manual. Key Features: Suitable for a variety of courses for students in both Mathematics and Computer Science. Extensive, in-depth coverage of classical logic, combined with a solid exposition of a selection of the most important fields of discrete mathematics Concise, clear and uncluttered presentation with numerous examples. Covers some applications including cryptographic systems, discrete probability and network algorithms. Logic and Discrete Mathematics: A Concise Introduction is aimed mainly at undergraduate courses for students in mathematics and computer science, but the book will also be a valuable resource for graduate modules and for self-study.
Logic and Discrete Mathematics: A Concise Introduction
by Willem Conradie Valentin GorankoA concise yet rigorous introduction to logic and discrete mathematics. This book features a unique combination of comprehensive coverage of logic with a solid exposition of the most important fields of discrete mathematics, presenting material that has been tested and refined by the authors in university courses taught over more than a decade. The chapters on logic - propositional and first-order - provide a robust toolkit for logical reasoning, emphasizing the conceptual understanding of the language and the semantics of classical logic as well as practical applications through the easy to understand and use deductive systems of Semantic Tableaux and Resolution. The chapters on set theory, number theory, combinatorics and graph theory combine the necessary minimum of theory with numerous examples and selected applications. Written in a clear and reader-friendly style, each section ends with an extensive set of exercises, most of them provided with complete solutions which are available in the accompanying solutions manual. Key Features: Suitable for a variety of courses for students in both Mathematics and Computer Science. Extensive, in-depth coverage of classical logic, combined with a solid exposition of a selection of the most important fields of discrete mathematics Concise, clear and uncluttered presentation with numerous examples. Covers some applications including cryptographic systems, discrete probability and network algorithms. Logic and Discrete Mathematics: A Concise Introduction is aimed mainly at undergraduate courses for students in mathematics and computer science, but the book will also be a valuable resource for graduate modules and for self-study.
Logic and Discrete Mathematics: A Concise Introduction, Solutions Manual
by Willem Conradie Valentin Goranko Claudette RobinsonSolutions manual to accompany Logic and Discrete Mathematics: A Concise Introduction This book features a unique combination of comprehensive coverage of logic with a solid exposition of the most important fields of discrete mathematics, presenting material that has been tested and refined by the authors in university courses taught over more than a decade. Written in a clear and reader-friendly style, each section ends with an extensive set of exercises, most of them provided with complete solutions which are available in this accompanying solutions manual.
Logic and Discrete Mathematics: A Concise Introduction, Solutions Manual
by Willem Conradie Valentin Goranko Claudette RobinsonSolutions manual to accompany Logic and Discrete Mathematics: A Concise Introduction This book features a unique combination of comprehensive coverage of logic with a solid exposition of the most important fields of discrete mathematics, presenting material that has been tested and refined by the authors in university courses taught over more than a decade. Written in a clear and reader-friendly style, each section ends with an extensive set of exercises, most of them provided with complete solutions which are available in this accompanying solutions manual.
Logic and Foundations of Mathematics: Selected Contributed Papers of the Tenth International Congress of Logic, Methodology and Philosophy of Science, Florence, August 1995 (Synthese Library #280)
by Andrea Cantini Ettore Casari Pierluigi MinariThe IOth International Congress of Logic, Methodology and Philosophy of Science, which took place in Florence in August 1995, offered a vivid and comprehensive picture of the present state of research in all directions of Logic and Philosophy of Science. The final program counted 51 invited lectures and around 700 contributed papers, distributed in 15 sections. Following the tradition of previous LMPS-meetings, some authors, whose papers aroused particular interest, were invited to submit their works for publication in a collection of selected contributed papers. Due to the large number of interesting contributions, it was decided to split the collection into two distinct volumes: one covering the areas of Logic, Foundations of Mathematics and Computer Science, the other focusing on the general Philosophy of Science and the Foundations of Physics. As a leading choice criterion for the present volume, we tried to combine papers containing relevant technical results in pure and applied logic with papers devoted to conceptual analyses, deeply rooted in advanced present-day research. After all, we believe this is part of the genuine spirit underlying the whole enterprise of LMPS studies.
Logic and Games on Automatic Structures: Playing with Quantifiers and Decompositions (Lecture Notes in Computer Science #6810)
by Lukasz KaiserThe evaluation of a logical formula can be viewed as a game played by two opponents, one trying to show that the formula is true and the other trying to prove it is false. This correspondence has been known for a very long time and has inspired numerous research directions. In this book, the author extends this connection between logic and games to the class of automatic structures, where relations are recognized by synchronous finite automata.In model-checking games for automatic structures, two coalitions play against each other with a particular kind of hierarchical imperfect information. The investigation of such games leads to the introduction of a game quantifier on automatic structures, which connects alternating automata with the classical model-theoretic notion of a game quantifier. This study is then extended, determining the memory needed for strategies in infinitary games on the one hand, and characterizing regularity-preserving Lindström quantifiers on the other. Counting quantifiers are investigated in depth: it is shown that all countable omega-automatic structures are in fact finite-word automatic and that the infinity and uncountability set quantifiers are definable in MSO over countable linear orders and over labeled binary trees.This book is based on the PhD thesis of Lukasz Kaiser, which was awarded with the E.W. Beth award for outstanding dissertations in the fields of logic, language, and information in 2009. The work constitutes an innovative study in the area of algorithmic model theory, demonstrating the deep interplay between logic and computability in automatic structures. It displays very high technical and presentational quality and originality, advances significantly the field of algorithmic model theory and raises interesting new questions, thus emerging as a fruitful and inspiring source for future research.
Logic and Grammar: Essays Dedicated to Alain Lecomte on the Occasion of His 60th Birthday (Lecture Notes in Computer Science #6700)
by Sylvain Pogodalla Myriam Quatrini Christian RetoréThis book contains selected papers from the Colloquium in Honor of Alain Lecomte, held in Pauillac, France, in November 2007. The event was part of the ANR project "Prélude" (Towards Theoretical Pragmatics Based on Ludics and Continuation Theory), the proceedings of which were published in another FoLLI-LNAI volume (LNAI 6505) edited by Alain Lecomte and Samuel Tronçon. The selected papers of this Festschrift volume focus on the scientific areas in which Alain Lecomte has worked and to which he has contributed: formal linguistics, computational linguistics, logic, and cognition.
Logic and Implication: An Introduction to the General Algebraic Study of Non-classical Logics (Trends in Logic #57)
by Petr Cintula Carles NogueraThis monograph presents a general theory of weakly implicative logics, a family covering a vast number of non-classical logics studied in the literature, concentrating mainly on the abstract study of the relationship between logics and their algebraic semantics. It can also serve as an introduction to (abstract) algebraic logic, both propositional and first-order, with special attention paid to the role of implication, lattice and residuated connectives, and generalized disjunctions.Based on their recent work, the authors develop a powerful uniform framework for the study of non-classical logics. In a self-contained and didactic style, starting from very elementary notions, they build a general theory with a substantial number of abstract results. The theory is then applied to obtain numerous results for prominent families of logics and their algebraic counterparts, in particular for superintuitionistic, modal, substructural, fuzzy, and relevant logics.The book may be of interest to a wide audience, especially students and scholars in the fields of mathematics, philosophy, computer science, or related areas, looking for an introduction to a general theory of non-classical logics and their algebraic semantics.
Logic and Integer Programming (International Series in Operations Research & Management Science #130)
by H. Paul WilliamsPaul Williams, a leading authority on modeling in integer programming, has written a concise, readable introduction to the science and art of using modeling in logic for integer programming. Written for graduate and postgraduate students, as well as academics and practitioners, the book is divided into four chapters that all avoid the typical format of definitions, theorems and proofs and instead introduce concepts and results within the text through examples. References are given at the end of each chapter to the more mathematical papers and texts on the subject, and exercises are included to reinforce and expand on the material in the chapter. Methods of solving with both logic and IP are given and their connections are described. Applications in diverse fields are discussed, and Williams shows how IP models can be expressed as satisfiability problems and solved as such.
Logic and Its Applications: 6th Indian Conference, ICLA 2015, Mumbai, India, January 8-10, 2015. Proceedings (Lecture Notes in Computer Science #8923)
by Mohua Banerjee Krishna S.This book collects the refereed proceedings of the 6th Indian Conference on Logic and Its Applications, ICLA 2015, held in Mumbai, India, in January 2015. The volume contains 13 full revised papers along with 3 invited talks presented at the conference. The papers were selected after rigorous review, from 23 submissions. They cover topics related to pure and applied formal logic, foundations and philosophy of mathematics and the sciences, set theory, model theory, proof theory, areas of theoretical computer science, artificial intelligence, systems of logic in the Indian tradition, and other disciplines which are of direct interest to mathematical and philosophical logic.