bluuebunny/crossref_metadata_2025_split huggingface dataset:
Banach and Locally Convex Algebras
Authors: Helemskii A YA 
Published: November 2023

Abstract
A reference textbook that summarizes the "algebra of analysis" that includes some mention of the contemporary trends in the development of history. This text provides an up-to-date account of Banach and locally convex algebras with emphasis on general theory, representations and homology. In its description of general theory and in the examples it considers it is faithful to earlier traditions in the subject but differs from those books in being based on an approach through homological algebra. This approach leads Helemskii to consider topics not covered at this level in any other book. These topics include: complemented and uncomplemented ideal; projective and weak tensor products of banach algebras; Taylors multivariable holomorphic functional calculus; the Wedderburn decomposition of Banach algevras; a whole chapter on the homology of Banach algebras.
On some rank 3 partial geometries
Authors: Hughes D R 
Published: November 2023

Abstract
Such geometries have been studied in a large number of special cases, and we wish to draw together some of these different results in this paper. In section 2 we give a survey of many known results; some of the material in this section was covered long ago in Buekenhout (1979), and we include it for completeness, and to make this paper easier to read. In section 3 we give some constructions of rank 3 pGs.
(40, 13, 4)-designs derived from strongly regular graphs
Authors: Spence E 
Published: November 2023

Abstract
In this article we consider (40, 27, 18) graphs, or more precisely, their complements, (40, 12, 2, 4) graphs, and show how they may be used to construct at least 389 non-isomorphic (40, 13, 4) designs. It turns out that many of these designs possess ovals, an oval being a set of four points, no three of which belong to the same block. We shall also describe, using maximal arcs, how these 389 designs themselves may be used to construct many 2-(10, 4,4) designs.
Geometric Quantization
Authors: Woodhouse N M J 
Published: November 2023

Abstract
The geometric approach to quantization was introduced by Kostant and Souriau more than twenty years ago. It has given valuable and lasting insights into the relationship between classical and quantum systems. It continues to be a popular research topic. The ideas have proved useful in pure mathematics, notably in representation theory, as well as in theoretical physics. The most recent applications have been in conformal field theory and in the Jones-Witten theory of knots. The original edition of this book was published in 1980. For this edition it has been completely revised and extensively rewritten. The presentation has been simplified and a large number of examples have been added. The material on field theory has been expanded.
Ordinal Arithmetic in IΔ0
Authors: Sommer Richard 
Published: November 2023

Abstract
We show that much of the basic theory of the ordinal functions and relations that are involved in proof-theoretic ordinal analysis, can be carried out in a very weak fragment of arithmetic, namely IΔ0 , on an arbitrary recursive ordinal. General conditions are given for the Δ0-representability of ordinal relations and functions, and IΔ0-provability of their basic properties.
Meta-languages, Reflection Principles and Self-Reference
Authors: Perlis Donald , Subrahrnanian V S 
Published: November 2023

Abstract
Self-reference or self-applicability is an important theme throughout computer science, from recursive programs to undecidability results, from compiler bootstrapping to program semantics. A relative latecomer to this list is artificial intelligence, for only recently has self-reference been seen as an important attribute of intelligent systems. This chapter will give a bird’s-eye view of some of the issues surrounding self-reference in AI, especially those related to non-monotonicity, reification, and intentionality. The notions of meta-language and reflection principle will arise as natural concomitants of self-reference.
AI and Nonmonotonic Reasoning *
Authors: Ginsberg Matthew L 
Published: November 2023

Abstract
The view that Franklin was expressing is that virtually every conclusion we draw is an uncertain one. We all believe that the sun will rise tomorrow, but no one has a real proof of it. I believe that I have no brother, since if I did have one, I would know about it. But it is still possible that, unbeknownst to me, I have a brother after all.
The soundness and completeness of axioms for CSP processes
Authors: Blamey Stephen 
Published: November 2023

Abstract
A model for CSP-for example the classic failures model (Brookes et al. 1984)-is standardly presented as the totality of mathematical structures, of a specific type, that satisfy certain ‘axioms’. These structures are taken to represent processes and are used to interpret terms of CSP. Here, the value of looking for a more basic ‘implemen tational’ definition of a given model is stressed. Any explicit set of axioms will then be required to be sound and complete with respect to this definition.
Term Rewriting Systems
Authors: Klop1 J W 
Published: November 2023

Abstract
Term rewriting systems (TRSs) play an important role in various areas, such as abstract data type specifications, implementations of functional programming languages and automated deduction. In this chapter we introduce several of the basic concepts and facts for TRSs. Specifically, we discuss abstract reduction systems; general TRSs including an account of Knuth Bendix completion and (E-)unification; orthogonal TRSs and reduction strategies; strongly sequential orthogonal TRSs. The paper concludes with a discussion of conditional term rewriting systems. The emphasis throughout the chapter is on providing information of a syntactic nature.
Introduction
Authors: Hughes Barry d. 
Published: November 2023

Abstract
The elementary concepts of the theory of probability, and its first applications, arose in the seventeenth century from the study of games of chance. The application of probability to scientific and technological problems has a shorter history, confined in the main to the last hundred years. Probabilistic themes may now be identified in a myriad physical phenomena, and it is the development of two of these themes, the random process and the random system, that is the subject of the present work. The first theme has a longer history (100 years) than the second (30 to 40 years).
Random Walks And Random Flights
Authors: Hughes Barry d. 
Published: November 2023

Abstract
For the invention of the term ‘random walk’ we are indebted to the statistician Karl Pearson, who wrote the following brief letter (Pearson 1905a) to the English journal Nature, which appeared in the issue of 27 July 1905: The problem of the random walk Can any of your readers refer me to a work wherein I should find a solution of the following problem, or failing the knowledge of any existing solution provide me with an original one? I should be extremely grateful for aid in the matter.
An Introduction to Discrete Mathematics, Formal System Specification, and Z
Authors: Ince D C 
Published: November 2023

Abstract
Formal specification is the name given to the use of discrete mathematics in computer science for describing the function of both hardware and software systems. Poor specification often gives rise to severe problems in software and hardware installation. This textbook is an introduction to both the theory and practice of formal specification, and this new edition includes two new chapters on Z, one giving a number of small examples in Z, the other covering design and Z. Prerequisites in this edition have been kept to a minimum since Professor Ince is at pains to develop the techniques of requirement analysis and discrete mathematics that are needed. Throughout the book are numerous worked examples and exercises which include many real examples of software and computer systems.
Features and Fluents
Authors: Sandewall Erik 
Published: November 2023

Abstract
Techniques for reasoning about actions an change in the physical world is one of the classical research topics in artificial intelligence. It is motivated by the needs of autonomous robots which must be able to anticipate their immediate future, to plan their future actions, and to figure out what went wrong in case of problems. It is also motivated by the needs of common-SCDse reasoning for example in the understanding of natural language texts, where processes and change over time is an ever-preSCDt phenomenon. The same set of problems arises in several other areas of computing such as in conceptual modelling for data bases, and in the rapidly growing area of intelligent control. The preSCDt research monograph preSCDts and uses a novel methodology for reasoning about actions and change. Traditional research contributions have proposed new logic variants which were only supported by episodical examples. The work described here uses a systematic methodology for identifying the exact range of applicability of a given logic. For a number of previously proposed logics, as well as for some new ones, the preSCDt work characterizes exactly the class where it does not. This book will be a necessary source of reference for researchers in knowledge repreSCDtation, cognitive robotics, and intelligent control in the years to come. Particularly because of its emphasis on a strict and systematic methodology, it can also be recommended as a textbook for graduate university courses in these areas.
The Multi-Layer Perceptron
Authors: Bishop Christopher M 
Published: November 2023

Abstract
In Chapter 3, we discussed the properties of networks having a single layer of adaptive weights. Such networks have a number of important limitations in terms of the range of functions which they can represent. To allow for more general map pings we might consider successive transformations corresponding to networks having several layers of adaptive weights. In fact we shall see that networks with just two layers of weights are capable of approximating any continuous functional mapping. More generally we can consider arbitrary network diagrams (not necessarily having a simple layered structure) since any network diagram can be converted into its corresponding mapping function. The only restriction is that the diagram must be feed-forward, so that it contains no feedback loops. This ensures that the network outputs can be calculated as explicit functions of the inputs and the weights.
Error Functions
Authors: Bishop Christopher M 
Published: November 2023

Abstract
In previous chapters we have made use of the sum-of-squares error function, which was motivated primarily by analytical simplicity. There are many other possible choices of error function which can also be considered, depending on the particular application. In this chapter we shall describe a variety of different error functions and discuss their relative merits. For regression problems we shall see that the basic goal is to model the conditional distribution of the output variables, conditioned on the input variables. This motivates the use of a sum-of-squares error function, and several important properties of this error function will be explored in some detail.
Bayesian Techniques
Authors: Bishop Christopher M 
Published: November 2023

Abstract
In this chapter we consider the application of Bayesian inference techniques to neural networks. A simple example of the Bayesian approach was described in Section 2.3 where we considered the problem of inferring the mean of a one dimensional Gaussian distribution from a set of training data. In the context of neural networks, Bayesian methods offer a number of important features including the following: The conventional training method of error minimization arises from a particular approximation to the Bayesian approach. Regularization can be given a natural interpretation in the Bayesian frame work. For regression problems, error bars, or confidence intervals, can be assigned to the predictions generated by a network. Bayesian methods allow the values of regularization coefficients to be selected using only the training data, without the need to use separate train ing and validation data. Furthermore, the Bayesian approach allows relatively large numbers of regularization coefficients to be used, which would be computationally prohibitive if their values had to be optimized using cross-validation. Similarly, the Bayesian approach allows different models (e.g. networks with different numbers of hidden units, or different network types such as multi-layer perceptrons and radial basis function networks) to be compared using only the training data. More generally, it provides an objective and principled framework for dealing with the issues of model complexity which avoids many of the problems which arise when using maximum likelihood.
Exploiting user models to avoid misconstruals
Authors: Hemerly Andrea S , Casanova Marco A , Furtado Antonio L 
Published: November 2023

Abstract
When interacting with a database, a user is typically tempted to infer further information from that explicitly obtained from previous queries. However, his inferences are not necessarily valid, because his model of the world is often incomplete or even faulty. This chapter addresses the problem of avoiding users’ faulty inferences or misconstruals. It describes a cooperative interface to deductive databases that alters the processing of users’ requests to include additional information that will block faulty inferences. The interface is governed by predefined user models, created during the design of the database. It also maintains a log of previous interactions with each user that records all information he has already acquired in his current session. The inferences of a given user are identified with those possible from the user model and the information in ,the log. The main result of the chapter says that, given any user model and any deductive database, all logs produced by the interface indeed contain sufficient information to block all misconstruals.
Labelled abduction and relevance reasoning
Authors: Gabbay Dov , Kempson Ruth , Pitt Jeremy 
Published: November 2023

Abstract
The aim of this chapter is to explore modelling a more non-standard interaction between a human and a database. We try to equip the database with the capability of understanding queries in natural language and answering them in a more ‘intelligent’ manner than by mere yes/no factual answers. This capability of the database requires (at least) two components. First the database must possess a front-end logic module which can parse the natural language input I and translate it into a query (or update) Q1 in its own (logical) query language. Second, and in fact more difficult, it must cope with the logical patterns of human query and answer, which is logically more (non-monotonic) commonsense than ordinary query languages.
Simplex algorithms
Authors: Maros István , Mitra Gautam 
Published: November 2023

Abstract
Linear inequality systems were studied by Fourier, Motzkin and Farkas (see [14]) but only in the late 1940s did the work of Dantzig in the USA and Kantorovich in the former USSR make linear programming a leading research topic with wide ranging applications to problems of planning and scheduling as found in business, industry and government [14]. Dantzig developed the celebrated simplex method (in the tableau form) for finding the maximum or minimum of a linear function subject to linear restrictions. The resulting optimization problem because of its many planning applications was called linear programming (LP). Since that time there has been considerable curiosity driven research, as well as applicable research, on the topic of LP.
What is a Logical System?*
Authors: Avron Arnon 
Published: November 2023

Abstract
What is a logical system? Well, one possible answer is that this is what all mathematical logicians had thought they knew until they were seriously asked to give a precise answer Personally, I was forced to start thinking about this question when I participated, back in 1986, in the construction of the Edinburgh LF ([18], [21) - the first computerized system aiming to provide a ‘logical framework’ for implementing a variety of logical systems. The results of my first investigations on this question were published in [5]. They were further elaborated and extended in [7]. Below I shall heavily draw on these two papers, which still contain most of what I have to say about the issue. Neither of them provides a complete answer, though, and I don’t believe that anybody has one yet. Still, a lot of progress has been made by now. I believe, first of all, that we understand now what should be the three main ingredients of any logical system. Moreover, we completely understand at least one of them (and I believe that it is safe to say that we understand two), and we have a substantial (though partial) understanding of the other(s).
The Ramsey Test Revisited*
Authors: Lindström Sten , Rabinowicz Wlodzimierz 
Published: November 2023

Abstract
Frank Plumpton Ramsey (1903-1930)—the brilliant Cambridge philosopher whose short but very intensive career started when he was still a teenager only to be interrupted by his untimely death about a decade later—made important contributions to logic and even more fundamental contributions to decision theory. As is well known, he and de Finetti— independently of each other—were the founders of the so-called subjectivist (or ‘personalist’) approach to probability. It should be mentioned here that the first comprehensive monograph on the different aspects of Ramsey’s work has only recently been published [27].
Epistemic Conditionals, Snakes and Stars
Authors: Costa Horacio L Arló 
Published: November 2023

Abstract
A new epistemic semantics that implements a formulation of the Ramsey test compatible with the Alchourrón-Gärdenfors-Makinson (AGM) is presented. We adopt a notion of positive validity according to which a sentence is considered valid in a system of belief sets if it is accepted in all belief sets of the system. We call epistemic any conditional system positively validated by the epistemic model together with a notion of change (at least) compatible with AGM. Our ‘official’ axiomatization of (non-nested) epistemic conditionals is the system CJF which contains the formulas positively validated by AGM. Our models are able to reconstruct epistemically the non-nested fragment of some of the conditional systems proposed by the possible-worlds semantic, like Stalnaker’s system C2. Nevertheless we show that Lewis’s ‘official axiomatization’ of conditionals, the system VC, is not an epistemic system.
The Mathematical Works of Bernard Bolzano
Authors: Russ Steve 
Published: November 2023

Abstract
Bernard Bolzano (1781-1848, Prague) was a remarkable thinker and reformer far ahead of his time in many areas, including philosophy, theology, ethics, politics, logic, and mathematics. Aimed at historians and philosophers of both mathematics and logic, and research students in those fields, this volume contains English translations, in most cases for the first time, of many of Bolzano's most significant mathematical writings.
Structure and transport properties in borate glasses
Authors: Massot M , Balkanski M 
Published: November 2023

Abstract
The major factors motivating the development of the studies of oxide glasses with high ionic conductivity, besides their interesting physical properties, are their advantageous characteristics for energy conversion in solid state devices such as microbatteries. Vitreous fast ionic conductors with lithium ion carriers have been obtained in the ternary glass system B2O3-xLi2O-yLiX where X represents the different halide anions. In such materials the conductivity is higher, in proportion as the content of lithium oxide and of lithium salt is higher. Moreover, the transport properties are affected by the nature of the anion of the ‘doping salt’.
Low-frequency protein dynamics and ligand migration: a case of diffusion in fractal geometries?
Authors: Tahir-Kheli R A , Holzhey C J 
Published: November 2023

Abstract
Proteins are very large molecules with molecular weights in the tens of thousands (Bernstein et al. 1977; Richardson 1981). Their building blocks are the polypeptide chains, which are unbranched polymers consisting of a sequence of amino-acid residues. Often, a chain will contain a few hundred residues formed from a set of about 20 commonly occurring amino acids. Typically, protein molecules comprise one or more of such polypeptide chains, complemented by a small number of prosthetic groups-these groups themselves consisting of metal ions or special organic molecules (McCammon 1984).
Magnetic correlations and quantum fluctuations in nearly magnetic heavy fermion compounds
Authors: Pfeuty P 
Published: November 2023

Abstract
Dense cerium and uranium compounds, which can be considered as lattice extensions of the diluted ‘one-impurity Kondo system’, present new interesting physical effects, mainly due to the interaction between f electrons and the conductions electrons. If the f electron energy er is very close to the Fermi energy i;F there are valence fluctuations.
Metastability, random fields, and phase diagrams
Authors: Cowley R A 
Published: November 2023

Abstract
System with competing interactions have proved to provide some of the most interesting and challenging problems in statistical physics. The random-field problem has been no exception and in this chapter I shall try to describe where, in my opinion, we now are and how there are many aspects to the problem which are not yet fully understood. The problem has proved to be more subtle and complex than was initially expected by either theorists or experimentalists. It is a good example of a problem which has benefited from rigorous theory, physical insight, computer simulation, and experiments on real systems.
Molecular dynamics simulations of Si{001): surface reconstruction, melting, and epitaxial growth
Authors: Kaski Kimmo 
Published: November 2023

Abstract
For a variety of applications in semiconductor technology the surfaces of silicon single crystals are most important. The Si(lOO) and Si(lll) surfaces are especially widely used and are studied by a family of experimental surface-sensitive methods. These include low-energy electron diffraction {LEED), ion scattering, photon emission, and scanning tunnelling microscope {STM), which are extremely useful for studying surface morphology and reconstruction and also the thermodynamics of the surfaces including surface melting and roughening. Apart from the analysis of surfaces, the growth of good-quality single-crystal surfaces is of great importance. Recently such epitaxial growth methods as molecular beam epitaxy (MBE) are becoming widely used, not only for silicon but also for GaAs heterostructures.
Ten ‘laws’ concerning patterns of change in the history of mathematics (1975)*
Authors: Crowe Michael 
Published: November 2023

Abstract
Approximately a decade ago G. Buchdahl (1965, p. 69) stated that ‘we are finding ourselves at present in a revolution in the historiography of science’. No one has announced a revolution in the historiography of mathematics, even though the number of excellent historical studies of mathematics ha increased of late. Whereas the present state of the historiography or mathematics differs little (except in quality) from what it was nearly a century ago when Moritz Cantor published the first volume of his Vorlesungen, the historiography of science has undergone far-reaching changes which are most explicitly set out in the writings of such authors as J. Agassi and T. Kuhn (whose books Buchdahl was reviewing) as well as in the publications of N. R. Hanson, K. Popper, and S. Toulmin.