Introduction and Preliminaries

In the last 100 years or so many problems which arose in the science, engineering, and technology literature involved nonlinear phenomena and these usually give rise to (differential) integral equations. The aim of this book is to provide a comprehensive existence theory for systems of integral equations. Also we present some specialized topics in integral equations which we hope will inspire future research in this area. The book consists of 20 chapters and presents a self-contained account on integrals equations. The selected topics in this book reflect the particular interests of the authors.

[1]  Andreas Weiermann,et al.  Phase transition thresholds for some Friedman‐style independence results , 2007, Math. Log. Q..

[2]  E. Zeidler.  Nonlinear Functional Analysis and Its Applications: II/ A: Linear Monotone Operators , 1989 .

[3]  John R. Steel,et al.  A proof of projective determinacy , 1989 .

[4]  Stephen G. Simpson,et al.  Logic and Combinatorics , 1987 .

[5]  R. Leggett,et al.  Multiple positive fixed points of nonlinear operators on ordered Banach spaces , 1979 .

[6]  Stephen G. Simpson,et al.  Subsystems of second order arithmetic , 1999, Perspectives in mathematical logic.

[7]  G. Boolos.  The logic of provability , 1993 .

[8]  J. Nohel,et al.  Frequency domain methods for Volterra equations , 1976 .

[9]  C. Smorynski.  The Incompleteness Theorems , 1977 .

[10]  Albert Visser.  Can We Make the Second Incompleteness Theorem Coordinate Free? , 2011, J. Log. Comput..

[11]  R. Vaught.  On a Theorem of Cobham Concerning Undecidable Theories , 1966 .

[12]  Mitsuhiro Okada,et al.  A Relationship Among Gentzen's Proof‐Reduction, Kirby‐Paris' Hydra Game and Buchholz's Hydra Game , 1995, Math. Log. Q..

[13]  On a theorem of Feferman , 1980 .

[14]  L. Beklemishev.  Gödel incompleteness theorems and the limits of their applicability. I , 2011 .

[15]  Andreas Weiermann,et al.  Classifying the Provably Total Functions of PA , 2006, Bulletin of Symbolic Logic.

[16]  J. Paris,et al.  Accessible Independence Results for Peano Arithmetic , 1982 .

[17]  U. Kohlenbach.  Foundational and Mathematical Uses of Higher Types , 1999 .

[18]  H. Weyl,et al.  The Continuum: A Critical Examination of the Foundation of Analysis , 1987 .

[19]  Solomon Feferman,et al.  Systems of predicative analysis, II: Representations of ordinals , 1968, Journal of Symbolic Logic.

[20]  Michael Detlefsen,et al.  On interpreting Gödel's Second Theorem , 1979, J. Philos. Log..

[21]  Gerhard Jäger,et al.  A well-ordering proof for Feferman's theoryT0 , 1983, Arch. Math. Log..

[22]  Peter Clote,et al.  Two further combinatorial theorems equivalent to the 1-consistency of peano arithmetic , 1983, Journal of Symbolic Logic.

[23]  Harvey M. Friedman,et al.  On the necessary use of abstract set theory , 1981 .

[24]  Kenneth McAloon,et al.  On Gödel incompleteness and finite combinatorics , 1987, Ann. Pure Appl. Log..

[25]  Stephen G. Simpson,et al.  A Finite Combinatorial Principle Which is Equivalent to the 1-Consistency of Predicative Analysis , 1982 .

[26]  Henryk Kotlarski,et al.  The incompleteness theorems after 70 years , 2004, Ann. Pure Appl. Log..

[27]  Andreas Weiermann.  Analytic combinatorics, proof-theoretic ordinals, and phase transitions for independence results , 2005, Ann. Pure Appl. Log..

[28]  Leszek Pacholski,et al.  Model theory of algebra and arithmetic , 1980 .

[29]  渕野 昌.  書評 Akihiro Kanamori : The Higher Infinite : Large Cardinals in Set Theory from Their Beginnings, Corr. 2nd ed., Springer Monogr. Math. , 2014 .

[30]  Richard Zach.  Hilbert's program then and now , 2007 .

[31]  Andreas Weiermann,et al.  An application of graphical enumeration to PA* , 2003, Journal of Symbolic Logic.

[32]  Constantin Corduneanu,et al.  Integral Equations and Stability of Feedback Systems , 1973 .

[33]  Harvey M. Friedman.  Uniformly Defined Descending Sequences of Degrees , 1976, J. Symb. Log..

[34]  Stephen G. Simpson,et al.  Nonprovability of Certain Combinatorial Properties of Finite Trees , 1985 .

[35]  Andrey Bovykin,et al.  Brief introduction to unprovability , 2007 .

[36]  Harvey M. Friedman,et al.  Higher set theory and mathematical practice , 1971 .

[37]  U. Kohlenbach.  Higher Order Reverse Mathematics , 2000 .

[38]  John C. Shepherdson,et al.  Variants of Robinson's essentially undecidable theoryR , 1983, Arch. Math. Log..

[39]  Andreas Weiermann,et al.  A CLASSIFICATION OF RAPIDLY GROWING RAMSEY FUNCTIONS , 1976 .

[40]  Petr Hájek,et al.  Combinatorial principles concerning approximations of functions , 1987, Arch. Math. Log..

[41]  G. Kreisel,et al.  The Axiom of Choice and the Class of Hyperarithmetic Functions , 1962 .

[42]  Oliver Aberth,et al.  Computable analysis , 1980 .

[43]  Jon Barwise,et al.  Admissible sets and structures , 1975 .

[44]  L. A. S. Kirby,et al.  Flipping properties in arithmetic , 1982, Journal of Symbolic Logic.

[45]  Kunquan Lan,et al.  Multiple Positive Solutions of Semilinear Differential Equations with Singularities , 2001 .

[46]  Richard A. Shore,et al.  The limits of determinacy in second order arithmetic: consistency and complexity strength , 2012, Israel Journal of Mathematics.

[47]  Haim Brezis,et al.  Existence theorems for nonlinear integral equations of Hammerstein type , 1975 .

[48]  Petr Hájek,et al.  Metamathematics of First-Order Arithmetic , 1993, Perspectives in mathematical logic.

[49]  Lew Gordeev,et al.  Phase transitions of iterated Higman-style well-partial-orderings , 2012, Arch. Math. Log..

[50]  R. K. Miller,et al.  On Volterra integral equations with nonnegative integrable resolvents , 1968 .

[51]  Richard A. Shore,et al.  The limits of determinacy in second order arithmetic: consistency and complexity strength , 2014 .

[52]  D. Hilbert.  Über das Unendliche , 1926 .

[53]  Ralf Schindler.  Set Theory: Exploring Independence and Truth , 2014 .

[54]  Leo Harrington,et al.  Analytic determinacy and 0# , 1978, Journal of Symbolic Logic.

[55]  G. Samuel Jordan,et al.  VOLTERRA INTEGRAL AND FUNCTIONAL EQUATIONS (Encyclopedia of Mathematics and its Applications 34) , 1991 .

[56]  Marian Boykan Pour-El,et al.  Computability in analysis and physics , 1989, Perspectives in Mathematical Logic.

[57]  P. Erdös,et al.  Combinatorial Theorems on Classifications of Subsets of a Given Set , 1952 .

[58]  E. Zeidler.  Nonlinear functional analysis and its applications , 1988 .

[59]  N. Young.  An Introduction to Hilbert Space , 1988 .

[60]  Philip D. Welch,et al.  Coding the Universe: Some further applications , 1982 .

[61]  K. Gödel.  Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I , 1931 .

[62]  W. Buchholz.  Iterated Inductive Definitions and Subsystems of Analysis: Recent Proof-theoretical Studies , 1981 .

[63]  Maria Meehan,et al.  Existence Theory for Nonlinear Integral and Integrodifferential Equations , 1998 .

[64]  Galen Weitkamp,et al.  Recursive Aspects of Descriptive Set Theory , 1985 .

[65]  Roman Murawski.  Recursive functions and metamathematics : problems of completeness and decidability, Gödel's theorems , 1999 .

[66]  Lev D. Beklemishev.  The Worm principle , 2003 .

[67]  Harvey M. Friedman,et al.  Finite functions and the necessary use of large cardinals , 1998, math/9811187.

[68]  Jon Barwise.  Admissible Set Theory , 1975 .

[69]  Jean-Pierre Ressayre,et al.  Model theory and arithmetic , 1981 .

[70]  W. Woodin,et al.  Supercompact cardinals, sets of reals, and weakly homogeneous trees. , 1988, Proceedings of the National Academy of Sciences of the United States of America.

[71]  Ralf Schindler,et al.  The core model induction , 2007 .

[72]  J. Paris.  A Mathematical Incompleteness in Peano Arithmetic , 1977 .

[73]  Solomon Feferman,et al.  Systems of predicative analysis , 1964, Journal of Symbolic Logic.

[74]  Ramez L. Sami.  Analytic determinacy and 0# A forcing-free proof of Harrington’s theorem , 1999 .

[75]  M. A. Krasnoselʹskii.  Topological methods in the theory of nonlinear integral equations , 1968 .