- The Quantum Strategy of Completeness: On the Self-Foundation of Mathematics.Vasil Penchev - 2020 - Cultural Anthropology eJournal (Elsevier: SSRN) 5 (136):1-12.details
|
|
A Mathematical Model of Quantum Computer by Both Arithmetic and Set Theory.Vasil Penchev - 2020 - Information Theory and Research eJournal 1 (15):1-13.details
|
|
Representation and Reality by Language: How to make a home quantum computer?Vasil Penchev - 2020 - Philosophy of Science eJournal (Elsevier: SSRN) 13 (34):1-14.details
|
|
Logic in mathematics and computer science.Richard Zach - forthcoming - In Filippo Ferrari, Elke Brendel, Massimiliano Carrara, Ole Hjortland, Gil Sagi, Gila Sher & Florian Steinberger (eds.), Oxford Handbook of Philosophy of Logic. Oxford, UK: Oxford University Press.details
|
|
Jan von Plato.* Can Mathematics be Proved Consistent?John W. Dawson - 2023 - Philosophia Mathematica 31 (1):104-111.details
|
|
Functional interpretation of Aczel's constructive set theory.Wolfgang Burr - 2000 - Annals of Pure and Applied Logic 104 (1-3):31-73.details
|
|
Concepts and aims of functional interpretations: Towards a functional interpretation of constructive set theory.Wolfgang Burr - 2002 - Synthese 133 (1-2):257 - 274.details
|
|
Classical truth in higher types.Ulrich Berger - 2008 - Mathematical Logic Quarterly 54 (3):240-246.details
|
|
The metamathematics of ergodic theory.Jeremy Avigad - 2009 - Annals of Pure and Applied Logic 157 (2-3):64-76.details
|
|
Proof theory in philosophy of mathematics.Andrew Arana - 2010 - Philosophy Compass 5 (4):336-347.details
|
|
Identity and intensionality in Univalent Foundations and philosophy.Staffan Angere - 2017 - Synthese 198 (Suppl 5):1-41.details
|
|
Jean van Heijenoort’s Contributions to Proof Theory and Its History.Irving H. Anellis - 2012 - Logica Universalis 6 (3-4):411-458.details
|
|
Binary Refinement Implies Discrete Exponentiation.Peter Aczel, Laura Crosilla, Hajime Ishihara, Erik Palmgren & Peter Schuster - 2006 - Studia Logica 84 (3):361-368.details
|
|
Wilfried Sieg. Hilbert's Programs and Beyond. Oxford: Oxford University Press, 2013. ISBN 978-0-19-537222-9 ; 978-0-19-970715-7 . Pp. xii + 439†. [REVIEW]Oran Magal - 2014 - Philosophia Mathematica 22 (3):417-423.details
|
|
Fatal Heyting Algebras and Forcing Persistent Sentences.Leo Esakia & Benedikt Löwe - 2012 - Studia Logica 100 (1-2):163-173.details
|
|
Identity in Martin‐Löf type theory.Ansten Klev - 2021 - Philosophy Compass 17 (2):e12805.details
|
|
Consistency, Models, and Soundness.Matthias Schirn - 2010 - Axiomathes 20 (2):153-207.details
|
|
Epistemology Versus Ontology: Essays on the Philosophy and Foundations of Mathematics in Honour of Per Martin-Löf.Peter Dybjer, Sten Lindström, Erik Palmgren & Göran Sundholm (eds.) - 2012 - Dordrecht, Netherland: Springer.details
|
|
Constructivity and Computability in Historical and Philosophical Perspective.Jacques Dubucs & Michel Bourdeau (eds.) - 2014 - Dordrecht, Netherland: Springer.details
|
|
Introduction.Thomas Strahm - 2008 - Dialectica 62 (2):145–147.details
|
|
Vom Unendlichen zum Endlichen.Eduard Wette - 1970 - Dialectica 24 (4):303-323.details
|
|
Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones. [REVIEW]Andreas Weiermann - 1995 - Archive for Mathematical Logic 34 (5):313-330.details
|
|
A proof of strongly uniform termination for Gödel's \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $T$\end{document} by methods from local predicativity. [REVIEW]Andreas Weiermann - 1997 - Archive for Mathematical Logic 36 (6):445-460.details
|
|
A decidable theory of type assignment.William R. Stirton - 2013 - Archive for Mathematical Logic 52 (5-6):631-658.details
|
|
A General Theorem on Existence Theorems.Martin Stein - 1981 - Mathematical Logic Quarterly 27 (25‐30):435-452.details
|
|
Alan Turing: person of the XXth century?José M. Sánchez Ron - 2013 - Arbor 189 (764):a085.details
|
|
On Extracting Variable Herbrand Disjunctions.Andrei Sipoş - 2022 - Studia Logica 110 (4):1115-1134.details
|
|
When physical systems realize functions.Matthias Scheutz - 1999 - Minds and Machines 9 (2):161-196.details
|
|
Unique solutions.Peter Schuster - 2006 - Mathematical Logic Quarterly 52 (6):534-539.details
|
|
Dialectica interpretation of well-founded induction.Helmut Schwichtenberg - 2008 - Mathematical Logic Quarterly 54 (3):229-239.details
|
|
A Free‐Variable Theory of Primitive Recursive Arithmetic.Daniel G. Schwartz - 1987 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 33 (2):147-157.details
|
|
An indeterminate universe of sets.Chris Scambler - 2020 - Synthese 197 (2):545-573.details
|
|
Reverse formalism 16.Sam Sanders - 2020 - Synthese 197 (2):497-544.details
|
|
On the computational content of the Bolzano-Weierstraß Principle.Pavol Safarik & Ulrich Kohlenbach - 2010 - Mathematical Logic Quarterly 56 (5):508-532.details
|
|
Propositions as games as types.Aarne Ranta - 1988 - Synthese 76 (3):377 - 395.details
|
|
Ptykes in GödelsT und Definierbarkeit von Ordinalzahlen.Peter Päppinghaus - 1989 - Archive for Mathematical Logic 28 (2):119-141.details
|
|
The Limits of Computation.Andrew Powell - 2022 - Axiomathes 32 (6):991-1011.details
|
|
On Paradoxes in Normal Form.Mattia Petrolo & Paolo Pistone - 2019 - Topoi 38 (3):605-617.details
|
|
Reflexive consistency proofs and gödel's second theorem.Paul Sagal - 1989 - Philosophia Mathematica (1):58-60.details
|
|
William Tait. The provenance of pure reason. Essays on the philosophy of mathematics and on its history.Charles Parsons - 2009 - Philosophia Mathematica 17 (2):220-247.details
|
|
Bar recursion over finite partial functions.Paulo Oliva & Thomas Powell - 2017 - Annals of Pure and Applied Logic 168 (5):887-921.details
|
|
A direct proof of schwichtenberg’s bar recursion closure theorem.Paulo Oliva & Silvia Steila - 2018 - Journal of Symbolic Logic 83 (1):70-83.details
|
|
Truth vs. provability – philosophical and historical remarks.Roman Murawski - 2002 - Logic and Logical Philosophy 10:93.details
|
|
Recursive Functions and Metamathematics: Problems of Completeness and Decidability, Gödel's Theorems.Rod J. L. Adams & Roman Murawski - 1999 - Dordrecht, Netherland: Springer Verlag.details
|
|
The consistency problem for set theory: An essay on the Cantorian foundations of mathematics (II).John Mayberry - 1977 - British Journal for the Philosophy of Science 28 (2):137-170.details
|
|
Extensions of the Finitist Point of View.Matthias Schirn & Karl-Georg Niebergall - 2001 - History and Philosophy of Logic 22 (3):135-161.details
|
|
On Not Saying What We Shouldn't Have to Say.Shay Logan & Leach-Krouse Graham - 2021 - Australasian Journal of Logic 18 (5):524-568.details
|
|
Reflection Principles and Their Use for Establishing the Complexity of Axiomatic Systems.Georg Kreisel & Azriel Lévy - 1968 - Zeitschrift für Mathematische Logic Und Grundlagen der Mathematik 14 (1):97--142.details
|
|
Reflection Principles and their Use for Establishing the Complexity of Axiomatic Systems.G. Kreisel & A. Lévy - 1968 - Mathematical Logic Quarterly 14 (7-12):97-142.details
|
|
Non-principal ultrafilters, program extraction and higher-order reverse mathematics.Alexander P. Kreuzer - 2012 - Journal of Mathematical Logic 12 (1):1250002-.details
|
|