- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Informatikai matematikai alapvetés
Debrecen: Debreceni Egyetem Kossuth Egyetemi Kiadó (2006)
Abstract
This article has no associated abstract. (fix it)Other Versions
No versions found
Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
Gödel '96 Logical Foundations of Mathematics, Computer Science and Physics Kurt GÖdel's Legacy.Petr Hájek & Jiří Zlatuška - 1996 - Bulletin of Symbolic Logic 2 (4):473-473.
Computers and mathematics: The search for a discipline of computer science.Michael S. Mahoney - 1992 - In Javier Echeverría, Andoni Ibarra & Thomas Mormann (eds.), The space of mathematics: philosophical, epistemological, and historical explorations. New York: W. de Gruyter. pp. 349--363.
Some Historical, Philosophical and Methodological Remarks on Proof in Mathematics.Roman Murawski - 2016 - In Peter Schuster & Dieter Probst (eds.), Concepts of Proof in Mathematics, Philosophy, and Computer Science. Boston: De Gruyter. pp. 251-268.
Hardness assumptions in the foundations of theoretical computer science.Jan Krajíček - 2005 - Archive for Mathematical Logic 44 (6):667-675.
A first course in formal logic and its applications in computer science.Roy Dowsing - 1986 - Boston: Blackwell Scientific Publications. Edited by V. J. Rayward-Smith & C. D. Walter.
Introduction.Peter Schuster & Dieter Probst - 2016 - In Peter Schuster & Dieter Probst (eds.), Concepts of Proof in Mathematics, Philosophy, and Computer Science. Boston: De Gruyter. pp. 1-4.
Abstraction in computer science.Timothy Colburn & Gary Shute - 2007 - Minds and Machines 17 (2):169-184.
The Foundational Debate: Complexity and Constructivity in Mathematics and Physics.Werner DePauli-Schimanovich, Eckehart Köhler & Friedrich Stadler (eds.) - 1995 - Dordrecht, Boston and London: Kluwer Academic Publishers.
Analytics
Added to PP
2013-04-23
Downloads
7 (#1,640,750)
6 months
3 (#1,477,354)
2013-04-23
Downloads
7 (#1,640,750)
6 months
3 (#1,477,354)
Historical graph of downloads
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-667477cd97-lv8mh dc2