Categories

Keywords

Reprint years

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,881

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.

My notes

Similar books and articles

A mechanical proof of the unsolvability of the halting problem.Robert Boyer - unknown
Human and machine interpretation of expressions in formal systems.Herbert A. Simon & Stuart A. Eisenstadt - 1998 - Synthese 116 (3):439-461.
Notes on a formalization of the prime number theorem.Jeremy Avigad - unknown
Every computably enumerable random real is provably computably enumerable random.Cristian Calude & Nicholas Hay - 2009 - Logic Journal of the IGPL 17 (4):351-374.
Hindman's theorem: An ultrafilter argument in second order arithmetic.Henry Towsner - 2011 - Journal of Symbolic Logic 76 (1):353 - 360.
DFC-algorithms for Suszko logic and one-to-one Gentzen type formalizations.Anita Wasilewska - 1984 - Studia Logica 43 (4):395 - 404.
Human-oriented and machine-oriented reasoning: Remarks on some problems in the history of Automated Theorem Proving. [REVIEW]Furio Di Paola - 1988 - AI and Society 2 (2):121-131.
Computers, justification, and mathematical knowledge.Konstantine Arkoudas & Selmer Bringsjord - 2007 - Minds and Machines 17 (2):185-202.
System description: { A higher-order theorem prover?Michael Kohlhase - manuscript
The four-color theorem and mathematical proof.Michael Detlefsen & Mark Luker - 1980 - Journal of Philosophy 77 (12):803-820.
Brouwer's equivalence between virtual and inextensible order.Enrico Martino - 1988 - History and Philosophy of Logic 9 (1):57-66.
Planar and braided proof-nets for multiplicative linear logic with mix.G. Bellin & A. Fleury - 1998 - Archive for Mathematical Logic 37 (5-6):309-325.
Mathematical logic.Heinz-Dieter Ebbinghaus - 1996 - New York: Springer. Edited by Jörg Flum & Wolfgang Thomas.
Godel's theorem, church's theorem, and mechanism.J. J. C. Smart - 1961 - Synthese 13 (1):105-10.
On Formalization of Model-Theoretic Proofs of Gödel's Theorems.Makoto Kikuchi & Kazuyuki Tanaka - 1994 - Notre Dame Journal of Formal Logic 35 (3):403-412.

Analytics

Added to PP
2016-01-12

Downloads
23 (#682,085)

6 months
9 (#308,593)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Jeremy Avigad
Carnegie Mellon University

Citations of this work

Reliability of mathematical inference.Jeremy Avigad - 2020 - Synthese 198 (8):7377-7399.
Non-deductive methods in mathematics.Alan Baker - 2010 - Stanford Encyclopedia of Philosophy.
A formalised theorem in the partition calculus.Lawrence C. Paulson - 2024 - Annals of Pure and Applied Logic 175 (1):103246.

View all 6 citations / Add more citations

References found in this work

No references found.

Add more references