default search action
Archiv für mathematische Logik und Grundlagenforschung, Volume 23
Volume 23, Number 1, December 1983
- Martin W. Bunder:
Predicate calculus of arbitrarily high finite order. 1-10 - Michael von Rimscha:
Bases of ZF0-models. 11-19 - Richard Statman:
λ-definable functionals andβη conversion. 21-26 - Daniele Mundici:
A lower bound for the complexity of Craig's interpolants in sentential logic. 27-36 - Daniele Mundici:
Natural limitations of decision procedures for arithmetic with bounded quantifiers. 37-54 - T. B. Flannagan:
A note on a proof of Shepherdson. 55-60 - James P. Jones, John C. Shepherdson:
Variants of Robinson's essentially undecidable theoryR. 61-64 - Gerhard Jäger:
A well-ordering proof for Feferman's theoryT0. 65-77 - Dag Normann:
R.E. degrees of continuous functionals. 79-98 - Martin W. Bunder:
A one axiom set theory based on higher order predicate calculus. 99-107 - Martin W. Bunder:
Set theory in predicate calculus with equality. 109-113 - Evangelos Kranakis:
Definable Ramsey and definable Erdös ordinals. 115-128 - Matthias Ragaz:
Die Unentscheidbarkeit der einstelligen unendlichwertigen Prädikatenlogik. 129-139 - Matthias Ragaz:
Die Nichtaxiomatisierbarkeit der unendlichwertigen Mengenlehre. 141-146 - Anand Pillay:
A note on tight stable theorie. 147-152 - Andre Scedrov, Richard Vesley:
On a weakening of Markov's Principle. 153-160 - Jovan Naumovic:
A classification of the one-argument primitive recursive functions. 161-174 - Hans Kleine Büning:
A classification of an iterative hierarchy. 175-186
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.