A set of postulates for the foundation of logic. II
From MaRDI portal
Publication:1839846
DOI10.2307/1968702zbMath0008.28902OpenAlexW4240853462MaRDI QIDQ1839846
Publication date: 1933
Published in: Annals of Mathematics. Second Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/1968702
Related Items
Parallel graph rewriting on loosely coupled machine architectures, A computable expression of closure to efficient causation, Combinatory recursive objects of all finite types, Gödel on deduction, Hilbert’s Axiomatisches Denken, Homotopy type theory and Voevodsky’s univalent foundations, On Church's formal theory of functions and functionals. The \(\lambda\)- calculus: Connections to higher type recursion theory, proof theory, category theory, Enlargements of functional algebras for the lambda calculus, Developing developments, Revisiting the notion of function, When Logic Meets Engineering: Introduction to Logical Issues in the History and Philosophy of Computer Science, A Vindication of Program Verification, A synthetic axiomatization of map theory, Ein Typenfreies System der Logik mit Ausreichender Mathematischer Anwendungsfähigkeit I, The search for a reduction in combinatory logic equivalent to \(\alpha\beta\)-reduction, Step by Recursive Step: Church's Analysis of Effective Calculability, Sixty years after Gödel, The Operational Perspective: Three Routes, HYPERCOMPUTATION: FANTASY OR REALITY? A POSITION PAPER, Platitudes in mathematics, Is Universal Computation a Myth?, A global representation of the recursive functions in the \(\lambda\)- calculus, 2008 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '08, The Operational Penumbra: Some Ontological Aspects, Unnamed Item, Probleme der Hilbertschen Theorie der höheren Stufen von rekursiven Funktionen, Alonzo Church's Contributions to Philosophy and Intensional Logic, From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models, Computation and Indispensability, The theory of recursive functions, approaching its centennial