Problems in Set Theory, Mathematical Logic and the Theory of Algorithms

, , &
Studia Logica 81 (2):283-285 (2005)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Links

PhilArchive



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

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Igor Lavrov and Larisa Maksimova, problems in set theory, mathematical logic and the theory of algorithms, edited by Giovanna Corsi, translated by Valentin Shehtman, kluwer academic/plenum publishers, new York, 2003, US$141.00, pp. XI + 282, ISBN 0-306-47712-2, hardbound. [REVIEW]Ewa Palka - 2005 - Studia Logica 81 (2):283-292.
Problems in Set Theory, Mathematical Logic and the Theory of Algorithms.Igor Lavrov, Larisa Maksimova & Giovanna Corsi - 2005 - Studia Logica 79 (3):409-410.
Book review: Igor Lavrov, Larisa Maksimova, problems in set theory, mathematical logic and the theory of algorithms, edited by Giovanna Corsi, kluwer academic / plenum publishers, 2003, us$141.00, pp. XII + 282, isbn 0-306-47712-2, hardbound. [REVIEW]Elliott Mendelson - 2005 - Studia Logica 79 (3):409-410.
Foundations of mathematical logic.Haskell Brooks Curry - 1963 - New York: Dover Publications.
Problems in Set Theory, Mathematical Logic, and the Theory of Algorithms.John T. Baldwin - 2004 - Bulletin of Symbolic Logic 10 (2):222-223.
Mathematical logic, the theory of algorithms, and the theory of sets.S. I. Adi︠a︡n (ed.) - 1977 - Providence, R.I.: American Mathematical Society.
Popular lectures on mathematical logic.Hao Wang - 1981 - New York: Dover Publications.
Theory of Deductive Systems and Its Applications.S. Iu Maslov, Michael Gelfond & Vladimir Lifschitz - 1987 - MIT Press (MA).
Set Theory and Logic.Robert Roth Stoll - 2012 - San Francisco and London: Courier Corporation.
How experimental algorithmics can benefit from Mayo’s extensions to Neyman–Pearson theory of testing.Thomas Bartz-Beielstein - 2008 - Synthese 163 (3):385-396.
How experimental algorithmics can benefit from Mayo’s extensions to Neyman–Pearson theory of testing.Thomas Bartz-Beielstein - 2008 - Synthese 163 (3):385 - 396.
The prospects for mathematical logic in the twenty-first century.Samuel R. Buss, Alexander S. Kechris, Anand Pillay & Richard A. Shore - 2001 - Bulletin of Symbolic Logic 7 (2):169-196.
Classification Theory: Proceedings of the U.S.-Israel Workshop on Model Theory in Mathematical Logic Held in Chicago, Dec. 15-19, 1985.J. T. Baldwin & U. Workshop on Model Theory in Mathematical Logic - 1987 - Springer.
Computability & unsolvability.Martin Davis - 1958 - New York: Dover Publications.
The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions.Martin Davis (ed.) - 1965 - Hewlett, NY, USA: Dover Publication.

Analytics

Added to PP
2017-02-21

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Author Profiles

Valentin Shehtman
Moscow State University
Giovanna Corsi
Università degli Studi di Bologna

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references