The road to two theorems of logic

Synthese 164 (3):333 - 339 (2008)
Work on how to axiomatize the subtheories of a first-order theory in which only a proper subset of their extra-logical vocabulary is being used led to a theorem on recursive axiomatizability and to an interpolation theorem for first-order logic. There were some fortuitous events and several logicians played a helpful role.
Keywords Recursive axiomatizability  Interpolation for first-order logic  Robinson’s joint consistency theorem  Beth’s definability theorem  Linear reasoning and the Herbrand–Gentzen theorem
Categories (categorize this paper)
DOI 10.2307/40271076
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 15,904
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA
Alan Turing (1936). On Computable Numbers, with an Application to the Entscheidungsproblem. Proceedings of the London Mathematical Society 42 (1):230-265.
William Craig (1953). On Axiomatizability Within a System. Journal of Symbolic Logic 18 (1):30-32.

View all 11 references / Add more references

Citations of this work BETA

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

14 ( #180,314 of 1,725,466 )

Recent downloads (6 months)

1 ( #349,436 of 1,725,466 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.