Welcome to our book review site go-pdf.online!
You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
Goncharov
None
Mathematical Problems from Applied Logic II
This book presents contributions from world-renowned logicians, discussing important topics of logic from the point of view of their further development in light of requirements arising from successful application in Computer Science and AI language. Coverage includes: the logic of provability, computability theory applied to biology, psychology, physics, chemistry, economics, and other basic sciences; computability theory and computable models; logic and space-time geometry; hybrid systems; logic and region-based theory of space.
Computability and Models
Science involves descriptions of the world we live in. It also depends on nature exhibiting what we can best describe as a high aLgorithmic content. The theme running through this collection of papers is that of the interaction between descriptions, in the form of formal theories, and the algorithmic content of what is described, namely of the modeLs of those theories. This appears most explicitly here in a number of valuable, and substantial, contributions to what has until recently been known as 'recursive model theory' - an area in which researchers from the former Soviet Union (in particular Novosibirsk) have been pre-eminent. There are also articles concerned with the computability of a...
I.A. Goncharov
None
Oblomov
Oblomov is the best known novel by Russian writer Ivan Goncharov, first published in 1859. Oblomov is also the central character of the novel, often seen as the ultimate incarnation of the superfluous man, a symbolic character in 19th-century Russian literature. Oblomov was compared to Shakespeare's Hamlet as answering 'No!' to the question "To be or not to be?" Oblomov is a young, generous nobleman who seems incapable of making important decisions or undertaking any significant actions. Throughout the novel he rarely leaves his room or bed and famously fails to leave his bed for the first 150 pages of the novel. The book was considered a satire of Russian nobility whose social and economic function was increasingly in question in mid-nineteenth century Russia.
Oblomov and His Creator
Goncharov's novels have been popular in Russia since their publication, and Oblomov, the central character of his most famous novel, has become the prototype of a fat and lazy man. Milton Ehre offers new interpretations of the complex personality of Goncharov and shows how in many ways Oblomov was a self-portrait of his creator. The introductory chapter neither idealizes Goncharov nor glosses over his weaknesses but shows a sensitive understanding of this major nineteenth-century Russian writer. The author goes beyond the standard critical clich�s about Goncharov to a contemporary reading of his entire artistic production. Proceeding from the assumption that meanings in art are intimately ...
Mathematical Logic in Asia
This volume is devoted to the main areas of mathematical logic and applications to computer science. There are articles on weakly o-minimal theories, algorithmic complexity of relations, models within the computable model theory, hierarchies of randomness tests, computable numberings, and complexity problems of minimal unsatisfiable formulas. The problems of characterization of the deduction-detachment theorem, ?1-induction, completeness of Le?niewski's systems, and reduction calculus for the satisfiability problem are also discussed.The coverage includes the answer to Kanovei's question about the upper bound for the complexity of equivalence relations by convergence at infinity for continuo...
Recursive Model Theory
Recursive Model Theory
Logic and Theory of Algorithms
This book constitutes the refereed proceedings of the 4th International Conference on Computability in Europe, CiE 2008, held in Athens, Greece, in June 2008. The 36 revised full papers presented together with 25 invited tutorials and lectures were carefully reviewed and selected from 108 submissions. Among them are papers of 6 special sessions entitled algorithms in the history of mathematics, formalising mathematics and extracting algorithms from proofs, higher-type recursion and applications, algorithmic game theory, quantum algorithms and complexity, and biology and computation.
