Costas Dimitracopoulos – författare
Visar alla böcker från författaren Costas Dimitracopoulos. Handla med fri frakt och snabb leverans.
3 produkter
3 produkter
1 539 kr
Skickas inom 7-10 vardagar
The Annual European Meeting of the Association for Symbolic Logic, generally known as the Logic Colloquium, is the most prestigious annual meeting in the field. Many of the papers presented there are invited surveys of developments, and the rest of the papers are chosen to complement the invited talks. This 2007 volume includes surveys, tutorials, and selected research papers from the 2005 meeting. Highlights include three papers on different aspects of connections between model theory and algebra; a survey of major advances in combinatorial set theory; a tutorial on proof theory and modal logic; and a description of Bernay's philosophy of mathematics.
286 kr
Skickas inom 5-8 vardagar
The field of weak arithmetics is an application of logical methods to number theory that was developed by mathematicians, philosophers, and theoretical computer scientists. New Studies in Weak Arithmetics is dedicated to late Australian mathematician Alan Robert Woods (1953-2011), whose seminal thesis is published here for the first time. This volume also contains the unpublished but significant thesis of Hamid Lesan (1951-2006) as well as other original papers on topics addressed in Woods' thesis and life's work that were first presented at the 31st Journees sur les Arithmetiques Faibles meeting held in Samos, Greece, in 2012.
Logic and Theory of Algorithms
4th Conference on Computability in Europe, CiE 2008 Athens, Greece, June 15-20, 2008, Proceedings
Häftad, Engelska, 2008
1 068 kr
Skickas inom 10-15 vardagar
CiE 2008: Logic and Theory of Algorithms Athens, Greece, June 15–20, 2008 Computability in Europe (CiE) is an informal network of European scientists working on computability theory, including its foundations, technical devel- ment, and applications. Among the aims of the network is to advance our t- oretical understanding of what can and cannot be computed, by any means of computation. Its scienti?c vision is broad: computations may be performed with discrete or continuous data by all kinds of algorithms, programs, and - chines. Computations may be made by experimenting with any sort of physical system obeying the laws of a physical theory such as Newtonian mechanics, quantum theory, or relativity. Computations may be very general, depending on the foundations of set theory; or very speci?c, using the combinatorics of ?nite structures. CiE also works on subjects intimately related to computation, especially theories of data and information, and methods for formal reasoning about computations. The sources of new ideas and methods include practical developments in areas such as neural networks, quantum computation, natural computation, molecular computation, computational learning. Applications are everywhere,especially, in algebra,analysisand geometry, or data types and p- gramming. Within CiE there is general recognition of the underlying relevance of computability to physics and a broad range of other sciences, providing as it does a basic analysis of the causal structure of dynamical systems. Thisvolume,Logic andTheory of Algorithms,istheproceedingsofthefourth in a series of conferences of CiE that was held at the University of Athens, June 15–20, 2008.