Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Series
  3. Perspectives in Logic

The Perspectives in Logic series publishes substantial and high-quality books whose central theme lies in some area or aspect of logic, particularly books that present new material not available in book form. The series ranges from introductory texts suitable for beginning graduate courses to specialized monographs at the frontiers of research. Each book offers an illuminating perspective for its intended audience.

  • Managing Editors: Arnold Beckmann, Swansea University
  • Editorial Boards: Alessandro Berarducci, Università degli Studi, Pisa, Rosalie Iemhoff, Universiteit Utrecht, The Netherlands, Su Gao, Nankai University, China, Andre Nies, University of Auckland, Meghyn Bienvenu, LaBRI – CNRS and Université de Bordeaux, Dana Fisman, Ben-Gurion University of the Negev, Israel

Refine search

Refine search

Content type:
Publication date:
Subject: Show more
Journals Show more
Publishers: Show more
Series: Show more
Collections: Show more

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

17 results in Perspectives in Logic

Computable Structure Theory
  • Computable Structure Theory
  • Within the Arithmetic
  • Antonio Montalbán
  • Published online: 11 June 2021
  • Print publication: 24 June 2021
  • View description
    In mathematics, we know there are some concepts - objects, constructions, structures, proofs - that are more complex and difficult to describe than others. Computable structure theory quantifies and studies the complexity of mathematical structures, structures such as graphs, groups, and orderings. Written by a contemporary expert in the subject, this is the first full monograph on computable structure theory in 20 years. Aimed at graduate students and researchers in mathematical logic, it brings new results of the author together with many older results that were previously scattered across the literature and presents them all in a coherent framework, making it easier for the reader to learn the main results and techniques in the area for application in their own research. This volume focuses on countable structures whose complexity can be measured within arithmetic; a forthcoming second volume will study structures beyond arithmetic.
Degrees of Unsolvability
  • Degrees of Unsolvability
  • Local and Global Theory
  • Manuel Lerman
  • Published online: 31 March 2017
  • Print publication: 06 April 2017
  • View description
    Since their inception, the Perspectives in Logic and Lecture Notes in Logic series have published seminal works by leading logicians. Many of the original books in the series have been unavailable for years, but they are now in print once again. In this volume, the eleventh publication in the Perspectives in Logic series, Manuel Lerman presents a systematic study of the interaction between local and global degree theory. He introduces the reader to the fascinating combinatorial methods of recursion theory while simultaneously showing how to use these methods to prove global theorems about degrees. The intended reader will have already taken a graduate-level course in recursion theory, but this book will also be accessible to those with some background in mathematical logic and a feeling for computability. It will prove a key reference to enable readers to easily locate facts about degrees and it will direct them to further results.
Proper and Improper Forcing
  • Proper and Improper Forcing
  • 2nd edition
  • Saharon Shelah
  • Published online: 06 April 2017
  • Print publication: 23 March 2017
  • View description
    Since their inception, the Perspectives in Logic and Lecture Notes in Logic series have published seminal works by leading logicians. Many of the original books in the series have been unavailable for years, but they are now in print once again. This volume, the fifth publication in the Perspectives in Logic series, studies set-theoretic independence results (independence from the usual set-theoretic ZFC axioms), in particular for problems on the continuum. The author gives a complete presentation of the theory of proper forcing and its relatives, starting from the beginning and avoiding the metamathematical considerations. No prior knowledge of forcing is required. The book will enable a researcher interested in an independence result of the appropriate kind to have much of the work done for them, thereby allowing them to quote general results.
Constructibility
  • Constructibility
  • Keith J. Devlin
  • Published online: 30 March 2017
  • Print publication: 16 March 2017
  • View description
    Since their inception, the Perspectives in Logic and Lecture Notes in Logic series have published seminal works by leading logicians. Many of the original books in the series have been unavailable for years, but they are now in print once again. In this volume, the sixth publication in the Perspectives in Logic series, Keith J. Devlin gives a comprehensive account of the theory of constructible sets at an advanced level. The book provides complete coverage of the theory itself, rather than the many and diverse applications of constructibility theory, although applications are used to motivate and illustrate the theory. The book is divided into two parts: Part I (Elementary Theory) deals with the classical definition of the Lα-hierarchy of constructible sets and may be used as the basis of a graduate course on constructibility theory. and Part II (Advanced Theory) deals with the Jα-hierarchy and the Jensen 'fine-structure theory'.
General Recursion Theory
  • General Recursion Theory
  • An Axiomatic Approach
  • Jens E. Fenstad
  • Published online: 31 March 2017
  • Print publication: 02 March 2017
  • View description
    Since their inception, the Perspectives in Logic and Lecture Notes in Logic series have published seminal works by leading logicians. Many of the original books in the series have been unavailable for years, but they are now in print once again. In this volume, the tenth publication in the Perspectives in Logic series, Jens E. Fenstad takes an axiomatic approach to present a unified and coherent account of the many and various parts of general recursion theory. The main core of the book gives an account of the general theory of computations. The author then moves on to show how computation theories connect with and unify other parts of general recursion theory. Some mathematical maturity is required of the reader, who is assumed to have some acquaintance with recursion theory. This book is ideal for a second course in the subject.
Computability in Analysis and Physics
  • Computability in Analysis and Physics
  • Marian B. Pour-El, J. Ian Richards
  • Published online: 24 March 2017
  • Print publication: 02 March 2017
  • View description
    Since their inception, the Perspectives in Logic and Lecture Notes in Logic series have published seminal works by leading logicians. Many of the original books in the series have been unavailable for years, but they are now in print once again. In this volume, the first publication in the Perspectives in Logic series, Pour-El and Richards present the first graduate-level treatment of computable analysis within the tradition of classical mathematical reasoning. The book focuses on the computability or noncomputability of standard processes in analysis and physics. Topics include classical analysis, Hilbert and Banach spaces, bounded and unbounded linear operators, eigenvalues, eigenvectors, and equations of mathematical physics. The work is self-contained, and although it is intended primarily for logicians and analysts, it should also be of interest to researchers and graduate students in physics and computer science.
Admissible Sets and Structures
  • Admissible Sets and Structures
  • Jon Barwise
  • Published online: 31 March 2017
  • Print publication: 02 March 2017
  • View description
    Since their inception, the Perspectives in Logic and Lecture Notes in Logic series have published seminal works by leading logicians. Many of the original books in the series have been unavailable for years, but they are now in print once again. Admissible set theory is a major source of interaction between model theory, recursion theory and set theory, and plays an important role in definability theory. In this volume, the seventh publication in the Perspectives in Logic series, Jon Barwise presents the basic facts about admissible sets and admissible ordinals in a way that makes them accessible to logic students and specialists alike. It fills the artificial gap between model theory and recursion theory and covers everything the logician should know about admissible sets.
Model-Theoretic Logics
  • Model-Theoretic Logics
  • Edited by J. Barwise, S. Feferman
  • Published online: 31 March 2017
  • Print publication: 02 March 2017
  • View description
    Since their inception, the Perspectives in Logic and Lecture Notes in Logic series have published seminal works by leading logicians. Many of the original books in the series have been unavailable for years, but they are now in print once again. This volume, the eighth publication in the Perspectives in Logic series, brings together several directions of work in model theory between the late 1950s and early 1980s. It contains expository papers by pre-eminent researchers. Part I provides an introduction to the subject as a whole, as well as to the basic theory and examples. The rest of the book addresses finitary languages with additional quantifiers, infinitary languages, second-order logic, logics of topology and analysis, and advanced topics in abstract model theory. Many chapters can be read independently.
Fundamentals of Stability Theory
  • Fundamentals of Stability Theory
  • John T. Baldwin
  • Published online: 31 March 2017
  • Print publication: 02 March 2017
  • View description
    Since their inception, the Perspectives in Logic and Lecture Notes in Logic series have published seminal works by leading logicians. Many of the original books in the series have been unavailable for years, but they are now in print once again. In this volume, the twelfth publication in the Perspectives in Logic series, John T. Baldwin presents an introduction to first order stability theory, organized around the spectrum problem: calculate the number of models a first order theory T has in each uncountable cardinal. The author first lays the groundwork and then moves on to three sections: independence, dependence and prime models, and local dimension theory. The final section returns to the spectrum problem, presenting complete proofs of the Vaught conjecture for ω-stable theories for the first time in book form. The book provides much-needed examples, and emphasizes the connections between abstract stability theory and module theory.
Recursion-Theoretic Hierarchies
  • Recursion-Theoretic Hierarchies
  • Peter G. Hinman
  • Published online: 31 March 2017
  • Print publication: 02 March 2017
  • View description
    Since their inception, the Perspectives in Logic and Lecture Notes in Logic series have published seminal works by leading logicians. Many of the original books in the series have been unavailable for years, but they are now in print once again. The theory set out in this volume, the ninth publication in the Perspectives in Logic series, is the result of the meeting and common development of two currents of mathematical research: descriptive set theory and recursion theory. Both are concerned with notions of definability and with the classification of mathematical objects according to their complexity. These are the common themes which run through the topics discussed here. The author develops a general theory from which the results of both areas can be derived, making these common threads clear.
Metamathematics of First-Order Arithmetic
  • Metamathematics of First-Order Arithmetic
  • Petr Hájek, Pavel Pudlák
  • Published online: 24 March 2017
  • Print publication: 02 March 2017
  • View description
    Since their inception, the Perspectives in Logic and Lecture Notes in Logic series have published seminal works by leading logicians. Many of the original books in the series have been unavailable for years, but they are now in print once again. This volume, the third publication in the Perspectives in Logic series, is a much-needed monograph on the metamathematics of first-order arithmetic. The authors pay particular attention to subsystems (fragments) of Peano arithmetic and give the reader a deeper understanding of the role of the axiom schema of induction and of the phenomenon of incompleteness. The reader is only assumed to know the basics of mathematical logic, which are reviewed in the preliminaries. Part I develops parts of mathematics and logic in various fragments. Part II is devoted to incompleteness. Finally, Part III studies systems that have the induction schema restricted to bounded formulas (bounded arithmetic).
Essential Stability Theory
  • Essential Stability Theory
  • Steven Buechler
  • Published online: 31 March 2017
  • Print publication: 02 March 2017
  • View description
    Since their inception, the Perspectives in Logic and Lecture Notes in Logic series have published seminal works by leading logicians. Many of the original books in the series have been unavailable for years, but they are now in print once again. Stability theory was introduced and matured in the 1960s and 1970s. Today stability theory influences and is influenced by number theory, algebraic group theory, Riemann surfaces, and representation theory of modules. There is little model theory today that does not involve the methods of stability theory. In this volume, the fourth publication in the Perspectives in Logic series, Steven Buechler bridges the gap between a first-year graduate logic course and research papers in stability theory. The book prepares the student for research in any of today's branches of stability theory, and gives an introduction to classification theory with an exposition of Morley's Categoricity Theorem.
Higher Recursion Theory
  • Higher Recursion Theory
  • Gerald E. Sacks
  • Published online: 24 March 2017
  • Print publication: 02 March 2017
  • View description
    Since their inception, the Perspectives in Logic and Lecture Notes in Logic series have published seminal works by leading logicians. Many of the original books in the series have been unavailable for years, but they are now in print once again. This volume, the second publication in the Perspectives in Logic series, is an almost self-contained introduction to higher recursion theory, in which the reader is only assumed to know the basics of classical recursion theory. The book is divided into four parts: hyperarithmetic sets, metarecursion, α-recursion, and E-recursion. This text is essential reading for all researchers in the field.
Pure Inductive Logic
  • Pure Inductive Logic
  • Jeffrey Paris, Alena Vencovská
  • Published online: 05 May 2015
  • Print publication: 02 April 2015
  • View description
    Pure inductive logic is the study of rational probability treated as a branch of mathematical logic. This monograph, the first devoted to this approach, brings together the key results from the past seventy years plus the main contributions of the authors and their collaborators over the last decade to present a comprehensive account of the discipline within a single unified context. The exposition is structured around the traditional bases of rationality, such as avoiding Dutch Books, respecting symmetry and ignoring irrelevant information. The authors uncover further rationality concepts, both in the unary and in the newly emerging polyadic languages, such as conformity, spectrum exchangeability, similarity and language invariance. For logicians with a mathematical grounding, this book provides a complete self-contained course on the subject, taking the reader from the basics up to the most recent developments. It is also a useful reference for a wider audience from philosophy and computer science.
Lambda Calculus with Types
  • Lambda Calculus with Types
  • Henk Barendregt, Wil Dekkers, Richard Statman
  • Published online: 05 August 2013
  • Print publication: 20 June 2013
  • View description
    This handbook with exercises reveals in formalisms, hitherto mainly used for hardware and software design and verification, unexpected mathematical beauty. The lambda calculus forms a prototype universal programming language, which in its untyped version is related to Lisp, and was treated in the first author's classic The Lambda Calculus (1984). The formalism has since been extended with types and used in functional programming (Haskell, Clean) and proof assistants (Coq, Isabelle, HOL), used in designing and verifying IT products and mathematical proofs. In this book, the authors focus on three classes of typing for lambda terms: simple types, recursive types and intersection types. It is in these three formalisms of terms and types that the unexpected mathematical beauty is revealed. The treatment is authoritative and comprehensive, complemented by an exhaustive bibliography, and numerous exercises are provided to deepen the readers' understanding and increase their confidence using types.
Proofs and Computations
  • Proofs and Computations
  • Helmut Schwichtenberg, Stanley S. Wainer
  • Published online: 05 January 2012
  • Print publication: 15 December 2011
  • View description
    Driven by the question, 'What is the computational content of a (formal) proof?', this book studies fundamental interactions between proof theory and computability. It provides a unique self-contained text for advanced students and researchers in mathematical logic and computer science. Part I covers basic proof theory, computability and Gödel's theorems. Part II studies and classifies provable recursion in classical systems, from fragments of Peano arithmetic up to Π11–CA0. Ordinal analysis and the (Schwichtenberg–Wainer) subrecursive hierarchies play a central role and are used in proving the 'modified finite Ramsey' and 'extended Kruskal' independence results for PA and Π11–CA0. Part III develops the theoretical underpinnings of the first author's proof assistant MINLOG. Three chapters cover higher-type computability via information systems, a constructive theory TCF of computable functionals, realizability, Dialectica interpretation, computationally significant quantifiers and connectives and polytime complexity in a two-sorted, higher-type arithmetic with linear logic.
Subsystems of Second Order Arithmetic
  • Subsystems of Second Order Arithmetic
  • 2nd edition
  • Stephen G. Simpson
  • Published online: 19 February 2010
  • Print publication: 29 May 2009
  • View description
    Almost all of the problems studied in this book are motivated by an overriding foundational question: What are the appropriate axioms for mathematics? Through a series of case studies, these axioms are examined to prove particular theorems in core mathematical areas such as algebra, analysis, and topology, focusing on the language of second-order arithmetic, the weakest language rich enough to express and develop the bulk of mathematics. In many cases, if a mathematical theorem is proved from appropriately weak set existence axioms, then the axioms will be logically equivalent to the theorem. Furthermore, only a few specific set existence axioms arise repeatedly in this context, which in turn correspond to classical foundational programs. This is the theme of reverse mathematics, which dominates the first half of the book. The second part focuses on models of these and other subsystems of second-order arithmetic.