Jaakko Hintikka / Dept. of Philosophy, Boston University, MA, USA
Is a genuine logic of scientific discovery
possible? In the essays collected here,
Hintikka not only defends an affirmative
answer; he also outlines such a logic.
It is the logic of questions and answers.
Thus inquiry in the sense of
knowledge-seeking becomes inquiry in the
sense of interrogation. Using this
new logic, Hintikka establishes a result
that will undoubtedly be considered the
fundamental theorem of all epistemology,
viz., the virtual identity of optimal
strategies of pure discovery with optimal
deductive strategies. Questions to
Nature, of course, must include observations
and experiments. Hintikka shows,
in fact, how the logic of experimental inquiry
can be understood from the
interrogative vantage point. Other important
topics examined include
induction (in a forgotten sense that has
nevertheless played a role in science),
explanation, the incommensurability of theories,
theory-ladenness of
observations, and identifiability.
Contents
Introduction. 1. Is Logic the Key to All
Good Reasoning? 2. The Role of Logic
in Argumentation. 3. Interrogative Logic
as a General Theory of Reasoning. 4.
What is Abduction? The Fundamental Problem
of Contemporary Epistemology.
5. True and False Logics of Scientific Discovery.
6. A Spectrum of Logic of
Questioning. 7. What is the Logic of Experimental
Inquiry? 8. The Concept of
Induction in the Light of the Interrogative
Approach to Inquiry. 9. Semantics
and Pragmatics for Why-Questions. 10. The
Varieties of Information and
Scientific Explanation. 11. On the Incommensurability
of Theories. 12.
Theory-Ladenness of Observations as a Test
Case of Kuhn's Approach to
Scientific Inquiry. 13. Ramsey Sentences
and the Meaning of Quantifiers. 14.
Towards a General Theory of Identifiability.
Kluwer Academic Publishers, Dordrecht
Hardbound, ISBN 0-7923-5477-X
June 1999, 304 pp.
--------------------------------------------------------------------------------
edited by
Paul W. Humphreys / Corcoran Dept. of Philosophy,
University of Virginia, Charlottesville,
USA
James H. Fetzer / Dept. of Philosophy, University
of Minnesota, Duluth, USA
SYNTHESE LIBRARY
Volume 270
This collection of essays is the definitive
version of a widely discussed debate
over the origins of the New Theory of Reference.
In new articles written
especially for this volume, Quentin Smith
and Scott Soames, the original
participants in the debate, elaborate their
positions on who was responsible
for the ideas that Saul Kripke presented
in his Naming and Necessity. They
are joined by John Burgess, who weighs in
on the side of Soames, while Smith
adds a further dimension in discussing the
contributions of philosophers such
as F?llesdal, Geach, Hintikka, and Plantinga.
Also included are lengthy
excerpts from F?llesdal's 1961 Harvard dissertation
and a careful examination
by Sten Lindstr?m of the respective contributions
of Kripke and Stig Kanger to
the development of modal semantics. The collection
will be essential reading
for anyone acquainted with these influential
ideas.
Contents and Contributors
Introduction; P. Humphreys, J.H. Fetzer.
Part I: The APA Exchange.
Marcus, Kripke, and the Origin of the New
Theory of Reference; Q. Smith.
Revisionism about Reference: A Reply to Smith;
S. Soames. Marcus and the
New Theory of Reference: A Reply to Scott
Soames; Q. Smith. Part II:
Replies. More Revisionism About Reference;
S. Soames. Marcus, Kripke, and
Names; J.P. Burgess. How Not to Write History
of Philosophy: A Case Study;
J.P. Burgess. Direct, Rigid Designation and
A Posteriori Necessity: A History
and Critique; Q. Smith. Part III: Historical
Origins. Referential Opacity
and Modal Logic; D. F?llesdal. An Exposition
and Development of Kanger's
Early Semantics for Modal Logic; S. Lindstr?m.
A More Comprehensive History
of the New Theory of Reference; Q. Smith.
Index of Names. Index of Subjects.
Kluwer Academic Publishers, Dordrecht
Hardbound, ISBN 0-7923-4898-2
May 1998, 304 pp.
Paperback, ISBN 0-7923-5578-4
--------------------------------------------------------------------------------
edited by
Giovanni Sartor / The Queen's University
of Belfast, Northern Ireland
L. Karl Branting / The University of Wyoming,
USA
The judiciary is in the early stages of a
transformation in which AI (Artificial
Intelligence) technology will help to make
the judicial process faster, cheaper,
and more predictable without compromising
the integrity of judges'
discretionary reasoning. Judicial decision-making
is an area of daunting
complexity, where highly sophisticated legal
expertise merges with cognitive
and emotional competence. How can AI contribute
to a process that
encompasses such a wide range of knowledge,
judgment, and experience?
Rather than aiming at the impossible dream
(or nightmare) of building an
automatic judge, AI research has had two
more practical goals: producing
tools to support judicial activities, including
programs for intelligent document
assembly, case retrieval, and support for
discretionary decision-making; and
developing new analytical tools for understanding
and modeling the judicial
process, such as case-based reasoning and
formal models of dialectics,
argumentation, and negotiation.
Judges, squeezed between tightening budgets
and increasing demands for
justice, are desperately trying to maintain
the quality of their decision-making
process while coping with time and resource
limitations. Flexible AI tools for
decision support may promote uniformity and
efficiency in judicial practice,
while supporting rational judicial discretion.
Similarly, AI may promote
flexibility, efficiency and accuracy in other
judicial tasks, such as drafting
various judicial documents. The contributions
in this volume exemplify some of
the directions that the AI transformation
of the judiciary will take.
Contents and Contributors
ntroduction: Judicial Applications of Artificial
Intelligence; G. Sartor, L.K.
Branting. Automating Judicial Document Drafting:
A Discourse-Based
Approach; L.K. Branting, et al. Criminal
Sentencing and Intelligent Decision
Support; U.J. Schild. The Application of
Judicial Intelligence and `Rules' to
Systems Supporting Discretionary Judicial
Decision-Making; C. Tata. Modelling
Reasoning with Precedents in a Formal Dialogue
Game; H. Prakken, G. Sartor.
The Judge and the Computer: How Best `Decision
Support'? P. Leith. Judicial
Decisions and Artificial Intelligence; M.
Taruffo.
Kluwer Academic Publishers, Dordrecht
Hardbound, ISBN 0-7923-5472-9
December 1998, 224 pp.
--------------------------------------------------------------------------------
Vladimir S. Lerner / Computer Science Dept., National University, Inglewood, CA, USA
THE KLUWER INTERNATIONAL SERIES IN ENGINEERING
AND COMPUTER SCIENCE Volume 532
Information Macrodynamics (IMD) presents
the unified information systemic
approach with common information language
for modeling, analysis and
optimization of a variety of interactive
processes, such as physical, biological,
economical, social, and informational, including
human activities.
Comparing it with thermodynamics, which deals
with transformation energy
and represents a theoretical foundation of
physical technology, IMD deals with
transformation information, and can be considered
a theoretical foundation of
Information Computer Technology (ICT). ICT
includes but is not limited to
applied computer science, computer information
systems, computer and data
communications, software engineering, and
artificial intelligence. In ICT,
information flows from different data sources,
and interacts to create new
information products. The information flows
may interact physically or via
their virtual connections, initiating an
information dynamic process that can
be distributed in space.
As in physics, a problem is understanding
general regularities of the
information processes in terms of information
law, for the engineering and
technological design, control, optimization,
and development of computer
technology, operations, manipulations, and
management of real information
objects.
Information Systems Analysis and Modeling:
An Information Macrodynamics
Approach belongs to an interdisciplinary
science that represents the new
theoretical and computer-based methodology
for system informational
description and improvement, including various
activities in such
interdisciplinary areas as thinking, intelligent
processes, management, and
other nonphysical subjects with their mutual
interactions, informational
superimpositions, and the information transferred
between interactions.
Information Systems Analysis and Modeling:
An Information Macrodynamics
Approach can be used as a textbook or secondary
text in courses on
computer science, engineering, business,
management, education, and
psychology and as a reference for research
and industry.
Contents
Preface. Acknowledgments. Introduction. 1.
Mathematical Foundations of
Informational Macrodynamics. 1.1 Information
Variational Principle. 1.2
The Space Distributed Macromodel. 1.3 The
optimal time-space distributed
macromodel with consolidated states (OPMC).
2. Information Systems
Modeling. 2.1 Informations systems theory
and IMD. 2.2 Some General
Information Macrosystemic Functions. 3. Information-Physical
Models
and Analogies. 4. Solution of the Applied
IMD problems. 4.1
Analytical and Numerical Solutions. 4.2 Data
Modeling and Communications.
4.3Cognitive Modeling in Artificial Intelligence.
4.4 The Information Network
for Performance Evaluation in Education.
4.5 The Information Dynamic Model
of Macroeconomics. 4.6 The Information Macromodels
in Biology and
Medicine. 4.7 Industrial Technology's IMD
Applications and Implementations.
Conclusion. Index.
Kluwer Academic Publishers, Boston
Hardbound, ISBN 0-7923-8683-3
October 1999, 336 pp.
--------------------------------------------------------------------------------
Graeme Smith / Software Verification Research
Centre, University of Queensland, Australia
ADVANCES IN FORMAL METHODS Volume 1
Object-Z is an object-oriented extension
of the formal specification language
Z. It adds to Z notions of classes and objects,
and inheritance and
polymorphism. By extending Z's semantic basis,
it enables the specification of
systems as collections of independent objects
in which self and mutual
referencing are possible.
The Object-Z Specification Language presents
a comprehensive description
of Object-Z including discussions of semantic
issues, definitions of all language
constructs, type rules and other rules of
usage, specification guidelines, and a
full concrete syntax. It will enable you
to confidently construct Object-Z
specifications and is intended as a reference
manual to keep by your side as
you use and learn to use Object-Z.
The Object-Z Specification Language is suitable
as a textbook or as a
secondary text for a graduate-level course,
and as a reference for
researchers and practitioners in industry.
Contents
Preface. 1. Introduction. 2. Semantic Basis.
3. Syntactic Constructs. 4.
Language Definition. 5. Concurrent Systems.
6. Concrete Syntax.
Bibliography. Index.
Kluwer Academic Publishers, Boston
Hardbound, ISBN 0-7923-8684-1
October 1999, 160 pp.
--------------------------------------------------------------------------------
edited by
Tibor Csendes / Jozsef Attila University,
Szeged, Hungary
The present volume contains 30 articles presented
at SCAN-98, Budapest,
Hungary. These papers cover all aspects of
validation techniques in scientific
computing, ranging from hardware requirements,
elementary operations, high
accuracy function evaluations and interval
arithmetic to advanced validating
techniques and applications in various fields
of practical interest.
Audience: This book is of interest to researchers
and graduate students
whose work involves validation techniques
in scientific computing.
Contents and Contributors
Preface. Rigorous Global Search: Industrial
Applications; G.F. Corliss, R.B.
Kearfott. Influences of Rounding Errors in
Solving Large Sparse Linear
Systems; A. Facius. A Hardware Approach to
Interval Arithmetic for Sine and
Cosine Functions; J. Hormigo, et al. Towards
an Optimal Control of the
Wrapping Effect; W. K?hn. On Existence and
Uniqueness of Solutions of Linear
Algebraic Equations in Kaucher's Interval
Arithmetic; A.V. Lakeyev. A
Comparison of Subdivision Strategies for
Verified Multi-Dimensional Gaussian
Quadrature; B. Lang. INTLAB EINTerval LABoratory;
S.M. Rump. Verified
Calculation of the Solution of Algebraic
Riccati Equation; W. Luther, W. Otten.
Expression Concepts in Scientific Computing;
M. Lerch. Performance
Evaluation Technique STU and libavi Library;
R. Sagula, et al. Single-Number
Intrval I/O; M. Schulte, et al. Interval
Analysis for Embedded Systems; K.
Musch, G. Schumacher. Prediction by Extrapolation
for Interval Tightening
Methods; Y. Lebbah, O. Lhomme. The Contribution
of T. Sunaga to Interval
Analysis and Reliable Computing; S. Markov,
K. Okumura. Surface-to-Surface
Intersection with Complete and Guaranteed
Results; E. Hubert, W. Barth. An
Algorithm that Computes a Lower Bound on
the Distance Between a Segment
and 2; V. Lef?vre. Verified Computation of
Fast Decreasing Polynomials; N.S.
Dimitrova, S.M. Markov. An Accurate Distance-Calculation
Algorithm for
Convex Polyhedra; E. Dyllong, et al. Verified
Error Bounds for Linear Systems
through the Lanczos Process; A. Frommer,
A. Weinberg. A Representation of
the Interval Hull of a Tolerance Polyhedron
Describing Inclusions of Function
Values and Slopes; G. Heindl. A Few Results
on Table-Based Methods; J.-M.
Muller. An Interval Hermite-Obreschkoff Method
for Computing Rigorous
Bounds on the Solution of an Initial Value
Problem for an Ordinary Differential
Equation; N.S. Nedialkov, K.R. Jackson. The
Interval-Enhanced GNU Fortran
Compiler; M. Schulte, et al. Outer Estimation
of Generalized Solution Sets to
Interval Linear Systems; S.P. Shary. A Real
Polynomial Decision Algorithm
Using Arbitrary-Precision Floating Point
Arithmetic; A. Strzebonski. A
Numerical Verification Method of Solutions
for the Navier-Stokes Equations;
Y. Watanabe, et al. Convex Sets of Full Rank
Matrices; B. Kolodziejczak, T.
Szulc. Multiaspect Interval Types; M. Lerch,
J.W. von Gudenberg.
MATLAB-Based Analysis of Roundoff Noise;
R. Dunay, I. Koll?r. SCAN-98
Collected Bibliography; G.F. Corliss.
Kluwer Academic Publishers, Dordrecht
Hardbound, ISBN 0-7923-6057-5
November 1999, 412 pp.
--------------------------------------------------------------------------------
Henk C.A. van Tilborg
Dept. of Mathematics and Computing Science,
Eindhoven University of Technology, The Netherlands
THE KLUWER INTERNATIONAL SERIES IN ENGINEERING
AND COMPUTER SCIENCE Volume 528
The protection of sensitive information against
unauthorized access or
fraudulent changes has been of prime concern
throughout the centuries.
Modern communication techniques, using computers
connected through
networks, make all data even more vulnerable
to these threats. In addition,
new issues have surfaced that did not exist
previously, e.g. adding a signature
to an electronic document.
Cryptology addresses the above issues Eit
is at the foundation of all
information security. The techniques employed
to this end have become
increasingly mathematical in nature. Basic
Concepts in Cryptology serves as
an introduction to modern cryptographic methods.
After a brief survey of
classical cryptosystems, it concentrates
on three main areas. First, stream
ciphers and block ciphers are discussed.
These systems have extremely fast
implementations, but sender and receiver
must share a secret key. Second,
the book presents public key cryptosystems,
which make it possible to protect
data without a prearranged key. Their security
is based on intractable
mathematical problems, such as the factorization
of large numbers. The
remaining chapters cover a variety of topics,
including zero-knowledge proofs,
secret sharing schemes and authentication
codes. Two appendices explain all
mathematical prerequisites in detail: one
presents elementary number theory
(Euclid's Algorithm, the Chinese Remainder
Theorem, quadratic residues,
inversion formulas, and continued fractions)
and the other introduces finite
fields and their algebraic structure.
Basic Concepts in Cryptology is an updated
and improved version of An
Introduction to Cryptology, originally published
in 1988. Apart from a revision
of the existing material, there are many
new sections, and two new chapters
on elliptic curves and authentication codes,
respectively. In addition, the book
is accompanied by a full text electronic
version on CD-ROM as an interactive
Mathematica manuscript.
Basic Concepts in Cryptology will be of interest
to computer scientists,
mathematicians, and researchers, students,
and practitioners in the area of
cryptography.
Contents
Preface. 1. Introduction. 2. Classical Cryptosystems.
3. Shift Register
Sequences. 4. Block Ciphers. 5. Shannon Theory.
6. Data Compression
Techniques. 7. Public-Key Cryptography. 8.
Discrete Logarithm Based
Systems. 9. RSA Based Systems. 10. Elliptic
Curves Based Systems. 11.
Coding Theory Based Systems. 12. Knapsack
Based Systems. 13. Hash
Codes & Authentication Techniques. 14.
Zero Knowledge Protocols. 15.
Secret Sharing Systems. A. Elementary Number
Theory. B. Finite Fields. C.
Relevant Famous Mathematicians. D. New Functions.
References. Symbols
and Notations. Index.
Kluwer Academic Publishers, Boston
Hardbound, ISBN 0-7923-8675-2
November 1999, 512 pp.
--------------------------------------------------------------------------------
John S. Avery
H.C. Orsted Institute, University of Copenhagen,
Denmark
PROGRESS IN THEORETICAL CHEMISTRY AND PHYSICS
Volume 4
This book explores the connections between
the theory of hyperspherical
harmonics, momentum-space quantum theory,
and generalized Sturmian basis
functions; and it introduces methods which
may be used to solve
many-particle problems directly, without
the use of the self-consistent-field
approximation. The method of many-electron
Sturmians offers an interesting
and fresh alternative to the usual SCF–CI
methods for calculating atomic and
molecular structure. When many-electron Sturmians
are used, and when the
basis potential is chosen to be the attractive
potential of the nuclei in the
system, the following advantages are offered:
the matrix representation of the
nuclear attraction potential is diagonal;
the kinetic energy term vanishes from
the secular equation; the Slater exponents
of the atomic orbitals are
automatically optimized; convergence is rapid;
a correlated solution to the
many-electron problem can be obtained directly,
without the use of the SCF
approximation; and excited states can be
obtained with good accuracy.
Audience: The book will be of interest to
advanced students and research
workers in theoretical chemistry, physics
and mathematics.
Contents
ntroduction. 1. Many-Particle Sturmians.
2. Momentum-Space Wave
Functions. 3. Hyperspherical Harmonics. 4.
The Momentum-Space Wave
Equation. 5. Many-Center Potentials. 6. Iteration
of the Wave Equation. 7.
Molecular Sturmians. 8. Relativistic Effects.
A. Generalized Slater-Condon
Rules. B. Coulomb and Exchange Integrals
for Atoms. Solutions to the
Exercises. Bibliography. Index.
Kluwer Academic Publishers, Dordrecht
Hardbound, ISBN 0-7923-6087-7
December 1999, 208 pp.
--------------------------------------------------------------------------------
Roberto L.O. Cignoli / Dept. de Matematica,
Ciudad Universitaria, Buenos Aires, Argentina
Itala M.L. D'Ottaviano / CLE, Universidade
Estadual de Campinas, Brazil
Daniele Mundici / University of Milan, Italy
TRENDS IN LOGIC Volume 7
This unique textbook states and proves all
the major theorems of
many-valued propositional logic and provides
the reader with the most recent
developments and trends, including applications
to adaptive error-correcting
binary search. The book is suitable for self-study,
making the basic tools of
many-valued logic accessible to students
and scientists with a basic
mathematical knowledge who are interested
in the mathematical treatment of
uncertain information. Stressing the interplay
between algebra and logic, the
book contains material never before published,
such as a simple proof of the
completeness theorem and of the equivalence
between Chang's MV algebras
and Abelian lattice-ordered groups with unit
Ea necessary prerequisite for
the incorporation of a genuine addition operation
into fuzzy logic. Readers
interested in fuzzy control are provided
with a rich deductive system in which
one can define fuzzy partitions, just as
Boolean partitions can be defined and
computed in classical logic. Detailed bibliographic
remarks at the end of each
chapter and an extensive bibliography lead
the reader on to further
specialised topics.
Contents
Introduction. 1. Basic notions. 2. Chang
completeness theorem. 3. Free
MV-algebras. 4. Lukasiewicz ¥-valued calculus.
5. Ulam's game. 6.
Lattice-theoretical properties. 7. MV-algebras
and l-groups. 8. Varieties of
MV-algebras. 9. Advanced topics. 10. Further
Readings. Bibliography. Index.
Kluwer Academic Publishers, Dordrecht
Hardbound, ISBN 0-7923-6009-5
December 1999, 244 pp.