We examine some of Connes’ criticisms of Robinson’s infinitesimals starting in 1995. Connes sought to exploit the Solovay model S as ammunition against non-standard analysis, but the model tends to boomerang, undercutting Connes’ own earlier work in functional analysis. Connes described the hyperreals as both a “virtual theory” and a “chimera”, yet acknowledged that his argument relies on the transfer principle. We analyze Connes’ “dart-throwing” thought experiment, but reach an opposite conclusion. In S , all definable sets of reals are (...) Lebesgue measurable, suggesting that Connes views a theory as being “virtual” if it is not definable in a suitable model of ZFC. If so, Connes’ claim that a theory of the hyperreals is “virtual” is refuted by the existence of a definable model of the hyperreal field due to Kanovei and Shelah. Free ultrafilters aren’t definable, yet Connes exploited such ultrafilters both in his own earlier work on the classification of factors in the 1970s and 80s, and in Noncommutative Geometry, raising the question whether the latter may not be vulnerable to Connes’ criticism of virtuality. We analyze the philosophical underpinnings of Connes’ argument based on Gödel’s incompleteness theorem, and detect an apparent circularity in Connes’ logic. We document the reliance on non-constructive foundational material, and specifically on the Dixmier trace −∫ (featured on the front cover of Connes’ magnum opus) and the Hahn–Banach theorem, in Connes’ own framework. We also note an inaccuracy in Machover’s critique of infinitesimal-based pedagogy. (shrink)

We consider games over a finite alphabet with Gurevich-Harrington's winning conditions and restraints as in Yakhnis-Yakhnis . The game tree, the Gurevich-Harrington's kernels of the winning condition and the restraints are defined by finite automata. We give an effective criterion to determine the winning player and an effective presentation of a class of finite automata defined winning strategies.Our approach yields an alternative solution to the games considered by Büchi and Landweber . The BL algorithm is an important tool for solving (...) effectively presented games. The differences between the BL and our algorithms are as follows. Our algorithm is uniformly applicable to winning sets that correspond to boolean combinations of BL winning conditions, while the BL algorithm requires a transformation of such boolean combinations into a single BL condition. Our algorithm directly applies to a larger class of game trees for a given game alphabet than does the BL one. We describe Büchi-Landweber's class of winning conditions in a more transparent way by using finite automata and Gurevich-Harrington's form of winning conditions. Our algorithms that determine the winner of the game and find a winning strategy, are based on a translation of the events in the game in terms of the transition table of the automaton representing the game. This automaton differs from the ones that represent BL winning conditions. Both algorithms need further investigation.The algorithm determining the winner in the game, can be used as a verifier of concurrent programs. This is because programs can be viewed as strategies in Gurevich-Harrington's games and program specifications could be regarded as winning conditions for such games. The algorithm which finds a winning strategy could be used as a basis for automated concurrent program design.The present paper is a sequel to Annals of Pure and Applied Logic 48 277–297. (shrink)

The parameter-free part $$\textbf{PA}_2^*$$ of $$\textbf{PA}_2$$, second order Peano arithmetic, is considered. We make use of a product/iterated Sacks forcing to define an $$\omega $$ -model of $$\textbf{PA}_2^*+ \textbf{CA}(\Sigma ^1_2)$$, in which an example of the full Comprehension schema $$\textbf{CA}$$ fails. Using Cohen’s forcing, we also define an $$\omega $$ -model of $$\textbf{PA}_2^*$$, in which not every set has its complement, and hence the full $$\textbf{CA}$$ fails in a rather elementary way.

We prove that if I is a partially ordered set in a countable transitive model M of ZFC then M can be extended by a generic sequence of reals a i , i ∈ I, such that ℵ M 1 is preserved and every a i is Sacks generic over $\mathfrak{M}[\langle \mathbf{a}_j: j . The structure of the degrees of M-constructibility of reals in the extension is investigated. As applications of the methods involved, we define a cardinal invariant to distinguish (...) product and iterated Sacks extensions, and give a short proof of a theorem (by Budinas) that in ω 2 -iterated Sacks extension of L the Burgess selection principle for analytic equivalence relations holds. (shrink)

The small, the tiny, and the infinitesimal have been the object of both fascination and vilification for millenia. One of the most vitriolic reviews in mathematics was that written by Errett Bishop about Keisler’s book Elementary Calculus: an Infinitesimal Approach. In this skit we investigate both the argument itself, and some of its roots in Bishop George Berkeley’s criticism of Leibnizian and Newtonian Calculus. We also explore some of the consequences to students for whom the infinitesimal approach is congenial. The (...) casual mathematical reader may be satisfied to read the text of the five act play, whereas the others may wish to delve into the 130 footnotes, some of which contain elucidation of the mathematics or comments on the history. (shrink)

The short exposition of the triplet model of concepts and some definitions connected with it are given. In this model any concept may be depicted as having three characteristics: a base, a representing part and the linkage between them. The paper introduces the fuzzification of concepts in terms of the triplet model.

The scheme for classifications of concepts is introduced. It has founded on the triplet model of concepts. In this model a concept is depicted by means of three kinds of knowledge: a concept base, a concept representing part and the linkage between them. The idea of triplet classifications of concepts is connected with a usage of various specifications of these knowledge kinds as classification criteria.

ABSTRACT Two models of the Aristotelian syllogistic in arithmetic of natural numbers are built as realizations of an old Leibniz idea. In the interpretation, called Scholastic, terms are replaced by integers greater than 1, and s.Ap is translated as “s is a divisor of p”, sIp as “g.c.d. > 1”. In the interpretation, called Leibnizian, terms are replaced by proper divisors of a special “Universe number” u < 1, and sAp is translated as “s is divisible by p”, sIp as (...) ‘l.c.m. < u”. Both interpretations are proved to be adequate to the Aristotelian syllogistic. They are extended to syllogistic including term negation and term conjunction as well. (shrink)

The Petrine-Pushkinian era lasted no more than two hundred years. It originated at the Battle of Poltava, where Russian troops first showed themselves not just equal to the Swedes, who were otherwi...

The triplet model treats a concept as complex structure that expresses three kinds of information. The first is about entities subsumed under a concept,their properties and relations. The second is about means and ways of representing the first information in intelligent systems. The third is about linkage between the first and second ones and methods of its constructing. The application of triplet models to generalization and development of concept models in philosophy, logic, cognitive psychology, cognitive science, linguistics, artificial intelligence has (...) been demonstrated. The componential structure of the triplet model and extended concept classification have been given. Theoretical considerations are combined with historical case-studies of concept history. For scientists and students with an interest in problems of knowledge structure and representation. Abstract and Extended Summary in English. (shrink)

The paper has three objectives: to expound a set-theoretical triplet model of concepts; to introduce some triplet relations (symbolic, logical, and mathematical formalization; equivalence, intersection, disjointness) between object concepts, and to instantiate them by relations between certain physical object concepts.

It is proposed to analyze fuzzy concepts and relations between them in the frame of triplet concept modeling. Fuzzy concepts are introduced by means of the so-called fuzzification of dichotomous concepts. The cognitive and psychological aspects of concept possession are separated and studied.

It is proposed to analyze the unity of scientific knowledge in terms of its structure-nominative reconstruction. -/- .

There are no universally adopted answers to the natural questions about scientific concepts: What are they? What is their structure? What are their functions? How many kinds of them are there? Do they change? Ironically, most if not all scientific monographs or articles mention concepts, but the scientific studies of scientific concepts are rare in occurrence. It is well known that the necessary stage of any scientific study is constructing the model of objects in question. Many years logical modeling was (...) dominant in the concept studies. Last decades, concepts came to be regarded as the subject of mathematical modeling. However, different authors take different features of concepts as independent variables of their models. Our objective is to characterize informally the spectra of relevant variables for the modeling of scientific concepts. (shrink)

The changes of concepts are described in the frame of concept triplet model. -/- .

This book constitutes the refereed proceedings of the 20th International Conference on Logic Programming, ICLP 2004, held in Saint-Malo, France in September 2004. The 28 revised full papers and 16 poster papers presented together with 2 invited papers were carefully reviewed and selected from 70 submissions. The papers are organized in topical sections on program analysis, constraints, alternative programming paradigms, answer set programming, and implementation.

Можно ли сказать, что в центре христианской культуры лежит искушение - как о том свидетельствуют в евангельских повествованиях искушения Христа Дьяволом? Так, кажется, думает Достоевский, который - в особенности в «Братьях Карамазовых» - стремится показать, что именно невинные становятся жертвами дьявольских козней. Такова для него и ситуация русского народа, который он идеализирует, противопоставляя его интеллигенции. В реальности, как показывает недавняя история, эта претензия на «невинность» русского народа была лишь фантазмом Достоевского. La tentation serait-elle au centre de la culture chrétienne comme (...) le donneraient à penser les tentations du Christ par le Démon que racontent les évangiles ? C’est ce que semble croire Dostoïevski qui, en particulier dans Les frères Karamazov, s’efforce de montrer que ce sont justement des innocents qui sont soumis à ces manoeuvres démoniaques. Telle serait, d’ailleurs, d’après lui, la situation du peuple russe, qu’il idéalise en l’opposant à l’intelligentsia. En réalité - l’histoire récente l’a montré - cette prétendue « innocence » du peuple russe n’était qu’un fantasme de Dostoïevski. Is temptation at the center of Christian culture, as suggested by the temptations Christ had been exposed to by the Devil, according to the Gospels? This is what Dostoyevsky seems to believe, most notably in The Brothers Karamazov, in which he aims at showing that only innocent people are subject to these demonic maneuvers. This would also be, according to him, the situation of the Russian people, which he idealizes, contrasting it to the intelligentsia. In fact, recent history has shown that this alleged « innocence » of the Russian people was a fantasy of Dostoyevsky. (shrink)

We prove that a Spector‐like ultrapower extension ???? of a countable Solovay model ???? (where all sets of reals are Lebesgue measurable) is equal to the set of all sets constructible from reals in a generic extension ????[a], where a is a random real over ????. The proof involves the Solovay almost everywhere uniformization technique.

The quotient ℝ/G of the additive group of the reals modulo a countable subgroup G does not admit nontrivial Baire measurable automorphisms.

We prove that a necessary and sufficient condition for a countable set L of sets of integers to be equal to the algebra of all sets of integers definable in a nonstandard elementary extension of ω by a formula of the PA language which may include the standardness predicate but does not contain nonstandard parameters, is as follows: L is closed under arithmetical definability and contains 0 (ω) , the set of all (Gödel numbers of) true arithmetical sentences. Some results (...) related to definability of sets of integers in elementary extensions of ω are included. (shrink)

We demonstrate that the special model axiom SMA of Ross admits a natural formalization in Kawai's nonstandard set theory KST but is independent of KST. As an application of our methods to classical model theory, we present a short proof of the consistency of the existence of a k+ like k-saturated model of PA for a given cardinal k.

In this article, the author examines the work of Boris Pasternak, primarily his novel Doctor Zhivago, in the context of his Marburg experience and Kantian ideas as the basis of his moral-aesthetic...

The author examines Herzen's political outlook as reflected in his journal Kolokol and discusses his relationships with other revolutionary and reformist Russian thinkers of his time.

This paper is devoted to fill the gap in studying logics for biprobability structures. We introduce the logic equation image with two conditional expectation operators and prove the completeness theorem. © 2011 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

This article discusses the connection between the ideas of Fyodor M. Dostoevsky and Vladimir S. Solovyov on the need for cultural and moral transformation of those who would claim to participate in...

My dear Aleksandr!I have finally found some quiet time for a slow and attentive read of your article “The Beginning of the Black Notebooks.”1 I very much liked the article, especially for your trul...