This book constitutes the refereed proceedings of the 4th International Workshop and Tutorial, FMTea 2021, Held as Part of the 4th World Congress on Formal Methods, FM 2021, as a virtual event in November 2021. The 8 full papers presented together with 2 short papers were carefully reviewed and selected from 12 submissions. The papers are organized in topical sections named: experiences and proposals related with online FM learning and teaching, integrating/embedding FM teaching/thinking within other computer science courses, teaching FM for industry, and innovative learning and teaching methods for FM.

This book offers an original and informative view of the development of fundamental concepts of computability theory. The treatment is put into historical context, emphasizing the motivation for ideas as well as their logical and formal development. In Part I the author introduces computability theory, with chapters on the foundational crisis of mathematics in the early twentieth century, and formalism. In Part II he explains classical computability theory, with chapters on the quest for formalization, the Turing Machine, and early successes such as defining incomputable problems, c.e. (computably enumerable) sets, and developing methods for proving incomputability. In Part III he explains relative computability, with chapters on computation with external help, degrees of unsolvability, the Turing hierarchy of unsolvability, the class of degrees of unsolvability, c.e. degrees and the priority method, and the arithmetical hierarchy. Finally, in the new Part IV the author revisits the computability (Church-Turing) thesis in greater detail. He offers a systematic and detailed account of its origins, evolution, and meaning, he describes more powerful, modern versions of the thesis, and he discusses recent speculative proposals for new computing paradigms such as hypercomputing. This is a gentle introduction from the origins of computability theory up to current research, and it will be of value as a textbook and guide for advanced undergraduate and graduate students and researchers in the domains of computability theory and theoretical computer science. This new edition is completely revised, with almost one hundred pages of new material. In particular the author applied more up-to-date, more consistent terminology, and he addressed some notational redundancies and minor errors. He developed a glossary relating to computability theory, expanded the bibliographic references with new entries, and added the new part described above and other new sections.

This book delves into finite mathematics and its application in physics, particularly quantum theory. It is shown that quantum theory based on finite mathematics is more general than standard quantum theory, whilst finite mathematics is itself more general than standard mathematics.As a consequence, the mathematics describing nature at the most fundamental level involves only a finite number of numbers while the notions of limit, infinite/infinitesimal and continuity are needed only in calculations that describe nature approximately. It is also shown that the concepts of particle and antiparticle are likewise approximate notions, valid only in special situations, and that the electric charge and baryon- and lepton quantum numbers can be only approximately conserved.

This undergraduate textbook promotes an active transition to higher mathematics. Problem solving is the heart and soul of this book: each problem is carefully chosen to demonstrate, elucidate, or extend a concept. More than 300 exercises engage the reader in extensive arguments and creative approaches, while exploring connections between fundamental mathematical topics. Divided into four parts, this book begins with a playful exploration of the building blocks of mathematics, such as definitions, axioms, and proofs. A study of the fundamental concepts of logic, sets, and functions follows, before focus turns to methods of proof. Having covered the core of a transition course, the author goes on to present a selection of advanced topics that offer opportunities for extension or further study. Throughout, appendices touch on historical perspectives, current trends, and open questions, showing mathematics as a vibrant and dynamic human enterprise. This second edition has been reorganized to better reflect the layout and curriculum of standard transition courses. It also features recent developments and improved appendices. An Invitation to Abstract Mathematics is ideal for those seeking a challenging and engaging transition to advanced mathematics, and will appeal to both undergraduates majoring in mathematics, as well as non-math majors interested in exploring higher-level concepts. From reviews of the first edition: Bajnok's new book truly invites students to enjoy the beauty, power, and challenge of abstract mathematics. ... The book can be used as a text for traditional transition or structure courses ... but since Bajnok invites all students, not just mathematics majors, to enjoy the subject, he assumes very little background knowledge. Jill Dietz, MAA ReviewsThe style of writing is careful, but joyously enthusiastic.... The author's clear attitude is that mathematics consists of problem solving, and that writing a proof falls into this category. Students of mathematics are, therefore, engaged in problem solving, and should be given problems to solve, rather than problems to imitate. The author attributes this approach to his Hungarian background ... and encourages students to embrace the challenge in the same way an athlete engages in vigorous practice. John Perry, zbMATH

This book constitutes the proceedings of the 19th International Conference on Relational and Algebraic Methods in Computer Science, RAMiCS 2021, which took place in Marseille, France, during November 2-5, 2021. The 29 papers presented in this book were carefully reviewed and selected from 35 submissions. They deal with the development and dissemination of relation algebras, Kleene algebras, and similar algebraic formalisms. Topics covered range from mathematical foundations to applications as conceptual and methodological tools in computer science and beyond.

Since the birth of rational homotopy theory, the possibility of extending the Quillen approach - in terms of Lie algebras - to a more general category of spaces, including the non-simply connected case, has been a challenge for the algebraic topologist community. Despite the clear Eckmann-Hilton duality between Quillen and Sullivan treatments, the simplicity in the realization of algebraic structures in the latter contrasts with the complexity required by the Lie algebra version. In this book, the authors develop new tools to address these problems. Working with complete Lie algebras, they construct, in a combinatorial way, a cosimplicial Lie model for the standard simplices. This is a key object, which allows the definition of a new model and realization functors that turn out to be homotopically equivalent to the classical Quillen functors in the simply connected case. With this, the authors open new avenues for solving old problems and posing new questions. This monograph is the winner of the 2020 Ferran Sunyer i Balaguer Prize, a prestigious award for books of expository nature presenting the latest developments in an active area of research in mathematics.

This book presents a set of historical recollections on the work of Martin Davis and his role in advancing our understanding of the connections between logic, computing, and unsolvability. The individual contributions touch on most of the core aspects of Davis' work and set it in a contemporary context. They analyse, discuss and develop many of the ideas and concepts that Davis put forward, including such issues as contemporary satisfiability solvers, essential unification, quantum computing and generalisations of Hilbert's tenth problem. The book starts out with a scientific autobiography by Davis, and ends with his responses to comments included in the contributions. In addition, it includes two previously unpublished original historical papers in which Davis and Putnam investigate the decidable and the undecidable side of Logic, as well as a full bibliography of Davis' work. As a whole, this book shows how Davis' scientific work lies at the intersection of computability, theoretical computer science, foundations of mathematics, and philosophy, and draws its unifying vision from his deep involvement in Logic.

This volume collects contributions from speakers at the INdAM Workshop "Birational Geometry and Moduli Spaces", which was held in Rome on 11-15 June 2018. The workshop was devoted to the interplay between birational geometry and moduli spaces and the contributions of the volume reflect the same idea, focusing on both these areas and their interaction. In particular, the book includes both surveys and original papers on irreducible holomorphic symplectic manifolds, Severi varieties, degenerations of Calabi-Yau varieties, uniruled threefolds, toric Fano threefolds, mirror symmetry, canonical bundle formula, the Lefschetz principle, birational transformations, and deformations of diagrams of algebras. The intention is to disseminate the knowledge of advanced results and key techniques used to solve open problems. The book is intended for all advanced graduate students and researchers interested in the new research frontiers of birational geometry and moduli spaces.

The book offers a collection of essays on various aspects of Leibniz's scientific thought, written by historians of science and world-leading experts on Leibniz. The essays deal with a vast array of topics on the exact sciences: Leibniz's logic, mereology, the notion of infinity and cardinality, the foundations of geometry, the theory of curves and differential geometry, and finally dynamics and general epistemology. Several chapters attempt a reading of Leibniz's scientific works through modern mathematical tools, and compare Leibniz's results in these fields with 19th- and 20th-Century conceptions of them. All of them have special care in framing Leibniz's work in historical context, and sometimes offer wider historical perspectives that go much beyond Leibniz's researches. A special emphasis is given to effective mathematical practice rather than purely epistemological thought. The book is addressed to all scholars of the exact sciences who have an interest in historical research and Leibniz in particular, and may be useful to historians of mathematics, physics, and epistemology, mathematicians with historical interests, and philosophers of science at large.

This book provides a concise and self-contained introduction to the foundations of mathematics. The first part covers the fundamental notions of mathematical logic, including logical axioms, formal proofs and the basics of model theory. Building on this, in the second and third part of the book the authors present detailed proofs of Goedel's classical completeness and incompleteness theorems. In particular, the book includes a full proof of Goedel's second incompleteness theorem which states that it is impossible to prove the consistency of arithmetic within its axioms. The final part is dedicated to an introduction into modern axiomatic set theory based on the Zermelo's axioms, containing a presentation of Goedel's constructible universe of sets. A recurring theme in the whole book consists of standard and non-standard models of several theories, such as Peano arithmetic, Presburger arithmetic and the real numbers. The book addresses undergraduate mathematics students and is suitable for a one or two semester introductory course into logic and set theory. Each chapter concludes with a list of exercises.

The book has two parts: In the first, after a review of some seminal classical accounts of laws and explanations, a new account is proposed for distinguishing between laws and accidental generalizations (LAG). Among the new consequences of this proposal it is proved that any explanation of a contingent generalization shows that the generalization is not accidental. The second part involves physical theories, their modality, and their explanatory power. In particular, it is shown that (1) Each theory has a theoretical implication structure associated with it, such that there are new physical modal operators on these structures and also special modal entities that are in these structures. A special subset of the physical modals, the nomic modals are associated with the laws of theories. (2) The familiar idea that theories always explain laws by deduction of them has to be seriously modified in light of the fact that there are a host of physical theories (including for example, Newtonian Classical mechanics, Hamiltonian, and Lagrangian theory, and probability theory) that we believe are schematic (they do not have any truth value). Nevertheless, we think that there is a kind of non-deductive explanation and generality that they achieve by subsumtion under a schema.

This book presents the state of the art in the fields of formal logic pioneered by Graham Priest. It includes advanced technical work on the model and proof theories of paraconsistent logic, in contributions from top scholars in the field. Graham Priest's research has had a considerable influence on the field of philosophical logic, especially with respect to the themes of dialetheism-the thesis that there exist true but inconsistent sentences-and paraconsistency-an account of deduction in which contradictory premises do not entail the truth of arbitrary sentences. Priest's work has regularly challenged researchers to reappraise many assumptions about rationality, ontology, and truth. This book collects original research by some of the most esteemed scholars working in philosophical logic, whose contributions explore and appraise Priest's work on logical approaches to problems in philosophy, linguistics, computation, and mathematics. They provide fresh analyses, critiques, and applications of Priest's work and attest to its continued relevance and topicality. The book also includes Priest's responses to the contributors, providing a further layer to the development of these themes .

This book on proof theory centers around the legacy of Kurt Schutte and its current impact on the subject. Schutte was the last doctoral student of David Hilbert who was the first to see that proofs can be viewed as structured mathematical objects amenable to investigation by mathematical methods (metamathematics). Schutte inaugurated the important paradigm shift from finite proofs to infinite proofs and developed the mathematical tools for their analysis. Infinitary proof theory flourished in his hands in the 1960s, culminating in the famous bound 0 for the limit of predicative mathematics (a fame shared with Feferman). Later his interests shifted to developing infinite proof calculi for impredicative theories. Schutte had a keen interest in advancing ordinal analysis to ever stronger theories and was still working on some of the strongest systems in his eighties. The articles in this volume from leading experts close to his research, show the enduring influence of his work in modern proof theory. They range from eye witness accounts of his scientific life to developments at the current research frontier, including papers by Schutte himself that have never been published before.

This book addresses mechanisms for reducing model heterogeneity induced by the absence of explicit semantics expression in the formal techniques used to specify design models. More precisely, it highlights the advances in handling both implicit and explicit semantics in formal system developments, and discusses different contributions expressing different views and perceptions on the implicit and explicit semantics. The book is based on the discussions at the Shonan meeting on this topic held in 2016, and includes contributions from the participants summarising their perspectives on the problem and offering solutions. Divided into 5 parts: domain modelling, knowledge-based modelling, proof-based modelling, assurance cases, and refinement-based modelling, and offers inspiration for researchers and practitioners in the fields of formal methods, system and software engineering, domain knowledge modelling, requirement analysis, and explicit and implicit semantics of modelling languages.

Kurt Goedel (1906-1978) shook the mathematical world in 1931 by a result that has become an icon of 20th century science: The search for rigour in proving mathematical theorems had led to the formalization of mathematical proofs, to the extent that such proving could be reduced to the application of a few mechanical rules. Goedel showed that whenever the part of mathematics under formalization contains elementary arithmetic, there will be arithmetical statements that should be formally provable but aren't. The result is known as Goedel's first incompleteness theorem, so called because there is a second incompleteness result, embodied in his answer to the question "Can mathematics be proved consistent?" This book offers the first examination of Goedel's preserved notebooks from 1930, written in a long-forgotten German shorthand, that show his way to the results: his first ideas, how they evolved, and how the jewel-like final presentation in his famous publication On formally undecidable propositions was composed.The book also contains the original version of Goedel's incompleteness article, as handed in for publication with no mentioning of the second incompleteness theorem, as well as six contemporary lectures and seminars Goedel gave between 1931 and 1934 in Austria, Germany, and the United States. The lectures are masterpieces of accessible presentations of deep scientific results, readable even for those without special mathematical training, and published here for the first time.

The contributions in this book survey results on combinations of probabilistic and various other classical, temporal and justification logical systems. Formal languages of these logics are extended with probabilistic operators. The aim is to provide a systematic overview and an accessible presentation of mathematical techniques used to obtain results on formalization, completeness, compactness and decidability. The book will be of value to researchers in logic and it can be used as a supplementary text in graduate courses on non-classical logics.

This book presents a set theoretical development for the foundations of the theory of atomic and finitely supported structures. It analyzes whether a classical result can be adequately reformulated by replacing a 'non-atomic structure' with an 'atomic, finitely supported structure'. It also presents many specific properties, such as finiteness, cardinality, connectivity, fixed point, order and uniformity, of finitely supported atomic structures that do not have non-atomic correspondents. In the framework of finitely supported sets, the authors analyze the consistency of various forms of choice and related results. They introduce and study the notion of 'cardinality' by presenting various order and arithmetic properties. Finitely supported partially ordered sets, chain complete sets, lattices and Galois connections are studied, and new fixed point, calculability and approximation properties are presented. In this framework, the authors study the finitely supported L-fuzzy subsets of a finitely supported set and the finitely supported fuzzy subgroups of a finitely supported group. Several pairwise non-equivalent definitions for the notion of 'infinity' (Dedekind infinity, Mostowski infinity, Kuratowski infinity, Tarski infinity, ascending infinity) are introduced, compared and studied in the new framework. Relevant examples of sets that satisfy some forms of infinity while not satisfying others are provided. Uniformly supported sets are analyzed, and certain surprising properties are presented. Finally, some variations of the finite support requirement are discussed. The book will be of value to researchers in the foundations of set theory, algebra and logic.

This monograph offers a critical introduction to current theories of how scientific models represent their target systems. Representation is important because it allows scientists to study a model to discover features of reality. The authors provide a map of the conceptual landscape surrounding the issue of scientific representation, arguing that it consists of multiple intertwined problems. They provide an encyclopaedic overview of existing attempts to answer these questions, and they assess their strengths and weaknesses. The book also presents a comprehensive statement of their alternative proposal, the DEKI account of representation, which they have developed over the last few years. They show how the account works in the case of material as well as non-material models; how it accommodates the use of mathematics in scientific modelling; and how it sheds light on the relation between representation in science and art. The issue of representation has generated a sizeable literature, which has been growing fast in particular over the last decade. This makes it hard for novices to get a handle on the topic because so far there is no book-length introduction that would guide them through the discussion. Likewise, researchers may require a comprehensive review that they can refer to for critical evaluations. This book meets the needs of both groups.

This edited volume presents a fascinating collection of lecture notes focusing on differential equations from two viewpoints: formal calculus (through the theory of Groebner bases) and geometry (via quiver theory). Groebner bases serve as effective models for computation in algebras of various types. Although the theory of Groebner bases was developed in the second half of the 20th century, many works on computational methods in algebra were published well before the introduction of the modern algebraic language. Since then, new algorithms have been developed and the theory itself has greatly expanded. In comparison, diagrammatic methods in representation theory are relatively new, with the quiver varieties only being introduced - with big impact - in the 1990s. Divided into two parts, the book first discusses the theory of Groebner bases in their commutative and noncommutative contexts, with a focus on algorithmic aspects and applications of Groebner bases to analysis on systems of partial differential equations, effective analysis on rings of differential operators, and homological algebra. It then introduces representations of quivers, quiver varieties and their applications to the moduli spaces of meromorphic connections on the complex projective line. While no particular reader background is assumed, the book is intended for graduate students in mathematics, engineering and related fields, as well as researchers and scholars.

This book carefully presents a unified treatment of equivariant Poincare duality in a wide variety of contexts, illuminating an area of mathematics that is often glossed over elsewhere. The approach used here allows the parallel treatment of both equivariant and nonequivariant cases. It also makes it possible to replace the usual field of coefficients for cohomology, the field of real numbers, with any field of arbitrary characteristic, and hence change (equivariant) de Rham cohomology to the usual singular (equivariant) cohomology . The book will be of interest to graduate students and researchers wanting to learn about the equivariant extension of tools familiar from non-equivariant differential geometry.

This book constitutes the refereed proceedings of the 41st IFIP WG 6.1 International Conference on Formal Techniques for Distributed Objects, Components, and Systems, FORTE 2021, held in Valletta, Malta, in June 2021, as part of the 16th International Federated Conference on Distributed Computing Techniques, DisCoTec 2021. The 9 regular papers and 4 short papers presented were carefully reviewed and selected from 26 submissions. They cover topics such as: software quality, reliability, availability, and safety; security, privacy, and trust in distributed and/or communicating systems; service-oriented, ubiquitous, and cloud computing systems; component-and model-based design; object technology, modularity, and software adaptation; self-stabilisation and self-healing/organising; and verification, validation, formal analysis, and testing of the above. Due to the Corona pandemic this event was held virtually.

This Festschrift was published in honor of Egon Boerger on the occasion of his 75th birthday. It acknowledges Prof. Boerger's inspiration as a scientist, author, mentor, and community organizer. Dedicated to a pioneer in the fields of logic and computer science, Egon Boerger's research interests are unusual in scope, from programming languages to hardware architectures, software architectures, control systems, workflow and interaction patterns, business processes, web applications, and concurrent systems. The 18 invited contributions in this volume are by leading researchers in the areas of software engineering, programming languages, business information systems, and computer science logic.

The contributions gathered here demonstrate how categorical ontology can provide a basis for linking three important basic sciences: mathematics, physics, and philosophy. Category theory is a new formal ontology that shifts the main focus from objects to processes. The book approaches formal ontology in the original sense put forward by the philosopher Edmund Husserl, namely as a science that deals with entities that can be exemplified in all spheres and domains of reality. It is a dynamic, processual, and non-substantial ontology in which all entities can be treated as transformations, and in which objects are merely the sources and aims of these transformations. Thus, in a rather surprising way, when employed as a formal ontology, category theory can unite seemingly disparate disciplines in contemporary science and the humanities, such as physics, mathematics and philosophy, but also computer and complex systems science.

MATRIX is Australia's international and residential mathematical research institute. It facilitates new collaborations and mathematical advances through intensive residential research programs, each 1-4 weeks in duration. This book is a scientific record of the eight programs held at MATRIX in 2018: - Non-Equilibrium Systems and Special Functions - Algebraic Geometry, Approximation and Optimisation - On the Frontiers of High Dimensional Computation - Month of Mathematical Biology - Dynamics, Foliations, and Geometry In Dimension 3 - Recent Trends on Nonlinear PDEs of Elliptic and Parabolic Type - Functional Data Analysis and Beyond - Geometric and Categorical Representation Theory The articles are grouped into peer-reviewed contributions and other contributions. The peer-reviewed articles present original results or reviews on a topic related to the MATRIX program; the remaining contributions are predominantly lecture notes or short articles based on talks or activities at MATRIX.

This textbook is an introduction to the theory of infinity-categories, a tool used in many aspects of modern pure mathematics. It treats the basics of the theory and supplies all the necessary details while leading the reader along a streamlined path from the basic definitions to more advanced results such as the very important adjoint functor theorems. The book is based on lectures given by the author on the topic. While the material itself is well-known to experts, the presentation of the material is, in parts, novel and accessible to non-experts. Exercises complement this textbook that can be used both in a classroom setting at the graduate level and as an introductory text for the interested reader.